./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/indp2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/indp2.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 22448626353835b24dede83f92858a925e988e04b05430a9ca91763be927cf92 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 10:43:50,487 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 10:43:50,489 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 10:43:50,525 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 10:43:50,525 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 10:43:50,527 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 10:43:50,528 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 10:43:50,530 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 10:43:50,531 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 10:43:50,534 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 10:43:50,535 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 10:43:50,537 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 10:43:50,537 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 10:43:50,538 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 10:43:50,539 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 10:43:50,541 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 10:43:50,542 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 10:43:50,543 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 10:43:50,544 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 10:43:50,548 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 10:43:50,550 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 10:43:50,550 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 10:43:50,551 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 10:43:50,552 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 10:43:50,553 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 10:43:50,558 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 10:43:50,558 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 10:43:50,559 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 10:43:50,559 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 10:43:50,560 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 10:43:50,560 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 10:43:50,561 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 10:43:50,562 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 10:43:50,562 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 10:43:50,563 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 10:43:50,564 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 10:43:50,564 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 10:43:50,565 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 10:43:50,565 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 10:43:50,565 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 10:43:50,566 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 10:43:50,567 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 10:43:50,568 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 10:43:50,592 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 10:43:50,592 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 10:43:50,592 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 10:43:50,593 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 10:43:50,593 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 10:43:50,593 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 10:43:50,594 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 10:43:50,594 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 10:43:50,594 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 10:43:50,595 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 10:43:50,595 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 10:43:50,595 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 10:43:50,595 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 10:43:50,595 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 10:43:50,595 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 10:43:50,596 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 10:43:50,596 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 10:43:50,596 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 10:43:50,596 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 10:43:50,597 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 10:43:50,597 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 10:43:50,597 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 10:43:50,597 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 10:43:50,597 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 10:43:50,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 10:43:50,598 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 10:43:50,598 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 10:43:50,598 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 10:43:50,598 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 10:43:50,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 10:43:50,599 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 10:43:50,599 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 10:43:50,599 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 10:43:50,599 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 -> 22448626353835b24dede83f92858a925e988e04b05430a9ca91763be927cf92 [2022-07-22 10:43:50,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 10:43:50,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 10:43:50,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 10:43:50,816 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 10:43:50,817 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 10:43:50,817 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/indp2.c [2022-07-22 10:43:50,863 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf8f4f852/75ea900408684f4683cf888d922619a3/FLAGbbc655fdd [2022-07-22 10:43:51,214 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 10:43:51,215 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/indp2.c [2022-07-22 10:43:51,219 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf8f4f852/75ea900408684f4683cf888d922619a3/FLAGbbc655fdd [2022-07-22 10:43:51,232 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf8f4f852/75ea900408684f4683cf888d922619a3 [2022-07-22 10:43:51,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 10:43:51,235 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 10:43:51,237 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 10:43:51,237 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 10:43:51,239 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 10:43:51,240 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:43:51" (1/1) ... [2022-07-22 10:43:51,240 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d46b52c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:43:51, skipping insertion in model container [2022-07-22 10:43:51,240 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:43:51" (1/1) ... [2022-07-22 10:43:51,246 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 10:43:51,257 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 10:43:51,410 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/indp2.c[588,601] [2022-07-22 10:43:51,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 10:43:51,431 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 10:43:51,441 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/indp2.c[588,601] [2022-07-22 10:43:51,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 10:43:51,462 INFO L208 MainTranslator]: Completed translation [2022-07-22 10:43:51,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:43:51 WrapperNode [2022-07-22 10:43:51,462 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 10:43:51,463 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 10:43:51,463 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 10:43:51,463 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 10:43:51,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:43:51" (1/1) ... [2022-07-22 10:43:51,473 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:43:51" (1/1) ... [2022-07-22 10:43:51,487 INFO L137 Inliner]: procedures = 16, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2022-07-22 10:43:51,488 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 10:43:51,488 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 10:43:51,488 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 10:43:51,489 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 10:43:51,494 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:43:51" (1/1) ... [2022-07-22 10:43:51,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:43:51" (1/1) ... [2022-07-22 10:43:51,508 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:43:51" (1/1) ... [2022-07-22 10:43:51,509 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:43:51" (1/1) ... [2022-07-22 10:43:51,519 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:43:51" (1/1) ... [2022-07-22 10:43:51,522 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:43:51" (1/1) ... [2022-07-22 10:43:51,527 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:43:51" (1/1) ... [2022-07-22 10:43:51,530 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 10:43:51,531 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 10:43:51,531 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 10:43:51,531 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 10:43:51,532 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:43:51" (1/1) ... [2022-07-22 10:43:51,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 10:43:51,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:43:51,552 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 10:43:51,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 10:43:51,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 10:43:51,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 10:43:51,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 10:43:51,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 10:43:51,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 10:43:51,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 10:43:51,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 10:43:51,636 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 10:43:51,637 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 10:43:51,748 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 10:43:51,767 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 10:43:51,767 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-22 10:43:51,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:43:51 BoogieIcfgContainer [2022-07-22 10:43:51,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 10:43:51,769 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 10:43:51,769 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 10:43:51,771 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 10:43:51,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 10:43:51" (1/3) ... [2022-07-22 10:43:51,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37e6dc78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:43:51, skipping insertion in model container [2022-07-22 10:43:51,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:43:51" (2/3) ... [2022-07-22 10:43:51,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37e6dc78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:43:51, skipping insertion in model container [2022-07-22 10:43:51,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:43:51" (3/3) ... [2022-07-22 10:43:51,773 INFO L111 eAbstractionObserver]: Analyzing ICFG indp2.c [2022-07-22 10:43:51,788 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 10:43:51,788 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 10:43:51,840 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 10:43:51,847 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@541cbe2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@47993e48 [2022-07-22 10:43:51,847 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 10:43:51,850 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:43:51,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-22 10:43:51,854 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:43:51,855 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:43:51,855 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:43:51,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:43:51,861 INFO L85 PathProgramCache]: Analyzing trace with hash -592971038, now seen corresponding path program 1 times [2022-07-22 10:43:51,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:43:51,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107680816] [2022-07-22 10:43:51,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:43:51,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:43:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:43:51,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:43:51,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:43:51,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107680816] [2022-07-22 10:43:51,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107680816] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 10:43:51,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 10:43:51,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 10:43:51,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628086328] [2022-07-22 10:43:51,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 10:43:51,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 10:43:51,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:43:52,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 10:43:52,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 10:43:52,017 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:43:52,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:43:52,030 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2022-07-22 10:43:52,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 10:43:52,031 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-07-22 10:43:52,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:43:52,036 INFO L225 Difference]: With dead ends: 44 [2022-07-22 10:43:52,037 INFO L226 Difference]: Without dead ends: 20 [2022-07-22 10:43:52,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 10:43:52,047 INFO L413 NwaCegarLoop]: 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 [2022-07-22 10:43:52,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 10:43:52,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-22 10:43:52,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-22 10:43:52,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:43:52,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-07-22 10:43:52,066 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 14 [2022-07-22 10:43:52,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:43:52,067 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-07-22 10:43:52,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:43:52,067 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-07-22 10:43:52,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-22 10:43:52,068 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:43:52,068 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:43:52,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 10:43:52,068 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:43:52,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:43:52,069 INFO L85 PathProgramCache]: Analyzing trace with hash 108093540, now seen corresponding path program 1 times [2022-07-22 10:43:52,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:43:52,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341298828] [2022-07-22 10:43:52,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:43:52,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:43:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:43:52,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:43:52,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:43:52,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341298828] [2022-07-22 10:43:52,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341298828] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 10:43:52,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 10:43:52,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 10:43:52,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244411208] [2022-07-22 10:43:52,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 10:43:52,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 10:43:52,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:43:52,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 10:43:52,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-22 10:43:52,166 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:43:52,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:43:52,215 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-07-22 10:43:52,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 10:43:52,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-07-22 10:43:52,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:43:52,217 INFO L225 Difference]: With dead ends: 45 [2022-07-22 10:43:52,217 INFO L226 Difference]: Without dead ends: 32 [2022-07-22 10:43:52,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-22 10:43:52,218 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 24 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 10:43:52,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 16 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 10:43:52,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-22 10:43:52,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 23. [2022-07-22 10:43:52,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:43:52,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-07-22 10:43:52,224 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 14 [2022-07-22 10:43:52,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:43:52,226 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-07-22 10:43:52,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:43:52,227 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-07-22 10:43:52,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-22 10:43:52,230 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:43:52,230 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:43:52,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 10:43:52,231 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:43:52,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:43:52,238 INFO L85 PathProgramCache]: Analyzing trace with hash 615941150, now seen corresponding path program 1 times [2022-07-22 10:43:52,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:43:52,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425442007] [2022-07-22 10:43:52,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:43:52,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:43:52,253 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:43:52,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [819703742] [2022-07-22 10:43:52,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:43:52,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:43:52,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:43:52,272 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:43:52,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 10:43:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:43:52,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-22 10:43:52,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:43:52,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 10:43:52,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-07-22 10:43:52,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-22 10:43:52,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:43:52,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:43:52,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-07-22 10:43:52,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2022-07-22 10:43:52,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:43:52,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:43:52,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425442007] [2022-07-22 10:43:52,689 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:43:52,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819703742] [2022-07-22 10:43:52,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819703742] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:43:52,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:43:52,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-07-22 10:43:52,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104986222] [2022-07-22 10:43:52,690 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:43:52,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-22 10:43:52,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:43:52,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-22 10:43:52,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-07-22 10:43:52,694 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:43:52,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:43:52,836 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2022-07-22 10:43:52,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 10:43:52,836 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-22 10:43:52,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:43:52,837 INFO L225 Difference]: With dead ends: 55 [2022-07-22 10:43:52,837 INFO L226 Difference]: Without dead ends: 53 [2022-07-22 10:43:52,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-07-22 10:43:52,839 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 40 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:43:52,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 102 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:43:52,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-22 10:43:52,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 30. [2022-07-22 10:43:52,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:43:52,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-07-22 10:43:52,844 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 20 [2022-07-22 10:43:52,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:43:52,844 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-07-22 10:43:52,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:43:52,844 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-07-22 10:43:52,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-22 10:43:52,845 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:43:52,845 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:43:52,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-22 10:43:53,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:43:53,052 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:43:53,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:43:53,056 INFO L85 PathProgramCache]: Analyzing trace with hash 678263444, now seen corresponding path program 1 times [2022-07-22 10:43:53,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:43:53,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154072294] [2022-07-22 10:43:53,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:43:53,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:43:53,084 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:43:53,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1710648424] [2022-07-22 10:43:53,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:43:53,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:43:53,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:43:53,086 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:43:53,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 10:43:53,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:43:53,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 10:43:53,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:43:53,225 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 10:43:53,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:43:53,274 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 10:43:53,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:43:53,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154072294] [2022-07-22 10:43:53,275 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:43:53,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710648424] [2022-07-22 10:43:53,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710648424] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:43:53,276 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:43:53,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-07-22 10:43:53,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79982840] [2022-07-22 10:43:53,276 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:43:53,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 10:43:53,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:43:53,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 10:43:53,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-22 10:43:53,277 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:43:53,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:43:53,398 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2022-07-22 10:43:53,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 10:43:53,398 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-22 10:43:53,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:43:53,399 INFO L225 Difference]: With dead ends: 84 [2022-07-22 10:43:53,399 INFO L226 Difference]: Without dead ends: 48 [2022-07-22 10:43:53,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-07-22 10:43:53,400 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 37 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:43:53,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 44 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:43:53,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-07-22 10:43:53,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2022-07-22 10:43:53,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:43:53,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-07-22 10:43:53,405 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 24 [2022-07-22 10:43:53,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:43:53,405 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-07-22 10:43:53,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:43:53,406 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-07-22 10:43:53,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-22 10:43:53,406 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:43:53,406 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:43:53,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 10:43:53,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-22 10:43:53,623 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:43:53,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:43:53,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1587482582, now seen corresponding path program 2 times [2022-07-22 10:43:53,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:43:53,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915414765] [2022-07-22 10:43:53,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:43:53,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:43:53,636 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:43:53,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [633495360] [2022-07-22 10:43:53,636 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 10:43:53,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:43:53,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:43:53,638 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:43:53,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 10:43:53,684 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 10:43:53,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:43:53,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 10:43:53,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:43:53,779 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 10:43:53,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:43:53,825 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 10:43:53,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:43:53,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915414765] [2022-07-22 10:43:53,826 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:43:53,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633495360] [2022-07-22 10:43:53,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633495360] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:43:53,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:43:53,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-07-22 10:43:53,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265604863] [2022-07-22 10:43:53,826 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:43:53,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-22 10:43:53,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:43:53,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-22 10:43:53,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-07-22 10:43:53,828 INFO L87 Difference]: Start difference. First operand 34 states and 38 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) [2022-07-22 10:43:53,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:43:53,945 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2022-07-22 10:43:53,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 10:43:53,945 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 28 [2022-07-22 10:43:53,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:43:53,946 INFO L225 Difference]: With dead ends: 102 [2022-07-22 10:43:53,946 INFO L226 Difference]: Without dead ends: 79 [2022-07-22 10:43:53,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-07-22 10:43:53,947 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 90 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:43:53,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 61 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:43:53,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-22 10:43:53,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 54. [2022-07-22 10:43:53,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 53 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:43:53,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2022-07-22 10:43:53,953 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 28 [2022-07-22 10:43:53,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:43:53,954 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2022-07-22 10:43:53,954 INFO L496 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) [2022-07-22 10:43:53,954 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-07-22 10:43:53,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-22 10:43:53,954 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:43:53,955 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:43:53,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 10:43:54,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:43:54,175 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:43:54,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:43:54,176 INFO L85 PathProgramCache]: Analyzing trace with hash 341343694, now seen corresponding path program 2 times [2022-07-22 10:43:54,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:43:54,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406863021] [2022-07-22 10:43:54,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:43:54,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:43:54,185 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:43:54,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [254622437] [2022-07-22 10:43:54,186 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 10:43:54,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:43:54,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:43:54,187 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:43:54,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-22 10:43:54,275 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 10:43:54,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:43:54,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-22 10:43:54,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:43:54,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 10:43:54,313 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-22 10:43:54,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-07-22 10:43:54,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-07-22 10:43:54,361 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-22 10:43:54,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-07-22 10:43:54,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2022-07-22 10:43:54,405 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:43:54,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:43:54,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-07-22 10:43:54,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2022-07-22 10:43:54,581 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:43:54,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:43:54,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406863021] [2022-07-22 10:43:54,581 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:43:54,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254622437] [2022-07-22 10:43:54,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254622437] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:43:54,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:43:54,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 19 [2022-07-22 10:43:54,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623867256] [2022-07-22 10:43:54,582 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:43:54,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-22 10:43:54,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:43:54,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-22 10:43:54,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2022-07-22 10:43:54,583 INFO L87 Difference]: Start difference. First operand 54 states and 60 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) [2022-07-22 10:43:54,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:43:54,946 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2022-07-22 10:43:54,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-22 10:43:54,946 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 30 [2022-07-22 10:43:54,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:43:54,947 INFO L225 Difference]: With dead ends: 124 [2022-07-22 10:43:54,947 INFO L226 Difference]: Without dead ends: 103 [2022-07-22 10:43:54,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2022-07-22 10:43:54,948 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 103 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 10:43:54,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 185 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 398 Invalid, 0 Unknown, 19 Unchecked, 0.2s Time] [2022-07-22 10:43:54,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-22 10:43:54,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 63. [2022-07-22 10:43:54,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 62 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:43:54,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2022-07-22 10:43:54,965 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 30 [2022-07-22 10:43:54,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:43:54,965 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2022-07-22 10:43:54,965 INFO L496 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) [2022-07-22 10:43:54,965 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2022-07-22 10:43:54,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-22 10:43:54,966 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:43:54,966 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:43:54,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-22 10:43:55,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:43:55,175 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:43:55,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:43:55,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1505554158, now seen corresponding path program 3 times [2022-07-22 10:43:55,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:43:55,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535121649] [2022-07-22 10:43:55,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:43:55,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:43:55,189 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:43:55,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [626292047] [2022-07-22 10:43:55,192 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 10:43:55,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:43:55,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:43:55,198 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:43:55,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-22 10:43:55,276 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-22 10:43:55,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:43:55,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-22 10:43:55,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:43:55,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2022-07-22 10:43:55,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:43:55,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-22 10:43:55,339 INFO L356 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-07-22 10:43:55,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 28 [2022-07-22 10:43:55,398 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:43:55,400 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 10:43:55,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 41 [2022-07-22 10:43:55,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:43:55,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-07-22 10:43:55,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:43:55,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-07-22 10:43:55,491 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:43:55,493 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 10:43:55,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2022-07-22 10:43:55,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:43:55,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-07-22 10:43:55,562 INFO L356 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-07-22 10:43:55,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-07-22 10:43:55,653 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:43:55,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:43:57,774 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (forall ((v_ArrVal_169 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_169) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) is different from false [2022-07-22 10:43:58,156 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_169 Int) (v_ArrVal_168 Int) (|v_ULTIMATE.start_main_~i~0#1_79| Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_79| 1) c_~N~0) (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_168) (+ (* |v_ULTIMATE.start_main_~i~0#1_79| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_169) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) is different from false [2022-07-22 10:44:00,178 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_80| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_80|)) (forall ((v_ArrVal_169 Int) (v_ArrVal_168 Int) (|v_ULTIMATE.start_main_~i~0#1_79| Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_79| 1) c_~N~0) (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_80| 8)) v_ArrVal_168) (+ (* |v_ULTIMATE.start_main_~i~0#1_79| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_169) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) is different from false [2022-07-22 10:44:00,784 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_80| Int) (v_ArrVal_169 Int) (v_ArrVal_168 Int) (|v_ULTIMATE.start_main_~i~0#1_79| Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_79| 1) c_~N~0) (= 0 (select (store (store (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_80| 8)) v_ArrVal_168) (+ (* |v_ULTIMATE.start_main_~i~0#1_79| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_169) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_80|)))) is different from false [2022-07-22 10:44:05,835 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_80| Int) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_158 Int) (v_ArrVal_169 Int) (v_ArrVal_168 Int) (|v_ULTIMATE.start_main_~i~0#1_79| Int) (v_ArrVal_163 Int) (v_ArrVal_161 Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_80|)) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_83|) (= (select (store (store (let ((.cse0 (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_158) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_84| 8)) v_ArrVal_161) (+ (* |v_ULTIMATE.start_main_~i~0#1_83| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_163))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_80| 8)) v_ArrVal_168) (+ (* |v_ULTIMATE.start_main_~i~0#1_79| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_169) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (<= (+ |v_ULTIMATE.start_main_~i~0#1_79| 1) |v_ULTIMATE.start_main_~i~0#1_83|) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_84|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) |v_ULTIMATE.start_main_~i~0#1_83|)))) is different from false [2022-07-22 10:44:06,421 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_80| Int) (v_ArrVal_158 Int) (v_ArrVal_169 Int) (v_ArrVal_168 Int) (v_ArrVal_155 Int) (|v_ULTIMATE.start_main_~i~0#1_79| Int) (v_ArrVal_163 Int) (|v_ULTIMATE.start_main_~i~0#1_88| Int) (v_ArrVal_161 Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_80|)) (= (select (store (store (let ((.cse0 (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_155) (+ (* |v_ULTIMATE.start_main_~i~0#1_88| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_158) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_84| 8)) v_ArrVal_161) (+ (* |v_ULTIMATE.start_main_~i~0#1_83| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_163))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_80| 8)) v_ArrVal_168) (+ (* |v_ULTIMATE.start_main_~i~0#1_79| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_169) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (<= (+ |v_ULTIMATE.start_main_~i~0#1_79| 1) |v_ULTIMATE.start_main_~i~0#1_83|) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_84|)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_88| 1) |v_ULTIMATE.start_main_~i~0#1_83|) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) |v_ULTIMATE.start_main_~i~0#1_83|)))) is different from false [2022-07-22 10:44:08,463 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_89| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_89|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_80| Int) (v_ArrVal_158 Int) (v_ArrVal_169 Int) (v_ArrVal_168 Int) (v_ArrVal_155 Int) (|v_ULTIMATE.start_main_~i~0#1_79| Int) (v_ArrVal_163 Int) (|v_ULTIMATE.start_main_~i~0#1_88| Int) (v_ArrVal_161 Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int)) (or (= (select (store (store (let ((.cse0 (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_89| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_155) (+ (* |v_ULTIMATE.start_main_~i~0#1_88| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_158) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_84| 8)) v_ArrVal_161) (+ (* |v_ULTIMATE.start_main_~i~0#1_83| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_163))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_80| 8)) v_ArrVal_168) (+ (* |v_ULTIMATE.start_main_~i~0#1_79| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_169) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_80|)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_79| 1) |v_ULTIMATE.start_main_~i~0#1_83|) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_84|)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_88| 1) |v_ULTIMATE.start_main_~i~0#1_83|) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) |v_ULTIMATE.start_main_~i~0#1_83|)))))) is different from false [2022-07-22 10:44:08,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 108 [2022-07-22 10:44:08,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 190572 treesize of output 190060 [2022-07-22 10:44:16,575 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 8 refuted. 1 times theorem prover too weak. 0 trivial. 17 not checked. [2022-07-22 10:44:16,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:44:16,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535121649] [2022-07-22 10:44:16,575 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:44:16,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626292047] [2022-07-22 10:44:16,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626292047] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:44:16,576 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:44:16,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 42 [2022-07-22 10:44:16,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215918673] [2022-07-22 10:44:16,576 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:44:16,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-22 10:44:16,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:44:16,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-22 10:44:16,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=980, Unknown=9, NotChecked=504, Total=1722 [2022-07-22 10:44:16,578 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 42 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:44:18,604 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_89| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_89|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_80| Int) (v_ArrVal_158 Int) (v_ArrVal_169 Int) (v_ArrVal_168 Int) (v_ArrVal_155 Int) (|v_ULTIMATE.start_main_~i~0#1_79| Int) (v_ArrVal_163 Int) (|v_ULTIMATE.start_main_~i~0#1_88| Int) (v_ArrVal_161 Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int)) (or (= (select (store (store (let ((.cse0 (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_89| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_155) (+ (* |v_ULTIMATE.start_main_~i~0#1_88| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_158) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_84| 8)) v_ArrVal_161) (+ (* |v_ULTIMATE.start_main_~i~0#1_83| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_163))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_80| 8)) v_ArrVal_168) (+ (* |v_ULTIMATE.start_main_~i~0#1_79| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_169) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_80|)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_79| 1) |v_ULTIMATE.start_main_~i~0#1_83|) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_84|)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_88| 1) |v_ULTIMATE.start_main_~i~0#1_83|) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) |v_ULTIMATE.start_main_~i~0#1_83|)))))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (or (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (= 0 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (* (+ |c_ULTIMATE.start_main_~i~0#1| 1) (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|))))) is different from false [2022-07-22 10:44:19,178 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (= (- 1) .cse0) (or (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (= 0 .cse0)) (forall ((|v_ULTIMATE.start_main_~i~0#1_80| Int) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_158 Int) (v_ArrVal_169 Int) (v_ArrVal_168 Int) (|v_ULTIMATE.start_main_~i~0#1_79| Int) (v_ArrVal_163 Int) (v_ArrVal_161 Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_80|)) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_83|) (= (select (store (store (let ((.cse1 (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_158) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_84| 8)) v_ArrVal_161) (+ (* |v_ULTIMATE.start_main_~i~0#1_83| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_163))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_80| 8)) v_ArrVal_168) (+ (* |v_ULTIMATE.start_main_~i~0#1_79| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_169) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (<= (+ |v_ULTIMATE.start_main_~i~0#1_79| 1) |v_ULTIMATE.start_main_~i~0#1_83|) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_84|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) |v_ULTIMATE.start_main_~i~0#1_83|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-07-22 10:44:19,726 WARN L833 $PredicateComparison]: unable to prove that (and (= (- 1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_80| Int) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_158 Int) (v_ArrVal_169 Int) (v_ArrVal_168 Int) (|v_ULTIMATE.start_main_~i~0#1_79| Int) (v_ArrVal_163 Int) (v_ArrVal_161 Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_80|)) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_83|) (= (select (store (store (let ((.cse0 (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_158) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_84| 8)) v_ArrVal_161) (+ (* |v_ULTIMATE.start_main_~i~0#1_83| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_163))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_80| 8)) v_ArrVal_168) (+ (* |v_ULTIMATE.start_main_~i~0#1_79| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_169) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (<= (+ |v_ULTIMATE.start_main_~i~0#1_79| 1) |v_ULTIMATE.start_main_~i~0#1_83|) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_84|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) |v_ULTIMATE.start_main_~i~0#1_83|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-22 10:44:21,982 WARN L833 $PredicateComparison]: unable to prove that (and (< 2 c_~N~0) (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_80| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_80|)) (forall ((v_ArrVal_169 Int) (v_ArrVal_168 Int) (|v_ULTIMATE.start_main_~i~0#1_79| Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_79| 1) c_~N~0) (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_80| 8)) v_ArrVal_168) (+ (* |v_ULTIMATE.start_main_~i~0#1_79| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_169) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (= (- 1) (+ (- 1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-22 10:44:24,000 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (forall ((v_ArrVal_169 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_169) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (< 2 c_~N~0) (= (- 1) (+ (- 1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-22 10:44:26,005 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (forall ((v_ArrVal_169 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_169) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (< 2 c_~N~0) (= (- 1) (+ (- 1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-22 10:44:26,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:44:26,179 INFO L93 Difference]: Finished difference Result 153 states and 173 transitions. [2022-07-22 10:44:26,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-22 10:44:26,179 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-22 10:44:26,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:44:26,181 INFO L225 Difference]: With dead ends: 153 [2022-07-22 10:44:26,181 INFO L226 Difference]: Without dead ends: 151 [2022-07-22 10:44:26,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 19 SyntacticMatches, 7 SemanticMatches, 61 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=477, Invalid=2010, Unknown=15, NotChecked=1404, Total=3906 [2022-07-22 10:44:26,183 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 96 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 549 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:44:26,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 171 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 257 Invalid, 0 Unknown, 549 Unchecked, 0.1s Time] [2022-07-22 10:44:26,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-22 10:44:26,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 101. [2022-07-22 10:44:26,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.19) internal successors, (119), 100 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:44:26,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 119 transitions. [2022-07-22 10:44:26,214 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 119 transitions. Word has length 32 [2022-07-22 10:44:26,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:44:26,214 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 119 transitions. [2022-07-22 10:44:26,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:44:26,215 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 119 transitions. [2022-07-22 10:44:26,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-22 10:44:26,219 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:44:26,219 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:44:26,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-22 10:44:26,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:44:26,434 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:44:26,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:44:26,435 INFO L85 PathProgramCache]: Analyzing trace with hash 526321296, now seen corresponding path program 4 times [2022-07-22 10:44:26,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:44:26,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3890070] [2022-07-22 10:44:26,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:44:26,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:44:26,444 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:44:26,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2146886205] [2022-07-22 10:44:26,444 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 10:44:26,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:44:26,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:44:26,447 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:44:26,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-22 10:44:26,511 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 10:44:26,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:44:26,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 10:44:26,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:44:26,577 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 10:44:26,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:44:26,621 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 10:44:26,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:44:26,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3890070] [2022-07-22 10:44:26,622 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:44:26,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146886205] [2022-07-22 10:44:26,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146886205] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:44:26,622 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:44:26,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2022-07-22 10:44:26,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119573113] [2022-07-22 10:44:26,622 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:44:26,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-22 10:44:26,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:44:26,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-22 10:44:26,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-07-22 10:44:26,624 INFO L87 Difference]: Start difference. First operand 101 states and 119 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:44:26,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:44:26,852 INFO L93 Difference]: Finished difference Result 185 states and 209 transitions. [2022-07-22 10:44:26,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 10:44:26,852 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-22 10:44:26,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:44:26,853 INFO L225 Difference]: With dead ends: 185 [2022-07-22 10:44:26,853 INFO L226 Difference]: Without dead ends: 148 [2022-07-22 10:44:26,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2022-07-22 10:44:26,854 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 114 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 10:44:26,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 156 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 10:44:26,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-07-22 10:44:26,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 104. [2022-07-22 10:44:26,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.1359223300970873) internal successors, (117), 103 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:44:26,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 117 transitions. [2022-07-22 10:44:26,868 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 117 transitions. Word has length 34 [2022-07-22 10:44:26,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:44:26,868 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 117 transitions. [2022-07-22 10:44:26,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:44:26,868 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2022-07-22 10:44:26,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-22 10:44:26,870 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:44:26,870 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:44:26,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-22 10:44:27,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:44:27,084 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:44:27,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:44:27,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1192686478, now seen corresponding path program 5 times [2022-07-22 10:44:27,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:44:27,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198515899] [2022-07-22 10:44:27,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:44:27,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:44:27,093 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:44:27,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1204804545] [2022-07-22 10:44:27,094 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-22 10:44:27,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:44:27,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:44:27,096 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:44:27,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-22 10:44:27,220 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-22 10:44:27,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:44:27,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-22 10:44:27,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:44:27,297 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 10:44:27,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:44:27,371 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 10:44:27,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:44:27,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198515899] [2022-07-22 10:44:27,372 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:44:27,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204804545] [2022-07-22 10:44:27,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204804545] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:44:27,372 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:44:27,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2022-07-22 10:44:27,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392961201] [2022-07-22 10:44:27,373 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:44:27,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-22 10:44:27,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:44:27,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-22 10:44:27,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-07-22 10:44:27,374 INFO L87 Difference]: Start difference. First operand 104 states and 117 transitions. Second operand has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:44:27,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:44:27,633 INFO L93 Difference]: Finished difference Result 216 states and 234 transitions. [2022-07-22 10:44:27,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-22 10:44:27,634 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 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 36 [2022-07-22 10:44:27,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:44:27,635 INFO L225 Difference]: With dead ends: 216 [2022-07-22 10:44:27,635 INFO L226 Difference]: Without dead ends: 159 [2022-07-22 10:44:27,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=216, Invalid=596, Unknown=0, NotChecked=0, Total=812 [2022-07-22 10:44:27,637 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 254 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 10:44:27,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 137 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 10:44:27,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-07-22 10:44:27,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 112. [2022-07-22 10:44:27,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.1081081081081081) internal successors, (123), 111 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:44:27,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 123 transitions. [2022-07-22 10:44:27,661 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 123 transitions. Word has length 36 [2022-07-22 10:44:27,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:44:27,663 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 123 transitions. [2022-07-22 10:44:27,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:44:27,663 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2022-07-22 10:44:27,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-22 10:44:27,664 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:44:27,664 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:44:27,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-22 10:44:27,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:44:27,884 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:44:27,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:44:27,884 INFO L85 PathProgramCache]: Analyzing trace with hash -389301684, now seen corresponding path program 6 times [2022-07-22 10:44:27,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:44:27,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271276540] [2022-07-22 10:44:27,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:44:27,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:44:27,904 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:44:27,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1025269374] [2022-07-22 10:44:27,905 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-22 10:44:27,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:44:27,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:44:27,920 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:44:27,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-22 10:44:28,055 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-07-22 10:44:28,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:44:28,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 57 conjunts are in the unsatisfiable core [2022-07-22 10:44:28,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:44:28,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 10:44:28,093 INFO L356 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-07-22 10:44:28,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 28 [2022-07-22 10:44:28,125 INFO L356 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-07-22 10:44:28,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-07-22 10:44:28,167 INFO L356 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-07-22 10:44:28,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-07-22 10:44:28,226 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:44:28,229 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 10:44:28,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 41 [2022-07-22 10:44:28,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:28,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-07-22 10:44:28,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:28,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-07-22 10:44:28,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:28,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-07-22 10:44:28,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-07-22 10:44:28,381 INFO L356 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-07-22 10:44:28,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 28 [2022-07-22 10:44:28,425 INFO L356 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-07-22 10:44:28,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-07-22 10:44:28,461 INFO L356 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-07-22 10:44:28,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-07-22 10:44:28,537 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:44:28,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:44:33,381 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_335 Int) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_333 Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (|v_ULTIMATE.start_main_~i~0#1_144| Int) (v_ArrVal_337 Int)) (or (= (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_333) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_145|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_335) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_144|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_337) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= |v_ULTIMATE.start_main_~i~0#1_145| (+ |ULTIMATE.start_main_~i~0#1| 1))) (< (+ |v_ULTIMATE.start_main_~i~0#1_144| 1) c_~N~0) (not (<= |v_ULTIMATE.start_main_~i~0#1_144| (+ |v_ULTIMATE.start_main_~i~0#1_145| 1))))) is different from false [2022-07-22 10:44:35,420 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (v_ArrVal_335 Int) (v_ArrVal_333 Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (|v_ULTIMATE.start_main_~i~0#1_144| Int) (v_ArrVal_337 Int)) (or (not (<= |v_ULTIMATE.start_main_~i~0#1_145| (+ |v_ULTIMATE.start_main_~i~0#1_147| 1))) (< (+ |v_ULTIMATE.start_main_~i~0#1_144| 1) c_~N~0) (not (<= |v_ULTIMATE.start_main_~i~0#1_144| (+ |v_ULTIMATE.start_main_~i~0#1_145| 1))) (= (select (store (store (store (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_147|)) v_ArrVal_333) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_145|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_335) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_144|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_337) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) is different from false [2022-07-22 10:44:37,440 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (v_ArrVal_335 Int) (v_ArrVal_333 Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (|v_ULTIMATE.start_main_~i~0#1_144| Int) (v_ArrVal_337 Int)) (or (not (<= |v_ULTIMATE.start_main_~i~0#1_145| (+ |v_ULTIMATE.start_main_~i~0#1_147| 1))) (= (select (store (store (store (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_147|)) v_ArrVal_333) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_145|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_335) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_144|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_337) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (< (+ |v_ULTIMATE.start_main_~i~0#1_144| 1) c_~N~0) (not (<= |v_ULTIMATE.start_main_~i~0#1_144| (+ |v_ULTIMATE.start_main_~i~0#1_145| 1))))) is different from false [2022-07-22 10:45:38,793 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_150| Int) (|v_ULTIMATE.start_main_~i~0#1_152| Int) (v_ArrVal_318 Int) (|v_ULTIMATE.start_main_~i~0#1_151| Int) (v_ArrVal_328 Int) (v_ArrVal_337 Int) (v_ArrVal_325 Int) (|v_ULTIMATE.start_main_~i~0#1_147| Int) (v_ArrVal_335 Int) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_333 Int) (v_ArrVal_330 Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (|v_ULTIMATE.start_main_~i~0#1_144| Int)) (or (not (<= |v_ULTIMATE.start_main_~i~0#1_145| (+ |v_ULTIMATE.start_main_~i~0#1_147| 1))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_151| 1) |v_ULTIMATE.start_main_~i~0#1_150|)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_144| 1) |v_ULTIMATE.start_main_~i~0#1_150|) (not (<= |v_ULTIMATE.start_main_~i~0#1_144| (+ |v_ULTIMATE.start_main_~i~0#1_145| 1))) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_150|) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_152| 1) |v_ULTIMATE.start_main_~i~0#1_151|)) (= (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_318))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_152|)) v_ArrVal_325) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_151|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_328) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_150|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_330))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_147|)) v_ArrVal_333) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_145|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_335) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_144|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_337) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_152|)))) is different from false [2022-07-22 10:45:38,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 165 [2022-07-22 10:45:38,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2217 treesize of output 2201 [2022-07-22 10:45:39,164 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 18 refuted. 3 times theorem prover too weak. 0 trivial. 24 not checked. [2022-07-22 10:45:39,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:45:39,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271276540] [2022-07-22 10:45:39,165 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:45:39,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025269374] [2022-07-22 10:45:39,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025269374] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:45:39,165 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:45:39,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 28] total 48 [2022-07-22 10:45:39,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064372555] [2022-07-22 10:45:39,166 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:45:39,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-22 10:45:39,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:45:39,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-22 10:45:39,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1591, Unknown=26, NotChecked=348, Total=2256 [2022-07-22 10:45:39,167 INFO L87 Difference]: Start difference. First operand 112 states and 123 transitions. Second operand has 48 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 48 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:45:39,943 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= (- 1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (and .cse0 (forall ((|v_ULTIMATE.start_main_~i~0#1_150| Int) (|v_ULTIMATE.start_main_~i~0#1_152| Int) (v_ArrVal_318 Int) (|v_ULTIMATE.start_main_~i~0#1_151| Int) (v_ArrVal_328 Int) (v_ArrVal_337 Int) (v_ArrVal_325 Int) (|v_ULTIMATE.start_main_~i~0#1_147| Int) (v_ArrVal_335 Int) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_333 Int) (v_ArrVal_330 Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (|v_ULTIMATE.start_main_~i~0#1_144| Int)) (or (not (<= |v_ULTIMATE.start_main_~i~0#1_145| (+ |v_ULTIMATE.start_main_~i~0#1_147| 1))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_151| 1) |v_ULTIMATE.start_main_~i~0#1_150|)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_144| 1) |v_ULTIMATE.start_main_~i~0#1_150|) (not (<= |v_ULTIMATE.start_main_~i~0#1_144| (+ |v_ULTIMATE.start_main_~i~0#1_145| 1))) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_150|) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_152| 1) |v_ULTIMATE.start_main_~i~0#1_151|)) (= (select (store (store (store (let ((.cse1 (store (store (store (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_318))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_152|)) v_ArrVal_325) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_151|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_328) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_150|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_330))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_147|)) v_ArrVal_333) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_145|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_335) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_144|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_337) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_152|)))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (or .cse0 (<= c_~N~0 3)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-07-22 10:45:40,715 WARN L833 $PredicateComparison]: unable to prove that (and (= (- 1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_150| Int) (|v_ULTIMATE.start_main_~i~0#1_152| Int) (v_ArrVal_318 Int) (|v_ULTIMATE.start_main_~i~0#1_151| Int) (v_ArrVal_328 Int) (v_ArrVal_337 Int) (v_ArrVal_325 Int) (|v_ULTIMATE.start_main_~i~0#1_147| Int) (v_ArrVal_335 Int) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_333 Int) (v_ArrVal_330 Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (|v_ULTIMATE.start_main_~i~0#1_144| Int)) (or (not (<= |v_ULTIMATE.start_main_~i~0#1_145| (+ |v_ULTIMATE.start_main_~i~0#1_147| 1))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_151| 1) |v_ULTIMATE.start_main_~i~0#1_150|)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_144| 1) |v_ULTIMATE.start_main_~i~0#1_150|) (not (<= |v_ULTIMATE.start_main_~i~0#1_144| (+ |v_ULTIMATE.start_main_~i~0#1_145| 1))) (<= (+ 3 |ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_150|) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_152| 1) |v_ULTIMATE.start_main_~i~0#1_151|)) (= (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_318))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_152|)) v_ArrVal_325) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_151|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_328) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_150|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_330))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_147|)) v_ArrVal_333) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_145|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_335) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_144|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_337) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_152|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-22 10:45:49,433 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_335 Int) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_333 Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (|v_ULTIMATE.start_main_~i~0#1_144| Int) (v_ArrVal_337 Int)) (or (= (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_333) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_145|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_335) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_144|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_337) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= |v_ULTIMATE.start_main_~i~0#1_145| (+ |ULTIMATE.start_main_~i~0#1| 1))) (< (+ |v_ULTIMATE.start_main_~i~0#1_144| 1) c_~N~0) (not (<= |v_ULTIMATE.start_main_~i~0#1_144| (+ |v_ULTIMATE.start_main_~i~0#1_145| 1))))) (= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (< 3 c_~N~0)) is different from false [2022-07-22 10:45:49,928 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_335 Int) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_333 Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (|v_ULTIMATE.start_main_~i~0#1_144| Int) (v_ArrVal_337 Int)) (or (= (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_333) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_145|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_335) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_144|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_337) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= |v_ULTIMATE.start_main_~i~0#1_145| (+ |ULTIMATE.start_main_~i~0#1| 1))) (< (+ |v_ULTIMATE.start_main_~i~0#1_144| 1) c_~N~0) (not (<= |v_ULTIMATE.start_main_~i~0#1_144| (+ |v_ULTIMATE.start_main_~i~0#1_145| 1))))) (= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (< 3 c_~N~0)) is different from false [2022-07-22 10:45:50,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:45:50,085 INFO L93 Difference]: Finished difference Result 155 states and 164 transitions. [2022-07-22 10:45:50,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-22 10:45:50,085 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 48 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-22 10:45:50,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:45:50,086 INFO L225 Difference]: With dead ends: 155 [2022-07-22 10:45:50,086 INFO L226 Difference]: Without dead ends: 153 [2022-07-22 10:45:50,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 80.7s TimeCoverageRelationStatistics Valid=475, Invalid=2388, Unknown=31, NotChecked=888, Total=3782 [2022-07-22 10:45:50,087 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 69 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 483 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:45:50,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 262 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 232 Invalid, 0 Unknown, 483 Unchecked, 0.1s Time] [2022-07-22 10:45:50,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-22 10:45:50,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 125. [2022-07-22 10:45:50,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.096774193548387) internal successors, (136), 124 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) [2022-07-22 10:45:50,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 136 transitions. [2022-07-22 10:45:50,097 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 136 transitions. Word has length 38 [2022-07-22 10:45:50,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:45:50,097 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 136 transitions. [2022-07-22 10:45:50,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 48 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:45:50,097 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2022-07-22 10:45:50,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-22 10:45:50,098 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:45:50,098 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:45:50,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-22 10:45:50,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-22 10:45:50,299 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:45:50,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:45:50,299 INFO L85 PathProgramCache]: Analyzing trace with hash -441278722, now seen corresponding path program 3 times [2022-07-22 10:45:50,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:45:50,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132491452] [2022-07-22 10:45:50,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:45:50,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:45:50,307 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:45:50,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [434273400] [2022-07-22 10:45:50,307 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 10:45:50,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:45:50,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:45:50,313 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:45:50,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-22 10:45:50,399 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-22 10:45:50,399 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:45:50,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-22 10:45:50,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:45:50,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2022-07-22 10:45:50,553 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-07-22 10:45:50,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 40 [2022-07-22 10:45:50,668 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-07-22 10:45:50,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 57 [2022-07-22 10:45:50,827 INFO L356 Elim1Store]: treesize reduction 38, result has 45.7 percent of original size [2022-07-22 10:45:50,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 75 [2022-07-22 10:45:51,220 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-07-22 10:45:51,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 56 [2022-07-22 10:45:51,315 INFO L356 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-07-22 10:45:51,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 52 [2022-07-22 10:45:51,450 INFO L356 Elim1Store]: treesize reduction 34, result has 48.5 percent of original size [2022-07-22 10:45:51,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 77 [2022-07-22 10:45:52,195 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-07-22 10:45:52,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 54 [2022-07-22 10:45:52,238 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 10:45:52,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:46:38,586 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_389 Int) (|v_ULTIMATE.start_main_~i~0#1_168| Int) (v_ArrVal_387 Int) (|v_ULTIMATE.start_main_~i~0#1_173| Int)) (or (not (< |v_ULTIMATE.start_main_~i~0#1_173| c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_173| 1) c_~N~0) (= (select (let ((.cse0 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_387) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_389)) (.cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_173|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_168|) |c_ULTIMATE.start_main_~a~0#1.offset|)) 0) (not (< |v_ULTIMATE.start_main_~i~0#1_168| c_~N~0)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_168|)))) is different from false [2022-07-22 10:48:23,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 168 [2022-07-22 10:48:23,581 INFO L356 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2022-07-22 10:48:23,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4540102472728 treesize of output 1 [2022-07-22 10:48:23,588 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 19 refuted. 3 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 10:48:23,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:48:23,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132491452] [2022-07-22 10:48:23,589 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:48:23,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434273400] [2022-07-22 10:48:23,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434273400] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:48:23,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:48:23,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 46 [2022-07-22 10:48:23,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761435363] [2022-07-22 10:48:23,590 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:48:23,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-22 10:48:23,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:48:23,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-22 10:48:23,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1668, Unknown=74, NotChecked=86, Total=2070 [2022-07-22 10:48:23,591 INFO L87 Difference]: Start difference. First operand 125 states and 136 transitions. Second operand has 46 states, 46 states have (on average 1.565217391304348) internal successors, (72), 46 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)