./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s12if.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ff03de63 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/s12if.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 82bfc5dbe63d3250f02def4ff730c5e861bce4a7ef8a101c197bc29dbc0e3123 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 10:14:25,118 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 10:14:25,120 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 10:14:25,159 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 10:14:25,160 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 10:14:25,160 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 10:14:25,164 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 10:14:25,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 10:14:25,168 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 10:14:25,168 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 10:14:25,169 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 10:14:25,169 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 10:14:25,170 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 10:14:25,171 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 10:14:25,171 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 10:14:25,172 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 10:14:25,173 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 10:14:25,173 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 10:14:25,174 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 10:14:25,175 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 10:14:25,176 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 10:14:25,176 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 10:14:25,177 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 10:14:25,178 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 10:14:25,179 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 10:14:25,179 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 10:14:25,180 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 10:14:25,180 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 10:14:25,180 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 10:14:25,181 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 10:14:25,181 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 10:14:25,182 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 10:14:25,182 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 10:14:25,183 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 10:14:25,183 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 10:14:25,183 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 10:14:25,184 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 10:14:25,184 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 10:14:25,184 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 10:14:25,185 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 10:14:25,185 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 10:14:25,186 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-21 10:14:25,198 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 10:14:25,199 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 10:14:25,199 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 10:14:25,199 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 10:14:25,199 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 10:14:25,200 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 10:14:25,200 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 10:14:25,200 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 10:14:25,200 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 10:14:25,201 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 10:14:25,201 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 10:14:25,201 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 10:14:25,201 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 10:14:25,201 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 10:14:25,201 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 10:14:25,201 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 10:14:25,202 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 10:14:25,202 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 10:14:25,202 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 10:14:25,202 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 10:14:25,202 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 10:14:25,202 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 10:14:25,203 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 10:14:25,203 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 10:14:25,203 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 10:14:25,203 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 10:14:25,203 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 10:14:25,204 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 10:14:25,204 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 10:14:25,204 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 10:14:25,204 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 10:14:25,204 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 10:14:25,204 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 10:14:25,204 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 10:14:25,205 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 -> 82bfc5dbe63d3250f02def4ff730c5e861bce4a7ef8a101c197bc29dbc0e3123 [2021-12-21 10:14:25,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 10:14:25,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 10:14:25,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 10:14:25,386 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 10:14:25,387 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 10:14:25,387 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s12if.c [2021-12-21 10:14:25,437 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6947f4419/c79e1524e80a42488897ded665916371/FLAG8c8208bee [2021-12-21 10:14:25,819 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 10:14:25,820 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s12if.c [2021-12-21 10:14:25,827 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6947f4419/c79e1524e80a42488897ded665916371/FLAG8c8208bee [2021-12-21 10:14:25,837 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6947f4419/c79e1524e80a42488897ded665916371 [2021-12-21 10:14:25,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 10:14:25,840 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 10:14:25,841 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 10:14:25,841 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 10:14:25,848 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 10:14:25,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:14:25" (1/1) ... [2021-12-21 10:14:25,850 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d714aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:25, skipping insertion in model container [2021-12-21 10:14:25,850 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:14:25" (1/1) ... [2021-12-21 10:14:25,854 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 10:14:25,865 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 10:14:26,008 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s12if.c[588,601] [2021-12-21 10:14:26,031 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 10:14:26,036 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 10:14:26,044 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s12if.c[588,601] [2021-12-21 10:14:26,052 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 10:14:26,063 INFO L208 MainTranslator]: Completed translation [2021-12-21 10:14:26,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:26 WrapperNode [2021-12-21 10:14:26,064 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 10:14:26,065 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 10:14:26,065 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 10:14:26,065 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 10:14:26,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:26" (1/1) ... [2021-12-21 10:14:26,075 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:26" (1/1) ... [2021-12-21 10:14:26,088 INFO L137 Inliner]: procedures = 17, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 90 [2021-12-21 10:14:26,089 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 10:14:26,089 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 10:14:26,089 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 10:14:26,089 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 10:14:26,099 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:26" (1/1) ... [2021-12-21 10:14:26,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:26" (1/1) ... [2021-12-21 10:14:26,100 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:26" (1/1) ... [2021-12-21 10:14:26,101 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:26" (1/1) ... [2021-12-21 10:14:26,105 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:26" (1/1) ... [2021-12-21 10:14:26,109 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:26" (1/1) ... [2021-12-21 10:14:26,110 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:26" (1/1) ... [2021-12-21 10:14:26,112 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 10:14:26,112 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 10:14:26,112 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 10:14:26,112 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 10:14:26,113 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:26" (1/1) ... [2021-12-21 10:14:26,118 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 10:14:26,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:14:26,143 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) [2021-12-21 10:14:26,170 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 [2021-12-21 10:14:26,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 10:14:26,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 10:14:26,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-21 10:14:26,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-21 10:14:26,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-21 10:14:26,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 10:14:26,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 10:14:26,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-21 10:14:26,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 10:14:26,247 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 10:14:26,248 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 10:14:26,378 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 10:14:26,382 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 10:14:26,382 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-21 10:14:26,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:14:26 BoogieIcfgContainer [2021-12-21 10:14:26,383 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 10:14:26,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 10:14:26,385 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 10:14:26,387 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 10:14:26,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 10:14:25" (1/3) ... [2021-12-21 10:14:26,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12af74ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 10:14:26, skipping insertion in model container [2021-12-21 10:14:26,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:26" (2/3) ... [2021-12-21 10:14:26,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12af74ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 10:14:26, skipping insertion in model container [2021-12-21 10:14:26,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:14:26" (3/3) ... [2021-12-21 10:14:26,389 INFO L111 eAbstractionObserver]: Analyzing ICFG s12if.c [2021-12-21 10:14:26,392 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 10:14:26,393 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-21 10:14:26,438 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 10:14:26,448 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-21 10:14:26,463 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-21 10:14:26,473 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:14:26,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-21 10:14:26,482 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:14:26,482 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:14:26,483 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:14:26,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:14:26,488 INFO L85 PathProgramCache]: Analyzing trace with hash -845308063, now seen corresponding path program 1 times [2021-12-21 10:14:26,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:14:26,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153024767] [2021-12-21 10:14:26,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:26,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:14:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:26,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 10:14:26,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:14:26,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153024767] [2021-12-21 10:14:26,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153024767] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:14:26,594 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:14:26,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 10:14:26,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274363345] [2021-12-21 10:14:26,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:14:26,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-21 10:14:26,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:14:26,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-21 10:14:26,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-21 10:14:26,619 INFO L87 Difference]: Start difference. First operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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) [2021-12-21 10:14:26,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:14:26,633 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2021-12-21 10:14:26,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-21 10:14:26,635 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 [2021-12-21 10:14:26,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:14:26,640 INFO L225 Difference]: With dead ends: 42 [2021-12-21 10:14:26,641 INFO L226 Difference]: Without dead ends: 19 [2021-12-21 10:14:26,643 INFO L932 BasicCegarLoop]: 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 [2021-12-21 10:14:26,645 INFO L933 BasicCegarLoop]: 28 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, 28 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 [2021-12-21 10:14:26,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 10:14:26,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-12-21 10:14:26,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-12-21 10:14:26,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 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) [2021-12-21 10:14:26,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2021-12-21 10:14:26,667 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 13 [2021-12-21 10:14:26,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:14:26,668 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2021-12-21 10:14:26,668 INFO L471 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) [2021-12-21 10:14:26,668 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2021-12-21 10:14:26,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-21 10:14:26,669 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:14:26,669 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:14:26,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 10:14:26,670 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:14:26,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:14:26,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1238662774, now seen corresponding path program 1 times [2021-12-21 10:14:26,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:14:26,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825066271] [2021-12-21 10:14:26,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:26,671 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:14:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:26,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 10:14:26,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:14:26,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825066271] [2021-12-21 10:14:26,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825066271] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:14:26,730 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:14:26,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:14:26,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335250318] [2021-12-21 10:14:26,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:14:26,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:14:26,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:14:26,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:14:26,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:14:26,732 INFO L87 Difference]: Start difference. First operand 19 states and 23 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) [2021-12-21 10:14:26,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:14:26,785 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2021-12-21 10:14:26,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:14:26,785 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 [2021-12-21 10:14:26,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:14:26,786 INFO L225 Difference]: With dead ends: 39 [2021-12-21 10:14:26,786 INFO L226 Difference]: Without dead ends: 27 [2021-12-21 10:14:26,787 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:14:26,789 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 33 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 10:14:26,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 11 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 10:14:26,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-21 10:14:26,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2021-12-21 10:14:26,799 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) [2021-12-21 10:14:26,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2021-12-21 10:14:26,799 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2021-12-21 10:14:26,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:14:26,800 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2021-12-21 10:14:26,800 INFO L471 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) [2021-12-21 10:14:26,800 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2021-12-21 10:14:26,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-21 10:14:26,801 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:14:26,801 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:14:26,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 10:14:26,801 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:14:26,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:14:26,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1944018757, now seen corresponding path program 1 times [2021-12-21 10:14:26,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:14:26,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547193123] [2021-12-21 10:14:26,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:26,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:14:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:27,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 10:14:27,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:14:27,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547193123] [2021-12-21 10:14:27,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547193123] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:14:27,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616607294] [2021-12-21 10:14:27,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:27,130 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:14:27,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:14:27,132 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) [2021-12-21 10:14:27,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-21 10:14:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:27,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-21 10:14:27,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:14:27,259 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-21 10:14:27,269 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 10:14:27,311 INFO L387 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 14 treesize of output 16 [2021-12-21 10:14:27,392 INFO L387 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 14 treesize of output 16 [2021-12-21 10:14:27,463 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2021-12-21 10:14:27,544 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 23 [2021-12-21 10:14:27,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 10:14:27,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:14:27,664 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_46 (Array Int Int))) (let ((.cse0 (select v_ArrVal_46 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (or (not (= .cse0 2)) (= (+ .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_46) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (* c_~N~0 2))))) is different from false [2021-12-21 10:14:27,764 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 10:14:27,764 INFO L387 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-21 10:14:27,767 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 10:14:27,769 INFO L387 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 26 treesize of output 18 [2021-12-21 10:14:27,773 INFO L387 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 22 treesize of output 10 [2021-12-21 10:14:27,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-21 10:14:27,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616607294] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:14:27,786 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:14:27,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 21 [2021-12-21 10:14:27,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23157286] [2021-12-21 10:14:27,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:14:27,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-21 10:14:27,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:14:27,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-21 10:14:27,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=304, Unknown=2, NotChecked=36, Total=420 [2021-12-21 10:14:27,789 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 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) [2021-12-21 10:14:28,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:14:28,024 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2021-12-21 10:14:28,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 10:14:28,025 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 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 21 [2021-12-21 10:14:28,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:14:28,026 INFO L225 Difference]: With dead ends: 42 [2021-12-21 10:14:28,026 INFO L226 Difference]: Without dead ends: 38 [2021-12-21 10:14:28,027 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=499, Unknown=2, NotChecked=48, Total=702 [2021-12-21 10:14:28,028 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 45 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:14:28,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 72 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 139 Invalid, 0 Unknown, 152 Unchecked, 0.1s Time] [2021-12-21 10:14:28,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-12-21 10:14:28,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2021-12-21 10:14:28,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 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) [2021-12-21 10:14:28,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2021-12-21 10:14:28,033 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 21 [2021-12-21 10:14:28,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:14:28,034 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2021-12-21 10:14:28,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 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) [2021-12-21 10:14:28,034 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2021-12-21 10:14:28,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-21 10:14:28,035 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:14:28,035 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:14:28,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-21 10:14:28,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:14:28,248 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:14:28,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:14:28,249 INFO L85 PathProgramCache]: Analyzing trace with hash 2001277059, now seen corresponding path program 1 times [2021-12-21 10:14:28,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:14:28,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737596288] [2021-12-21 10:14:28,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:28,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:14:28,265 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-21 10:14:28,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [883977241] [2021-12-21 10:14:28,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:28,280 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:14:28,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:14:28,281 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) [2021-12-21 10:14:28,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-21 10:14:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:28,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-21 10:14:28,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:14:28,375 INFO L387 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 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-21 10:14:28,405 INFO L387 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 [2021-12-21 10:14:28,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 10:14:28,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:14:28,458 INFO L387 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 37 treesize of output 31 [2021-12-21 10:14:28,466 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-21 10:14:28,466 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 30 [2021-12-21 10:14:28,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 10:14:28,480 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:14:28,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737596288] [2021-12-21 10:14:28,480 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-21 10:14:28,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883977241] [2021-12-21 10:14:28,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883977241] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:14:28,481 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 10:14:28,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2021-12-21 10:14:28,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343121980] [2021-12-21 10:14:28,482 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 10:14:28,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-21 10:14:28,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:14:28,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-21 10:14:28,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-12-21 10:14:28,484 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 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) [2021-12-21 10:14:28,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:14:28,621 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2021-12-21 10:14:28,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 10:14:28,622 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 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 21 [2021-12-21 10:14:28,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:14:28,623 INFO L225 Difference]: With dead ends: 59 [2021-12-21 10:14:28,624 INFO L226 Difference]: Without dead ends: 52 [2021-12-21 10:14:28,624 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2021-12-21 10:14:28,626 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 31 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:14:28,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 55 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 10:14:28,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-12-21 10:14:28,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 39. [2021-12-21 10:14:28,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:14:28,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2021-12-21 10:14:28,643 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 21 [2021-12-21 10:14:28,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:14:28,644 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2021-12-21 10:14:28,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 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) [2021-12-21 10:14:28,644 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2021-12-21 10:14:28,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-21 10:14:28,645 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:14:28,645 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:14:28,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-21 10:14:28,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-21 10:14:28,861 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:14:28,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:14:28,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1649883961, now seen corresponding path program 1 times [2021-12-21 10:14:28,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:14:28,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461800217] [2021-12-21 10:14:28,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:28,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:14:28,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:29,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 10:14:29,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:14:29,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461800217] [2021-12-21 10:14:29,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461800217] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:14:29,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140445025] [2021-12-21 10:14:29,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:29,185 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:14:29,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:14:29,200 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) [2021-12-21 10:14:29,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-21 10:14:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:29,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-21 10:14:29,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:14:29,298 INFO L387 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 11 treesize of output 7 [2021-12-21 10:14:29,326 INFO L387 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 [2021-12-21 10:14:29,341 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 10:14:29,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:14:29,379 INFO L387 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 14 treesize of output 12 [2021-12-21 10:14:29,380 INFO L387 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 22 treesize of output 20 [2021-12-21 10:14:29,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 10:14:29,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140445025] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:14:29,397 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:14:29,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 17 [2021-12-21 10:14:29,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297150903] [2021-12-21 10:14:29,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:14:29,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-21 10:14:29,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:14:29,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-21 10:14:29,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2021-12-21 10:14:29,399 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 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) [2021-12-21 10:14:29,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:14:29,812 INFO L93 Difference]: Finished difference Result 79 states and 100 transitions. [2021-12-21 10:14:29,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-21 10:14:29,813 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 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) Word has length 21 [2021-12-21 10:14:29,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:14:29,814 INFO L225 Difference]: With dead ends: 79 [2021-12-21 10:14:29,814 INFO L226 Difference]: Without dead ends: 65 [2021-12-21 10:14:29,814 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=262, Invalid=998, Unknown=0, NotChecked=0, Total=1260 [2021-12-21 10:14:29,826 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 72 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:14:29,827 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 72 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 10:14:29,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-12-21 10:14:29,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 49. [2021-12-21 10:14:29,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 48 states have internal predecessors, (62), 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) [2021-12-21 10:14:29,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2021-12-21 10:14:29,832 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 21 [2021-12-21 10:14:29,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:14:29,832 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2021-12-21 10:14:29,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 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) [2021-12-21 10:14:29,832 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2021-12-21 10:14:29,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-21 10:14:29,833 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:14:29,833 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:14:29,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-21 10:14:30,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:14:30,043 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:14:30,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:14:30,044 INFO L85 PathProgramCache]: Analyzing trace with hash -823792505, now seen corresponding path program 2 times [2021-12-21 10:14:30,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:14:30,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037040112] [2021-12-21 10:14:30,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:30,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:14:30,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:30,087 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 10:14:30,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:14:30,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037040112] [2021-12-21 10:14:30,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037040112] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:14:30,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105490071] [2021-12-21 10:14:30,087 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 10:14:30,087 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:14:30,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:14:30,088 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) [2021-12-21 10:14:30,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-21 10:14:30,129 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 10:14:30,129 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:14:30,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 10:14:30,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:14:30,200 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 10:14:30,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:14:30,244 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 10:14:30,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105490071] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:14:30,244 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:14:30,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-21 10:14:30,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107429889] [2021-12-21 10:14:30,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:14:30,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 10:14:30,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:14:30,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 10:14:30,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-21 10:14:30,246 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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) [2021-12-21 10:14:30,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:14:30,358 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2021-12-21 10:14:30,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 10:14:30,359 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-21 10:14:30,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:14:30,361 INFO L225 Difference]: With dead ends: 85 [2021-12-21 10:14:30,361 INFO L226 Difference]: Without dead ends: 75 [2021-12-21 10:14:30,362 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-12-21 10:14:30,363 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 49 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:14:30,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 34 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 10:14:30,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-12-21 10:14:30,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 53. [2021-12-21 10:14:30,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 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) [2021-12-21 10:14:30,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2021-12-21 10:14:30,374 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 23 [2021-12-21 10:14:30,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:14:30,374 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2021-12-21 10:14:30,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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) [2021-12-21 10:14:30,374 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2021-12-21 10:14:30,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-21 10:14:30,374 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:14:30,374 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:14:30,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-21 10:14:30,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:14:30,575 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:14:30,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:14:30,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1832157868, now seen corresponding path program 3 times [2021-12-21 10:14:30,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:14:30,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642245415] [2021-12-21 10:14:30,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:30,576 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:14:30,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:30,642 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 10:14:30,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:14:30,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642245415] [2021-12-21 10:14:30,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642245415] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:14:30,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097238806] [2021-12-21 10:14:30,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-21 10:14:30,643 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:14:30,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:14:30,649 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) [2021-12-21 10:14:30,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-21 10:14:30,693 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-21 10:14:30,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:14:30,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 10:14:30,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:14:30,766 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 10:14:30,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:14:30,798 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 10:14:30,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097238806] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:14:30,799 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:14:30,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-21 10:14:30,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385458343] [2021-12-21 10:14:30,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:14:30,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 10:14:30,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:14:30,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 10:14:30,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-21 10:14:30,799 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 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) [2021-12-21 10:14:30,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:14:30,869 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2021-12-21 10:14:30,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 10:14:30,869 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 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) Word has length 24 [2021-12-21 10:14:30,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:14:30,870 INFO L225 Difference]: With dead ends: 78 [2021-12-21 10:14:30,870 INFO L226 Difference]: Without dead ends: 42 [2021-12-21 10:14:30,870 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-12-21 10:14:30,870 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 35 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:14:30,870 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 26 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 10:14:30,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-12-21 10:14:30,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2021-12-21 10:14:30,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 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) [2021-12-21 10:14:30,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2021-12-21 10:14:30,874 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 24 [2021-12-21 10:14:30,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:14:30,874 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2021-12-21 10:14:30,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 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) [2021-12-21 10:14:30,874 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2021-12-21 10:14:30,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-21 10:14:30,874 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:14:30,874 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:14:30,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-21 10:14:31,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:14:31,075 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:14:31,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:14:31,075 INFO L85 PathProgramCache]: Analyzing trace with hash -14433298, now seen corresponding path program 4 times [2021-12-21 10:14:31,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:14:31,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496713677] [2021-12-21 10:14:31,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:31,075 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:14:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:31,460 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-21 10:14:31,460 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:14:31,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496713677] [2021-12-21 10:14:31,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496713677] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:14:31,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340499470] [2021-12-21 10:14:31,460 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-21 10:14:31,461 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:14:31,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:14:31,461 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) [2021-12-21 10:14:31,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-21 10:14:31,502 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-21 10:14:31,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:14:31,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-21 10:14:31,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:14:31,516 INFO L387 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 11 treesize of output 7 [2021-12-21 10:14:31,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:14:31,538 INFO L387 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 14 treesize of output 16 [2021-12-21 10:14:31,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:14:31,566 INFO L387 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 14 treesize of output 16 [2021-12-21 10:14:31,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:14:31,658 INFO L387 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 14 treesize of output 16 [2021-12-21 10:14:31,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:14:31,685 INFO L387 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 14 treesize of output 16 [2021-12-21 10:14:31,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:14:31,796 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2021-12-21 10:14:31,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:14:31,899 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-21 10:14:31,899 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2021-12-21 10:14:32,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:14:32,019 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-21 10:14:32,020 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 30 [2021-12-21 10:14:32,045 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 10:14:32,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:14:32,310 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_208 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_63| Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_208))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select v_ArrVal_208 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse1 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_63| 4))))) (or (= (* c_~N~0 2) (+ .cse0 .cse1 .cse2)) (not (= 2 .cse2)) (not (= 2 .cse1)))))))) is different from false [2021-12-21 10:14:32,601 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_208 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_69| Int) (|v_ULTIMATE.start_main_~i~0#1_63| Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_208))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse1 (select v_ArrVal_208 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_69| 4))))) (let ((.cse0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_63| 4))))) (or (not (= .cse0 2)) (not (= 2 .cse1)) (and (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) (div (+ .cse0 .cse2 .cse1) 2)) (<= (div (+ (- 1) .cse0 .cse2 .cse1) 2) |c_ULTIMATE.start_main_~i~0#1|)))))))) is different from false [2021-12-21 10:14:32,670 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_208 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_69| Int) (|v_ULTIMATE.start_main_~i~0#1_63| Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_208))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse1 (select v_ArrVal_208 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_69| 4))))) (let ((.cse0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_63| 4))))) (or (not (= .cse0 2)) (not (= 2 .cse1)) (and (<= (div (+ (- 1) .cse0 .cse2 .cse1) 2) (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) (div (+ .cse0 .cse2 .cse1) 2))))))))) is different from false [2021-12-21 10:14:32,774 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 7 not checked. [2021-12-21 10:14:32,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340499470] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:14:32,774 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:14:32,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 13] total 34 [2021-12-21 10:14:32,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322448969] [2021-12-21 10:14:32,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:14:32,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-21 10:14:32,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:14:32,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-21 10:14:32,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=835, Unknown=4, NotChecked=180, Total=1122 [2021-12-21 10:14:32,776 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 34 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 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) [2021-12-21 10:14:33,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:14:33,819 INFO L93 Difference]: Finished difference Result 80 states and 101 transitions. [2021-12-21 10:14:33,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-21 10:14:33,819 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-21 10:14:33,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:14:33,820 INFO L225 Difference]: With dead ends: 80 [2021-12-21 10:14:33,820 INFO L226 Difference]: Without dead ends: 76 [2021-12-21 10:14:33,821 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=353, Invalid=2105, Unknown=4, NotChecked=294, Total=2756 [2021-12-21 10:14:33,821 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 46 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 507 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 10:14:33,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 127 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 360 Invalid, 0 Unknown, 507 Unchecked, 0.2s Time] [2021-12-21 10:14:33,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-21 10:14:33,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2021-12-21 10:14:33,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.28125) internal successors, (82), 64 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:14:33,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 82 transitions. [2021-12-21 10:14:33,827 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 82 transitions. Word has length 29 [2021-12-21 10:14:33,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:14:33,828 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 82 transitions. [2021-12-21 10:14:33,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 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) [2021-12-21 10:14:33,828 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2021-12-21 10:14:33,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-21 10:14:33,829 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:14:33,829 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:14:33,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-21 10:14:34,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:14:34,061 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:14:34,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:14:34,061 INFO L85 PathProgramCache]: Analyzing trace with hash 42825004, now seen corresponding path program 1 times [2021-12-21 10:14:34,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:14:34,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222066468] [2021-12-21 10:14:34,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:34,062 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:14:34,070 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-21 10:14:34,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1567175581] [2021-12-21 10:14:34,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:34,071 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:14:34,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:14:34,074 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) [2021-12-21 10:14:34,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-21 10:14:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:34,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-21 10:14:34,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:14:34,184 INFO L387 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 0 case distinctions, treesize of input 31 treesize of output 15 [2021-12-21 10:14:34,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:14:34,224 INFO L387 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 16 treesize of output 18 [2021-12-21 10:14:34,244 INFO L387 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 [2021-12-21 10:14:34,255 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-21 10:14:34,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:14:34,283 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_253 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_253) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) is different from false [2021-12-21 10:14:34,288 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_253 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_253) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) is different from false [2021-12-21 10:14:34,316 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 10:14:34,316 INFO L387 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 31 [2021-12-21 10:14:34,320 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 10:14:34,321 INFO L387 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 38 [2021-12-21 10:14:34,323 INFO L387 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 11 treesize of output 7 [2021-12-21 10:14:34,380 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 5 not checked. [2021-12-21 10:14:34,381 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:14:34,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222066468] [2021-12-21 10:14:34,381 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-21 10:14:34,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567175581] [2021-12-21 10:14:34,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567175581] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:14:34,381 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 10:14:34,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-12-21 10:14:34,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012800072] [2021-12-21 10:14:34,382 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 10:14:34,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-21 10:14:34,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:14:34,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-21 10:14:34,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=217, Unknown=2, NotChecked=62, Total=342 [2021-12-21 10:14:34,383 INFO L87 Difference]: Start difference. First operand 65 states and 82 transitions. Second operand has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 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) [2021-12-21 10:14:34,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:14:34,561 INFO L93 Difference]: Finished difference Result 113 states and 143 transitions. [2021-12-21 10:14:34,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 10:14:34,561 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-21 10:14:34,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:14:34,562 INFO L225 Difference]: With dead ends: 113 [2021-12-21 10:14:34,562 INFO L226 Difference]: Without dead ends: 106 [2021-12-21 10:14:34,562 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=267, Unknown=2, NotChecked=70, Total=420 [2021-12-21 10:14:34,562 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 77 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 145 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:14:34,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 82 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 253 Invalid, 0 Unknown, 145 Unchecked, 0.1s Time] [2021-12-21 10:14:34,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-21 10:14:34,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 81. [2021-12-21 10:14:34,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.275) internal successors, (102), 80 states have internal predecessors, (102), 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) [2021-12-21 10:14:34,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 102 transitions. [2021-12-21 10:14:34,570 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 102 transitions. Word has length 29 [2021-12-21 10:14:34,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:14:34,570 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 102 transitions. [2021-12-21 10:14:34,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 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) [2021-12-21 10:14:34,571 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 102 transitions. [2021-12-21 10:14:34,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-21 10:14:34,571 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:14:34,571 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:14:34,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-21 10:14:34,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:14:34,788 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:14:34,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:14:34,788 INFO L85 PathProgramCache]: Analyzing trace with hash -968292246, now seen corresponding path program 1 times [2021-12-21 10:14:34,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:14:34,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863698907] [2021-12-21 10:14:34,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:34,789 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:14:34,800 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-21 10:14:34,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [161793594] [2021-12-21 10:14:34,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:34,800 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:14:34,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:14:34,812 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) [2021-12-21 10:14:34,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-21 10:14:34,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:34,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-21 10:14:34,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:14:34,880 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-21 10:14:34,909 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-12-21 10:14:34,909 INFO L387 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 25 treesize of output 24 [2021-12-21 10:14:34,922 INFO L387 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 [2021-12-21 10:14:34,937 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 10:14:34,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:14:34,989 INFO L387 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 16 treesize of output 14 [2021-12-21 10:14:34,990 INFO L387 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 28 treesize of output 24 [2021-12-21 10:14:35,001 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 10:14:35,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:14:35,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863698907] [2021-12-21 10:14:35,002 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-21 10:14:35,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161793594] [2021-12-21 10:14:35,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161793594] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:14:35,002 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 10:14:35,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-12-21 10:14:35,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757470221] [2021-12-21 10:14:35,002 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 10:14:35,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 10:14:35,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:14:35,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 10:14:35,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-21 10:14:35,003 INFO L87 Difference]: Start difference. First operand 81 states and 102 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 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) [2021-12-21 10:14:35,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:14:35,128 INFO L93 Difference]: Finished difference Result 123 states and 158 transitions. [2021-12-21 10:14:35,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 10:14:35,129 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 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 29 [2021-12-21 10:14:35,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:14:35,129 INFO L225 Difference]: With dead ends: 123 [2021-12-21 10:14:35,129 INFO L226 Difference]: Without dead ends: 92 [2021-12-21 10:14:35,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-12-21 10:14:35,131 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:14:35,132 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 57 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 10:14:35,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-21 10:14:35,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 81. [2021-12-21 10:14:35,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.25) internal successors, (100), 80 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) [2021-12-21 10:14:35,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 100 transitions. [2021-12-21 10:14:35,162 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 100 transitions. Word has length 29 [2021-12-21 10:14:35,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:14:35,162 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 100 transitions. [2021-12-21 10:14:35,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 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) [2021-12-21 10:14:35,162 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2021-12-21 10:14:35,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-21 10:14:35,163 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:14:35,163 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:14:35,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-21 10:14:35,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-21 10:14:35,387 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:14:35,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:14:35,387 INFO L85 PathProgramCache]: Analyzing trace with hash -554569936, now seen corresponding path program 5 times [2021-12-21 10:14:35,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:14:35,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694476974] [2021-12-21 10:14:35,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:35,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:14:35,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:35,440 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 10:14:35,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:14:35,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694476974] [2021-12-21 10:14:35,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694476974] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:14:35,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261748908] [2021-12-21 10:14:35,441 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-21 10:14:35,441 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:14:35,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:14:35,442 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) [2021-12-21 10:14:35,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-21 10:14:35,543 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-12-21 10:14:35,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:14:35,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-21 10:14:35,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:14:35,621 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 10:14:35,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:14:35,686 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 10:14:35,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261748908] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:14:35,686 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:14:35,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-21 10:14:35,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786508443] [2021-12-21 10:14:35,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:14:35,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-21 10:14:35,687 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:14:35,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-21 10:14:35,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-21 10:14:35,687 INFO L87 Difference]: Start difference. First operand 81 states and 100 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 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) [2021-12-21 10:14:35,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:14:35,871 INFO L93 Difference]: Finished difference Result 115 states and 145 transitions. [2021-12-21 10:14:35,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-21 10:14:35,872 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 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 [2021-12-21 10:14:35,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:14:35,872 INFO L225 Difference]: With dead ends: 115 [2021-12-21 10:14:35,872 INFO L226 Difference]: Without dead ends: 102 [2021-12-21 10:14:35,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2021-12-21 10:14:35,873 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 75 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:14:35,873 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 30 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 10:14:35,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-12-21 10:14:35,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 80. [2021-12-21 10:14:35,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 79 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) [2021-12-21 10:14:35,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 100 transitions. [2021-12-21 10:14:35,879 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 100 transitions. Word has length 31 [2021-12-21 10:14:35,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:14:35,879 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 100 transitions. [2021-12-21 10:14:35,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 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) [2021-12-21 10:14:35,879 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions. [2021-12-21 10:14:35,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-21 10:14:35,880 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:14:35,880 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:14:35,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-21 10:14:36,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:14:36,092 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:14:36,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:14:36,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1053387787, now seen corresponding path program 6 times [2021-12-21 10:14:36,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:14:36,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57657913] [2021-12-21 10:14:36,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:36,092 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:14:36,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:36,139 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 10:14:36,139 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:14:36,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57657913] [2021-12-21 10:14:36,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57657913] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:14:36,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693985872] [2021-12-21 10:14:36,139 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-21 10:14:36,139 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:14:36,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:14:36,156 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) [2021-12-21 10:14:36,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-21 10:14:36,228 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-12-21 10:14:36,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:14:36,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-21 10:14:36,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:14:36,317 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 10:14:36,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:14:36,372 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 10:14:36,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693985872] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:14:36,372 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:14:36,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-21 10:14:36,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869801160] [2021-12-21 10:14:36,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:14:36,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-21 10:14:36,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:14:36,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-21 10:14:36,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-21 10:14:36,373 INFO L87 Difference]: Start difference. First operand 80 states and 100 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 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) [2021-12-21 10:14:36,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:14:36,472 INFO L93 Difference]: Finished difference Result 103 states and 127 transitions. [2021-12-21 10:14:36,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 10:14:36,473 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-21 10:14:36,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:14:36,473 INFO L225 Difference]: With dead ends: 103 [2021-12-21 10:14:36,473 INFO L226 Difference]: Without dead ends: 50 [2021-12-21 10:14:36,474 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-12-21 10:14:36,474 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 80 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:14:36,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 22 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 10:14:36,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-12-21 10:14:36,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2021-12-21 10:14:36,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 states have internal predecessors, (52), 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) [2021-12-21 10:14:36,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2021-12-21 10:14:36,478 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 32 [2021-12-21 10:14:36,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:14:36,478 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2021-12-21 10:14:36,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 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) [2021-12-21 10:14:36,478 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2021-12-21 10:14:36,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-21 10:14:36,479 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:14:36,479 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:14:36,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-21 10:14:36,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-21 10:14:36,687 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:14:36,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:14:36,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1383779305, now seen corresponding path program 7 times [2021-12-21 10:14:36,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:14:36,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649892672] [2021-12-21 10:14:36,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:36,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:14:36,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:37,040 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-21 10:14:37,040 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:14:37,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649892672] [2021-12-21 10:14:37,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649892672] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:14:37,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914606427] [2021-12-21 10:14:37,041 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-21 10:14:37,041 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:14:37,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:14:37,049 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:14:37,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-21 10:14:37,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:37,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 52 conjunts are in the unsatisfiable core [2021-12-21 10:14:37,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:14:37,121 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-21 10:14:37,125 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 10:14:37,137 INFO L387 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 14 treesize of output 16 [2021-12-21 10:14:37,157 INFO L387 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 14 treesize of output 16 [2021-12-21 10:14:37,189 INFO L387 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 14 treesize of output 16 [2021-12-21 10:14:37,267 INFO L387 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 14 treesize of output 16 [2021-12-21 10:14:37,292 INFO L387 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 14 treesize of output 16 [2021-12-21 10:14:37,319 INFO L387 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 14 treesize of output 16 [2021-12-21 10:14:37,383 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2021-12-21 10:14:37,468 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-21 10:14:37,468 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 41 [2021-12-21 10:14:37,569 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-21 10:14:37,569 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2021-12-21 10:14:37,706 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-21 10:14:37,706 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 32 [2021-12-21 10:14:37,735 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-21 10:14:37,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:14:43,016 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_438 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_130| Int) (|v_ULTIMATE.start_main_~i~0#1_128| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_130| 4))))) (let ((.cse0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_128| 4))))) (or (not (= 2 .cse0)) (not (= .cse1 2)) (= (* c_~N~0 2) (+ .cse1 .cse2 .cse3 .cse0)) (not (= .cse2 2))))))))) is different from false [2021-12-21 10:14:43,892 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((v_ArrVal_438 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_137| Int) (|v_ULTIMATE.start_main_~i~0#1_130| Int) (|v_ULTIMATE.start_main_~i~0#1_128| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse1 (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_137| 4))))) (let ((.cse0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_130| 4))))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_128| 4))))) (or (not (= .cse0 2)) (not (= 2 .cse1)) (not (= .cse2 2)) (= (* 2 ~N~0) (+ .cse0 .cse2 .cse3 .cse1))))))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) is different from false [2021-12-21 10:14:44,022 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_438 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_137| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_130| Int) (|v_ULTIMATE.start_main_~i~0#1_128| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse1 (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_137| 4))))) (let ((.cse0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_130| 4))))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_128| 4))))) (or (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (= .cse0 2)) (not (= 2 .cse1)) (not (= .cse2 2)) (= (* 2 ~N~0) (+ .cse0 .cse2 .cse3 .cse1))))))))) is different from false [2021-12-21 10:14:44,394 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_438 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_137| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_130| Int) (|v_ULTIMATE.start_main_~i~0#1_128| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse1 (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_137| 4))))) (let ((.cse0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_130| 4))))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_128| 4))))) (or (not (= .cse0 2)) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (= 2 .cse1)) (not (= .cse2 2)) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (= (* 2 ~N~0) (+ .cse0 .cse2 .cse3 .cse1))))))))) is different from false [2021-12-21 10:14:44,555 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 14 not checked. [2021-12-21 10:14:44,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914606427] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:14:44,556 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:14:44,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 16] total 39 [2021-12-21 10:14:44,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519260697] [2021-12-21 10:14:44,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:14:44,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-12-21 10:14:44,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:14:44,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-12-21 10:14:44,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1068, Unknown=8, NotChecked=276, Total=1482 [2021-12-21 10:14:44,558 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 39 states, 39 states have (on average 1.8974358974358974) internal successors, (74), 39 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:14:45,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:14:45,489 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2021-12-21 10:14:45,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-21 10:14:45,490 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.8974358974358974) internal successors, (74), 39 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-21 10:14:45,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:14:45,491 INFO L225 Difference]: With dead ends: 94 [2021-12-21 10:14:45,491 INFO L226 Difference]: Without dead ends: 90 [2021-12-21 10:14:45,507 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 58 SyntacticMatches, 12 SemanticMatches, 49 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=270, Invalid=1900, Unknown=8, NotChecked=372, Total=2550 [2021-12-21 10:14:45,510 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 42 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 604 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 10:14:45,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 139 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 367 Invalid, 0 Unknown, 604 Unchecked, 0.2s Time] [2021-12-21 10:14:45,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-12-21 10:14:45,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2021-12-21 10:14:45,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.2619047619047619) internal successors, (106), 84 states have internal predecessors, (106), 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) [2021-12-21 10:14:45,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 106 transitions. [2021-12-21 10:14:45,523 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 106 transitions. Word has length 37 [2021-12-21 10:14:45,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:14:45,523 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 106 transitions. [2021-12-21 10:14:45,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.8974358974358974) internal successors, (74), 39 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:14:45,524 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 106 transitions. [2021-12-21 10:14:45,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-21 10:14:45,524 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:14:45,524 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:14:45,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-21 10:14:45,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-21 10:14:45,741 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:14:45,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:14:45,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1441037607, now seen corresponding path program 2 times [2021-12-21 10:14:45,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:14:45,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420019808] [2021-12-21 10:14:45,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:45,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:14:45,751 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-21 10:14:45,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [934103206] [2021-12-21 10:14:45,751 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 10:14:45,752 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:14:45,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:14:45,753 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:14:45,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-21 10:14:45,810 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 10:14:45,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:14:45,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-21 10:14:45,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:14:45,971 INFO L387 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 0 case distinctions, treesize of input 31 treesize of output 15 [2021-12-21 10:14:46,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:14:46,031 INFO L387 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 16 treesize of output 18 [2021-12-21 10:14:46,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:14:46,076 INFO L387 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 16 treesize of output 18 [2021-12-21 10:14:46,117 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 10:14:46,117 INFO L387 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 21 treesize of output 21 [2021-12-21 10:14:46,180 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 10:14:46,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:14:46,295 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_149| Int) (v_ArrVal_498 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~i~0#1_149| (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_498) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_149| 4)))) (< (+ |v_ULTIMATE.start_main_~i~0#1_149| 1) c_~N~0))) is different from false [2021-12-21 10:14:46,318 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_149| Int) (v_ArrVal_498 (Array Int Int))) (or (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_149|) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_498) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_149| 4)))) (< (+ |v_ULTIMATE.start_main_~i~0#1_149| 1) c_~N~0))) is different from false [2021-12-21 10:14:46,467 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 10:14:46,468 INFO L387 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 33 [2021-12-21 10:14:46,477 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 10:14:46,477 INFO L387 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 44 treesize of output 44 [2021-12-21 10:14:46,481 INFO L387 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 13 treesize of output 7 [2021-12-21 10:14:46,803 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2021-12-21 10:14:46,803 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:14:46,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420019808] [2021-12-21 10:14:46,803 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-21 10:14:46,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934103206] [2021-12-21 10:14:46,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934103206] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:14:46,803 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 10:14:46,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2021-12-21 10:14:46,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641849260] [2021-12-21 10:14:46,804 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 10:14:46,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-21 10:14:46,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:14:46,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-21 10:14:46,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=798, Unknown=10, NotChecked=122, Total=1122 [2021-12-21 10:14:46,804 INFO L87 Difference]: Start difference. First operand 85 states and 106 transitions. Second operand has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:14:47,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:14:47,137 INFO L93 Difference]: Finished difference Result 118 states and 148 transitions. [2021-12-21 10:14:47,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-21 10:14:47,138 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-21 10:14:47,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:14:47,139 INFO L225 Difference]: With dead ends: 118 [2021-12-21 10:14:47,139 INFO L226 Difference]: Without dead ends: 111 [2021-12-21 10:14:47,139 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=317, Invalid=1163, Unknown=10, NotChecked=150, Total=1640 [2021-12-21 10:14:47,140 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 93 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:14:47,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 62 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 147 Invalid, 0 Unknown, 153 Unchecked, 0.1s Time] [2021-12-21 10:14:47,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-21 10:14:47,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2021-12-21 10:14:47,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.2592592592592593) internal successors, (136), 108 states have internal predecessors, (136), 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) [2021-12-21 10:14:47,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 136 transitions. [2021-12-21 10:14:47,151 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 136 transitions. Word has length 37 [2021-12-21 10:14:47,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:14:47,152 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 136 transitions. [2021-12-21 10:14:47,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:14:47,152 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 136 transitions. [2021-12-21 10:14:47,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-21 10:14:47,153 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:14:47,153 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:14:47,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-21 10:14:47,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-21 10:14:47,364 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:14:47,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:14:47,364 INFO L85 PathProgramCache]: Analyzing trace with hash 2063837675, now seen corresponding path program 3 times [2021-12-21 10:14:47,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:14:47,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323826082] [2021-12-21 10:14:47,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:47,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:14:47,372 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-21 10:14:47,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1867270346] [2021-12-21 10:14:47,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-21 10:14:47,375 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:14:47,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:14:47,376 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:14:47,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-21 10:14:47,439 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-21 10:14:47,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:14:47,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-21 10:14:47,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:14:47,483 INFO L387 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 0 case distinctions, treesize of input 37 treesize of output 17 [2021-12-21 10:14:47,532 INFO L353 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2021-12-21 10:14:47,533 INFO L387 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 30 treesize of output 29 [2021-12-21 10:14:47,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:14:47,668 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2021-12-21 10:14:47,710 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 10:14:47,711 INFO L387 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 26 treesize of output 26 [2021-12-21 10:14:47,786 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-21 10:14:47,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:14:47,881 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_553 (Array Int Int))) (let ((.cse0 (+ 2 |ULTIMATE.start_main_~i~0#1|))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 2) (< .cse0 c_~N~0) (< c_~N~0 .cse0)))) is different from false [2021-12-21 10:14:48,022 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_169| Int) (v_ArrVal_551 Int) (v_ArrVal_553 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_169| 1)) (<= (+ 2 |v_ULTIMATE.start_main_~i~0#1_169|) |c_ULTIMATE.start_main_~i~0#1|) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_551)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_169| 4))) 2))) is different from false [2021-12-21 10:14:48,037 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_169| Int) (v_ArrVal_551 Int) (v_ArrVal_553 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_169| 1) |c_ULTIMATE.start_main_~i~0#1|) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_169|) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_551)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_169| 4))) 2))) is different from false [2021-12-21 10:14:48,128 INFO L353 Elim1Store]: treesize reduction 39, result has 41.8 percent of original size [2021-12-21 10:14:48,128 INFO L387 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 46 [2021-12-21 10:14:48,135 INFO L353 Elim1Store]: treesize reduction 12, result has 25.0 percent of original size [2021-12-21 10:14:48,135 INFO L387 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 42 treesize of output 30 [2021-12-21 10:14:48,181 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 10 not checked. [2021-12-21 10:14:48,181 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:14:48,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323826082] [2021-12-21 10:14:48,181 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-21 10:14:48,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867270346] [2021-12-21 10:14:48,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867270346] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:14:48,182 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 10:14:48,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 24 [2021-12-21 10:14:48,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175790888] [2021-12-21 10:14:48,182 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 10:14:48,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-21 10:14:48,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:14:48,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-21 10:14:48,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=338, Unknown=11, NotChecked=120, Total=552 [2021-12-21 10:14:48,184 INFO L87 Difference]: Start difference. First operand 109 states and 136 transitions. Second operand has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:14:48,840 WARN L838 $PredicateComparison]: unable to prove that (and (= (+ (- 1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) 1) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((|v_ULTIMATE.start_main_~i~0#1_169| Int) (v_ArrVal_551 Int) (v_ArrVal_553 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_169| 1) |c_ULTIMATE.start_main_~i~0#1|) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_169|) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_551)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_169| 4))) 2)))) is different from false [2021-12-21 10:14:50,849 WARN L838 $PredicateComparison]: unable to prove that (and (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (+ (- 1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) 1) (forall ((|v_ULTIMATE.start_main_~i~0#1_169| Int) (v_ArrVal_551 Int) (v_ArrVal_553 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_169| 1)) (<= (+ 2 |v_ULTIMATE.start_main_~i~0#1_169|) |c_ULTIMATE.start_main_~i~0#1|) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_551)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_169| 4))) 2)))) is different from false [2021-12-21 10:14:51,481 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (= (+ (- 1) (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) 1) (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((|v_ULTIMATE.start_main_~i~0#1_169| Int) (v_ArrVal_551 Int) (v_ArrVal_553 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_169| 1) |c_ULTIMATE.start_main_~i~0#1|) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_169|) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_551)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_169| 4))) 2))) (= (+ (- 1) (select .cse0 (+ .cse1 (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) 1))) is different from false [2021-12-21 10:14:52,072 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~i~0#1_161| Int)) (and (= (+ (- 1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_161| 4) (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) 1) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_161| 1)) (< |v_ULTIMATE.start_main_~i~0#1_161| c_~N~0))) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (+ (- 1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) 1) (forall ((|v_ULTIMATE.start_main_~i~0#1_169| Int) (v_ArrVal_551 Int) (v_ArrVal_553 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_169| 1)) (<= (+ 2 |v_ULTIMATE.start_main_~i~0#1_169|) |c_ULTIMATE.start_main_~i~0#1|) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_551)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_169| 4))) 2)))) is different from false [2021-12-21 10:14:52,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:14:52,232 INFO L93 Difference]: Finished difference Result 167 states and 214 transitions. [2021-12-21 10:14:52,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-21 10:14:52,232 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-21 10:14:52,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:14:52,233 INFO L225 Difference]: With dead ends: 167 [2021-12-21 10:14:52,233 INFO L226 Difference]: Without dead ends: 163 [2021-12-21 10:14:52,233 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=137, Invalid=526, Unknown=15, NotChecked=378, Total=1056 [2021-12-21 10:14:52,234 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 29 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 271 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:14:52,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 55 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 93 Invalid, 0 Unknown, 271 Unchecked, 0.1s Time] [2021-12-21 10:14:52,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-12-21 10:14:52,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 137. [2021-12-21 10:14:52,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.3088235294117647) internal successors, (178), 136 states have internal predecessors, (178), 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) [2021-12-21 10:14:52,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 178 transitions. [2021-12-21 10:14:52,248 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 178 transitions. Word has length 37 [2021-12-21 10:14:52,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:14:52,249 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 178 transitions. [2021-12-21 10:14:52,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:14:52,249 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 178 transitions. [2021-12-21 10:14:52,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-21 10:14:52,250 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:14:52,250 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:14:52,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-21 10:14:52,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-21 10:14:52,451 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:14:52,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:14:52,452 INFO L85 PathProgramCache]: Analyzing trace with hash -147310295, now seen corresponding path program 2 times [2021-12-21 10:14:52,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:14:52,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759021597] [2021-12-21 10:14:52,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:52,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:14:52,461 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-21 10:14:52,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1877115992] [2021-12-21 10:14:52,462 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 10:14:52,462 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:14:52,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:14:52,463 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:14:52,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-21 10:14:52,525 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 10:14:52,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:14:52,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-21 10:14:52,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:14:52,565 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-21 10:14:52,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:14:52,600 INFO L387 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 25 treesize of output 24 [2021-12-21 10:14:52,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:14:52,625 INFO L387 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 25 treesize of output 24 [2021-12-21 10:14:52,643 INFO L387 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 [2021-12-21 10:14:52,666 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-21 10:14:52,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:14:52,783 INFO L387 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 16 treesize of output 14 [2021-12-21 10:14:52,784 INFO L387 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 28 treesize of output 24 [2021-12-21 10:14:52,817 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-21 10:14:52,817 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:14:52,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759021597] [2021-12-21 10:14:52,817 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-21 10:14:52,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877115992] [2021-12-21 10:14:52,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877115992] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:14:52,817 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 10:14:52,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-12-21 10:14:52,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894850203] [2021-12-21 10:14:52,818 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 10:14:52,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-21 10:14:52,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:14:52,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-21 10:14:52,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2021-12-21 10:14:52,819 INFO L87 Difference]: Start difference. First operand 137 states and 178 transitions. Second operand has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:14:53,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:14:53,056 INFO L93 Difference]: Finished difference Result 219 states and 293 transitions. [2021-12-21 10:14:53,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-21 10:14:53,057 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-21 10:14:53,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:14:53,057 INFO L225 Difference]: With dead ends: 219 [2021-12-21 10:14:53,057 INFO L226 Difference]: Without dead ends: 148 [2021-12-21 10:14:53,058 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2021-12-21 10:14:53,058 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 19 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 10:14:53,058 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 84 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 10:14:53,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-12-21 10:14:53,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 137. [2021-12-21 10:14:53,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.2941176470588236) internal successors, (176), 136 states have internal predecessors, (176), 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) [2021-12-21 10:14:53,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 176 transitions. [2021-12-21 10:14:53,083 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 176 transitions. Word has length 37 [2021-12-21 10:14:53,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:14:53,083 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 176 transitions. [2021-12-21 10:14:53,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:14:53,084 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 176 transitions. [2021-12-21 10:14:53,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-21 10:14:53,084 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:14:53,085 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:14:53,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-21 10:14:53,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:14:53,299 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:14:53,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:14:53,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1016239403, now seen corresponding path program 8 times [2021-12-21 10:14:53,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:14:53,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696407358] [2021-12-21 10:14:53,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:53,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:14:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:53,439 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-21 10:14:53,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:14:53,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696407358] [2021-12-21 10:14:53,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696407358] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:14:53,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852024182] [2021-12-21 10:14:53,440 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 10:14:53,440 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:14:53,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:14:53,441 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:14:53,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-21 10:14:53,512 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 10:14:53,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:14:53,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-21 10:14:53,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:14:53,669 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-21 10:14:53,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:14:53,750 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-21 10:14:53,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852024182] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:14:53,750 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:14:53,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2021-12-21 10:14:53,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229426508] [2021-12-21 10:14:53,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:14:53,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-21 10:14:53,750 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:14:53,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-21 10:14:53,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-12-21 10:14:53,751 INFO L87 Difference]: Start difference. First operand 137 states and 176 transitions. Second operand has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:14:54,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:14:54,115 INFO L93 Difference]: Finished difference Result 172 states and 221 transitions. [2021-12-21 10:14:54,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-21 10:14:54,116 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-12-21 10:14:54,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:14:54,117 INFO L225 Difference]: With dead ends: 172 [2021-12-21 10:14:54,117 INFO L226 Difference]: Without dead ends: 151 [2021-12-21 10:14:54,117 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2021-12-21 10:14:54,118 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 106 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 10:14:54,118 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 38 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 10:14:54,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-12-21 10:14:54,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 98. [2021-12-21 10:14:54,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.2474226804123711) internal successors, (121), 97 states have internal predecessors, (121), 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) [2021-12-21 10:14:54,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 121 transitions. [2021-12-21 10:14:54,135 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 121 transitions. Word has length 39 [2021-12-21 10:14:54,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:14:54,135 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 121 transitions. [2021-12-21 10:14:54,136 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:14:54,136 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 121 transitions. [2021-12-21 10:14:54,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-21 10:14:54,136 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:14:54,136 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:14:54,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-21 10:14:54,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-21 10:14:54,359 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:14:54,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:14:54,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1682760144, now seen corresponding path program 9 times [2021-12-21 10:14:54,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:14:54,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528517031] [2021-12-21 10:14:54,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:54,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:14:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:54,437 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-21 10:14:54,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:14:54,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528517031] [2021-12-21 10:14:54,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528517031] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:14:54,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403230786] [2021-12-21 10:14:54,438 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-21 10:14:54,438 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:14:54,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:14:54,444 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:14:54,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-21 10:14:54,533 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-21 10:14:54,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:14:54,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-21 10:14:54,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:14:54,656 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-21 10:14:54,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:14:54,736 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-21 10:14:54,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403230786] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:14:54,736 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:14:54,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2021-12-21 10:14:54,737 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762684376] [2021-12-21 10:14:54,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:14:54,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-21 10:14:54,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:14:54,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-21 10:14:54,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-12-21 10:14:54,737 INFO L87 Difference]: Start difference. First operand 98 states and 121 transitions. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 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) [2021-12-21 10:14:54,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:14:54,903 INFO L93 Difference]: Finished difference Result 124 states and 152 transitions. [2021-12-21 10:14:54,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 10:14:54,903 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 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 [2021-12-21 10:14:54,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:14:54,904 INFO L225 Difference]: With dead ends: 124 [2021-12-21 10:14:54,904 INFO L226 Difference]: Without dead ends: 58 [2021-12-21 10:14:54,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2021-12-21 10:14:54,905 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 93 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:14:54,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 37 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 10:14:54,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-12-21 10:14:54,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2021-12-21 10:14:54,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.196078431372549) internal successors, (61), 51 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:14:54,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2021-12-21 10:14:54,910 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 40 [2021-12-21 10:14:54,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:14:54,910 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2021-12-21 10:14:54,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 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) [2021-12-21 10:14:54,910 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2021-12-21 10:14:54,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-21 10:14:54,911 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:14:54,911 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:14:54,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-12-21 10:14:55,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-21 10:14:55,119 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:14:55,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:14:55,120 INFO L85 PathProgramCache]: Analyzing trace with hash -2111860654, now seen corresponding path program 10 times [2021-12-21 10:14:55,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:14:55,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016217869] [2021-12-21 10:14:55,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:55,120 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:14:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:55,871 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-21 10:14:55,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:14:55,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016217869] [2021-12-21 10:14:55,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016217869] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:14:55,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804859669] [2021-12-21 10:14:55,872 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-21 10:14:55,872 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:14:55,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:14:55,873 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:14:55,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-21 10:14:55,963 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-21 10:14:55,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:14:55,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-21 10:14:55,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:14:55,974 INFO L387 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 11 treesize of output 7 [2021-12-21 10:14:55,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:14:55,998 INFO L387 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 14 treesize of output 16 [2021-12-21 10:14:56,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:14:56,030 INFO L387 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 14 treesize of output 16 [2021-12-21 10:14:56,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:14:56,060 INFO L387 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 14 treesize of output 16 [2021-12-21 10:14:56,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:14:56,090 INFO L387 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 14 treesize of output 16 [2021-12-21 10:14:56,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:14:56,215 INFO L387 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 14 treesize of output 16 [2021-12-21 10:14:56,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:14:56,242 INFO L387 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 14 treesize of output 16 [2021-12-21 10:14:56,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:14:56,269 INFO L387 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 14 treesize of output 16 [2021-12-21 10:14:56,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:14:56,302 INFO L387 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 14 treesize of output 16 [2021-12-21 10:14:56,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:14:56,390 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2021-12-21 10:14:56,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:14:56,515 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-21 10:14:56,515 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 45 [2021-12-21 10:14:56,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:14:56,692 INFO L353 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-12-21 10:14:56,692 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 62 [2021-12-21 10:14:56,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:14:56,840 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-21 10:14:56,841 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2021-12-21 10:14:57,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:14:57,016 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-21 10:14:57,016 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 34 [2021-12-21 10:14:57,050 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-21 10:14:57,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:15:06,276 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_789 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|v_ULTIMATE.start_main_~i~0#1_243| Int) (|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_243| 4))))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_241| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_239| 4))))) (or (= (* c_~N~0 2) (+ .cse0 .cse1 .cse2 .cse3 .cse4)) (not (= 2 .cse4)) (not (= 2 .cse2)) (not (= 2 .cse1)) (not (= .cse0 2)))))))))) is different from false [2021-12-21 10:15:11,450 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_789 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|v_ULTIMATE.start_main_~i~0#1_243| Int) (|v_ULTIMATE.start_main_~i~0#1_251| Int) (|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_251| 4)))) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_243| 4))))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_241| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse0 .cse2 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_239| 4))))) (or (not (= .cse0 2)) (not (= .cse1 2)) (not (= 2 .cse2)) (= (+ .cse1 .cse3 .cse0 .cse2 .cse4) (* 2 ~N~0)) (not (= .cse3 2)))))))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) is different from false [2021-12-21 10:15:11,934 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_789 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_243| Int) (|v_ULTIMATE.start_main_~i~0#1_251| Int) (|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_251| 4)))) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_243| 4))))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_241| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse0 .cse2 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_239| 4))))) (or (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (= .cse0 2)) (not (= .cse1 2)) (not (= 2 .cse2)) (= (+ .cse1 .cse3 .cse0 .cse2 .cse4) (* 2 ~N~0)) (not (= .cse3 2)))))))))) is different from false [2021-12-21 10:15:12,813 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_789 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_243| Int) (|v_ULTIMATE.start_main_~i~0#1_251| Int) (|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_251| 4)))) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_243| 4))))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_241| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse0 .cse2 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_239| 4))))) (or (not (= .cse0 2)) (not (= .cse1 2)) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (= 2 .cse2)) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (= (+ .cse1 .cse3 .cse0 .cse2 .cse4) (* 2 ~N~0)) (not (= .cse3 2)))))))))) is different from false [2021-12-21 10:15:13,811 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_789 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_243| Int) (|v_ULTIMATE.start_main_~i~0#1_251| Int) (|v_ULTIMATE.start_main_~i~0#1_239| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_251| 4)))) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_243| 4))))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_241| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse0 .cse2 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_239| 4))))) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (not (= .cse0 2)) (not (= .cse1 2)) (not (= 2 .cse2)) (not (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (= (+ .cse1 .cse3 .cse0 .cse2 .cse4) (* 2 ~N~0)) (not (= .cse3 2)))))))))) is different from false [2021-12-21 10:15:14,447 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 23 not checked. [2021-12-21 10:15:14,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804859669] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:15:14,447 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:15:14,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18, 19] total 55 [2021-12-21 10:15:14,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240790522] [2021-12-21 10:15:14,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:15:14,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2021-12-21 10:15:14,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:15:14,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-12-21 10:15:14,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2253, Unknown=10, NotChecked=500, Total=2970 [2021-12-21 10:15:14,451 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 55 states, 55 states have (on average 1.8363636363636364) internal successors, (101), 55 states have internal predecessors, (101), 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) [2021-12-21 10:15:17,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:15:17,168 INFO L93 Difference]: Finished difference Result 128 states and 161 transitions. [2021-12-21 10:15:17,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-12-21 10:15:17,169 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.8363636363636364) internal successors, (101), 55 states have internal predecessors, (101), 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 45 [2021-12-21 10:15:17,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:15:17,169 INFO L225 Difference]: With dead ends: 128 [2021-12-21 10:15:17,169 INFO L226 Difference]: Without dead ends: 124 [2021-12-21 10:15:17,170 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 67 SyntacticMatches, 10 SemanticMatches, 74 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1534 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=566, Invalid=4414, Unknown=10, NotChecked=710, Total=5700 [2021-12-21 10:15:17,171 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 113 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 692 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-21 10:15:17,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 171 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 757 Invalid, 0 Unknown, 692 Unchecked, 0.5s Time] [2021-12-21 10:15:17,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-12-21 10:15:17,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 112. [2021-12-21 10:15:17,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.2612612612612613) internal successors, (140), 111 states have internal predecessors, (140), 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) [2021-12-21 10:15:17,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 140 transitions. [2021-12-21 10:15:17,189 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 140 transitions. Word has length 45 [2021-12-21 10:15:17,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:15:17,189 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 140 transitions. [2021-12-21 10:15:17,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 1.8363636363636364) internal successors, (101), 55 states have internal predecessors, (101), 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) [2021-12-21 10:15:17,189 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 140 transitions. [2021-12-21 10:15:17,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-21 10:15:17,193 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:15:17,193 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:15:17,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-12-21 10:15:17,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:17,410 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:15:17,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:15:17,411 INFO L85 PathProgramCache]: Analyzing trace with hash -2054602352, now seen corresponding path program 4 times [2021-12-21 10:15:17,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:15:17,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747331476] [2021-12-21 10:15:17,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:17,411 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:15:17,438 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-21 10:15:17,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1804110615] [2021-12-21 10:15:17,438 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-21 10:15:17,444 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:17,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:15:17,446 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:15:17,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-21 10:15:17,525 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-21 10:15:17,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:15:17,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-21 10:15:17,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:15:17,659 INFO L387 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 0 case distinctions, treesize of input 31 treesize of output 15 [2021-12-21 10:15:17,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:17,711 INFO L387 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 18 treesize of output 20 [2021-12-21 10:15:17,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:17,748 INFO L387 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 18 treesize of output 20 [2021-12-21 10:15:17,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:17,789 INFO L387 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 18 treesize of output 20 [2021-12-21 10:15:17,810 INFO L387 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 21 treesize of output 9 [2021-12-21 10:15:17,821 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 37 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-21 10:15:17,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:15:17,853 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_864 (Array Int Int))) (= (+ (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_864) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4))) 1)) is different from false [2021-12-21 10:15:17,857 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_864 (Array Int Int))) (= (+ (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_864) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) 1)) is different from false [2021-12-21 10:15:17,864 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_864 (Array Int Int))) (= (+ (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_864) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) 1)) is different from false [2021-12-21 10:15:17,870 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_864 (Array Int Int))) (= (+ (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_864) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) 1)) is different from false [2021-12-21 10:15:17,897 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 10:15:17,897 INFO L387 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 33 [2021-12-21 10:15:17,901 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 10:15:17,901 INFO L387 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 42 treesize of output 42 [2021-12-21 10:15:17,903 INFO L387 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 13 treesize of output 9 [2021-12-21 10:15:18,011 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 22 not checked. [2021-12-21 10:15:18,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:15:18,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747331476] [2021-12-21 10:15:18,011 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-21 10:15:18,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804110615] [2021-12-21 10:15:18,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804110615] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:15:18,011 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 10:15:18,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2021-12-21 10:15:18,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551526343] [2021-12-21 10:15:18,012 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 10:15:18,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-21 10:15:18,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:15:18,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-21 10:15:18,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=421, Unknown=4, NotChecked=180, Total=702 [2021-12-21 10:15:18,012 INFO L87 Difference]: Start difference. First operand 112 states and 140 transitions. Second operand has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 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) [2021-12-21 10:15:18,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:15:18,414 INFO L93 Difference]: Finished difference Result 167 states and 209 transitions. [2021-12-21 10:15:18,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-21 10:15:18,415 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 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 45 [2021-12-21 10:15:18,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:15:18,415 INFO L225 Difference]: With dead ends: 167 [2021-12-21 10:15:18,415 INFO L226 Difference]: Without dead ends: 160 [2021-12-21 10:15:18,416 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 62 SyntacticMatches, 9 SemanticMatches, 28 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=533, Unknown=4, NotChecked=204, Total=870 [2021-12-21 10:15:18,416 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 40 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 237 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 10:15:18,416 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 102 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 510 Invalid, 0 Unknown, 237 Unchecked, 0.2s Time] [2021-12-21 10:15:18,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-12-21 10:15:18,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 142. [2021-12-21 10:15:18,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.2624113475177305) internal successors, (178), 141 states have internal predecessors, (178), 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) [2021-12-21 10:15:18,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 178 transitions. [2021-12-21 10:15:18,434 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 178 transitions. Word has length 45 [2021-12-21 10:15:18,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:15:18,434 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 178 transitions. [2021-12-21 10:15:18,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 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) [2021-12-21 10:15:18,435 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 178 transitions. [2021-12-21 10:15:18,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-21 10:15:18,435 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:15:18,435 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:15:18,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-12-21 10:15:18,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:18,652 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:15:18,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:15:18,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1431802284, now seen corresponding path program 5 times [2021-12-21 10:15:18,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:15:18,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604486947] [2021-12-21 10:15:18,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:18,653 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:15:18,662 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-21 10:15:18,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2042643738] [2021-12-21 10:15:18,662 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-21 10:15:18,663 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:18,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:15:18,664 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:15:18,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-12-21 10:15:18,778 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-12-21 10:15:18,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:15:18,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-21 10:15:18,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:15:18,788 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-21 10:15:18,852 INFO L387 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 37 treesize of output 17 [2021-12-21 10:15:18,897 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-12-21 10:15:18,898 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-12-21 10:15:18,946 INFO L387 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 16 treesize of output 18 [2021-12-21 10:15:18,977 INFO L387 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 16 treesize of output 18 [2021-12-21 10:15:19,002 INFO L387 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 [2021-12-21 10:15:19,015 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 29 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-21 10:15:19,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:15:19,063 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 2)) is different from false [2021-12-21 10:15:19,070 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 2)) is different from false [2021-12-21 10:15:19,080 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_933 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2021-12-21 10:15:19,091 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_930 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_930)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 2)) is different from false [2021-12-21 10:15:19,125 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_288| Int)) (or (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_930 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_288| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_930)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 2)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_288|)))) is different from false [2021-12-21 10:15:21,178 INFO L353 Elim1Store]: treesize reduction 37, result has 42.2 percent of original size [2021-12-21 10:15:21,179 INFO L387 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 43 [2021-12-21 10:15:21,185 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 10:15:21,185 INFO L387 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 40 treesize of output 40 [2021-12-21 10:15:21,187 INFO L387 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 11 treesize of output 7 [2021-12-21 10:15:21,229 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 22 not checked. [2021-12-21 10:15:21,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:15:21,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604486947] [2021-12-21 10:15:21,234 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-21 10:15:21,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042643738] [2021-12-21 10:15:21,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042643738] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:15:21,234 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 10:15:21,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2021-12-21 10:15:21,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686558334] [2021-12-21 10:15:21,234 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 10:15:21,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-21 10:15:21,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:15:21,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-21 10:15:21,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=253, Unknown=5, NotChecked=180, Total=506 [2021-12-21 10:15:21,235 INFO L87 Difference]: Start difference. First operand 142 states and 178 transitions. Second operand has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:23,296 WARN L838 $PredicateComparison]: unable to prove that (and (= (+ (- 1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_288| Int)) (or (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_930 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_288| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_930)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 2)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_288|)))) (= 2 |c_ULTIMATE.start_main_~i~0#1|)) is different from false [2021-12-21 10:15:25,318 WARN L838 $PredicateComparison]: unable to prove that (and (<= 3 |c_ULTIMATE.start_main_~i~0#1|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_288| Int)) (or (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_930 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_288| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_930)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 2)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_288|)))) (forall ((v_ArrVal_933 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= (+ (- 1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) 1)) is different from false [2021-12-21 10:15:25,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:15:25,546 INFO L93 Difference]: Finished difference Result 264 states and 344 transitions. [2021-12-21 10:15:25,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-21 10:15:25,547 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-12-21 10:15:25,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:15:25,547 INFO L225 Difference]: With dead ends: 264 [2021-12-21 10:15:25,547 INFO L226 Difference]: Without dead ends: 238 [2021-12-21 10:15:25,548 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 64 SyntacticMatches, 9 SemanticMatches, 26 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=93, Invalid=348, Unknown=7, NotChecked=308, Total=756 [2021-12-21 10:15:25,548 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 33 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 303 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 10:15:25,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 94 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 392 Invalid, 0 Unknown, 303 Unchecked, 0.2s Time] [2021-12-21 10:15:25,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-12-21 10:15:25,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 206. [2021-12-21 10:15:25,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.2829268292682927) internal successors, (263), 205 states have internal predecessors, (263), 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) [2021-12-21 10:15:25,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 263 transitions. [2021-12-21 10:15:25,581 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 263 transitions. Word has length 45 [2021-12-21 10:15:25,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:15:25,581 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 263 transitions. [2021-12-21 10:15:25,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:25,582 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 263 transitions. [2021-12-21 10:15:25,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-21 10:15:25,583 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:15:25,583 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:15:25,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2021-12-21 10:15:25,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:25,812 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:15:25,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:15:25,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1853695216, now seen corresponding path program 6 times [2021-12-21 10:15:25,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:15:25,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237678195] [2021-12-21 10:15:25,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:25,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:15:25,830 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-21 10:15:25,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1736966253] [2021-12-21 10:15:25,830 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-21 10:15:25,831 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:25,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:15:25,832 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:15:25,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-12-21 10:15:25,966 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2021-12-21 10:15:25,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:15:25,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-21 10:15:25,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:15:25,978 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-21 10:15:26,038 INFO L387 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 37 treesize of output 17 [2021-12-21 10:15:26,086 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-12-21 10:15:26,086 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2021-12-21 10:15:26,119 INFO L353 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-12-21 10:15:26,119 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2021-12-21 10:15:26,214 INFO L387 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 20 treesize of output 22 [2021-12-21 10:15:26,252 INFO L353 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2021-12-21 10:15:26,252 INFO L387 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 25 treesize of output 14 [2021-12-21 10:15:26,314 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-21 10:15:26,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:15:26,440 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~N~0 (+ 3 |c_ULTIMATE.start_main_~i~0#1|)) (forall ((v_ArrVal_1004 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 2))) is different from false [2021-12-21 10:15:26,466 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1004 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (<= c_~N~0 3)) is different from false [2021-12-21 10:15:26,473 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1004 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (<= |c_ULTIMATE.start_main_~i~0#1| 3)) is different from false [2021-12-21 10:15:26,479 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1004 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (<= |c_ULTIMATE.start_main_~i~0#1| 2)) is different from false [2021-12-21 10:15:26,490 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (<= |ULTIMATE.start_main_~i~0#1| 2) (forall ((v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 2)))) is different from false [2021-12-21 10:15:26,516 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1000 Int) (|v_ULTIMATE.start_main_~i~0#1_310| Int) (v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 Int)) (or (<= |v_ULTIMATE.start_main_~i~0#1_310| 2) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1000) (+ (* |v_ULTIMATE.start_main_~i~0#1_310| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) is different from false [2021-12-21 10:15:26,571 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_311| Int)) (or (forall ((v_ArrVal_1000 Int) (|v_ULTIMATE.start_main_~i~0#1_310| Int) (v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 Int)) (or (<= |v_ULTIMATE.start_main_~i~0#1_310| 2) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_311| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1000) (+ (* |v_ULTIMATE.start_main_~i~0#1_310| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_311|)))) is different from false [2021-12-21 10:15:26,667 INFO L353 Elim1Store]: treesize reduction 104, result has 35.4 percent of original size [2021-12-21 10:15:26,668 INFO L387 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 61 treesize of output 73 [2021-12-21 10:15:26,686 INFO L353 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2021-12-21 10:15:26,686 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 66 [2021-12-21 10:15:26,691 INFO L387 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 11 treesize of output 7 [2021-12-21 10:15:26,766 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 25 not checked. [2021-12-21 10:15:26,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:15:26,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237678195] [2021-12-21 10:15:26,766 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-21 10:15:26,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736966253] [2021-12-21 10:15:26,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736966253] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:15:26,766 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 10:15:26,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 33 [2021-12-21 10:15:26,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576148222] [2021-12-21 10:15:26,766 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 10:15:26,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-21 10:15:26,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:15:26,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-21 10:15:26,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=535, Unknown=7, NotChecked=378, Total=1056 [2021-12-21 10:15:26,767 INFO L87 Difference]: Start difference. First operand 206 states and 263 transitions. Second operand has 33 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:28,879 WARN L838 $PredicateComparison]: unable to prove that (and (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (forall ((|v_ULTIMATE.start_main_~i~0#1_311| Int)) (or (forall ((v_ArrVal_1000 Int) (|v_ULTIMATE.start_main_~i~0#1_310| Int) (v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 Int)) (or (<= |v_ULTIMATE.start_main_~i~0#1_310| 2) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_311| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1000) (+ (* |v_ULTIMATE.start_main_~i~0#1_310| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_311|)))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 1)) is different from false [2021-12-21 10:15:30,906 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_311| Int)) (or (forall ((v_ArrVal_1000 Int) (|v_ULTIMATE.start_main_~i~0#1_310| Int) (v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 Int)) (or (<= |v_ULTIMATE.start_main_~i~0#1_310| 2) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_311| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1000) (+ (* |v_ULTIMATE.start_main_~i~0#1_310| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_311|)))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (<= |ULTIMATE.start_main_~i~0#1| 2) (forall ((v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 2)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 2)) is different from false [2021-12-21 10:15:32,910 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_1000 Int) (|v_ULTIMATE.start_main_~i~0#1_310| Int) (v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 Int)) (or (<= |v_ULTIMATE.start_main_~i~0#1_310| 2) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1000) (+ (* |v_ULTIMATE.start_main_~i~0#1_310| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (<= |ULTIMATE.start_main_~i~0#1| 2) (forall ((v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 2)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 2)) is different from false [2021-12-21 10:15:34,913 WARN L838 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_1004 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (<= |c_ULTIMATE.start_main_~i~0#1| 2)) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (<= |ULTIMATE.start_main_~i~0#1| 2) (forall ((v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 2)))) (or (= (* |c_ULTIMATE.start_main_~i~0#1| 4) 4) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 2))) is different from false [2021-12-21 10:15:36,917 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (or (forall ((v_ArrVal_1004 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (<= |c_ULTIMATE.start_main_~i~0#1| 3)) (or (<= |c_ULTIMATE.start_main_~i~0#1| 2) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 2)) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (<= |ULTIMATE.start_main_~i~0#1| 2) (forall ((v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 2))))) is different from false [2021-12-21 10:15:37,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:15:37,220 INFO L93 Difference]: Finished difference Result 242 states and 304 transitions. [2021-12-21 10:15:37,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-12-21 10:15:37,220 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-12-21 10:15:37,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:15:37,221 INFO L225 Difference]: With dead ends: 242 [2021-12-21 10:15:37,221 INFO L226 Difference]: Without dead ends: 224 [2021-12-21 10:15:37,222 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=247, Invalid=911, Unknown=12, NotChecked=900, Total=2070 [2021-12-21 10:15:37,222 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 35 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 339 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 10:15:37,222 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 95 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 432 Invalid, 0 Unknown, 339 Unchecked, 0.2s Time] [2021-12-21 10:15:37,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-12-21 10:15:37,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 207. [2021-12-21 10:15:37,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.2718446601941749) internal successors, (262), 206 states have internal predecessors, (262), 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) [2021-12-21 10:15:37,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 262 transitions. [2021-12-21 10:15:37,259 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 262 transitions. Word has length 45 [2021-12-21 10:15:37,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:15:37,259 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 262 transitions. [2021-12-21 10:15:37,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:37,260 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 262 transitions. [2021-12-21 10:15:37,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-21 10:15:37,260 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:15:37,260 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:15:37,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-12-21 10:15:37,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-21 10:15:37,475 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:15:37,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:15:37,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1422716494, now seen corresponding path program 3 times [2021-12-21 10:15:37,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:15:37,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690561321] [2021-12-21 10:15:37,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:37,476 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:15:37,496 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-21 10:15:37,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [253781214] [2021-12-21 10:15:37,504 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-21 10:15:37,504 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:37,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:15:37,505 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:15:37,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-12-21 10:15:37,627 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-21 10:15:37,628 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:15:37,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-21 10:15:37,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:15:37,674 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-21 10:15:37,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:37,812 INFO L387 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 27 treesize of output 26 [2021-12-21 10:15:37,880 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2021-12-21 10:15:37,880 INFO L387 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 27 treesize of output 34 [2021-12-21 10:15:37,986 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2021-12-21 10:15:37,987 INFO L387 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 38 [2021-12-21 10:15:38,180 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 10:15:38,180 INFO L387 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 24 treesize of output 24 [2021-12-21 10:15:38,386 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 21 proven. 37 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-21 10:15:38,386 INFO L328 TraceCheckSpWp]: Computing backward predicates...