./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/ifeqn5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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/ifeqn5.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 2e5b1d71ba93ce7431f315c72529ea116ea643f5eb9195d392455a202e45b249 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 10:30:14,314 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 10:30:14,316 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 10:30:14,367 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 10:30:14,368 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 10:30:14,369 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 10:30:14,371 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 10:30:14,374 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 10:30:14,376 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 10:30:14,380 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 10:30:14,381 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 10:30:14,383 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 10:30:14,384 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 10:30:14,386 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 10:30:14,388 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 10:30:14,391 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 10:30:14,392 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 10:30:14,393 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 10:30:14,395 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 10:30:14,400 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 10:30:14,402 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 10:30:14,403 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 10:30:14,404 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 10:30:14,405 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 10:30:14,407 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 10:30:14,414 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 10:30:14,414 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 10:30:14,414 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 10:30:14,416 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 10:30:14,416 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 10:30:14,417 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 10:30:14,418 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 10:30:14,419 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 10:30:14,420 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 10:30:14,421 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 10:30:14,422 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 10:30:14,422 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 10:30:14,423 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 10:30:14,424 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 10:30:14,424 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 10:30:14,425 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 10:30:14,427 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 10:30:14,428 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 10:30:14,457 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 10:30:14,458 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 10:30:14,458 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 10:30:14,458 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 10:30:14,459 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 10:30:14,459 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 10:30:14,460 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 10:30:14,460 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 10:30:14,461 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 10:30:14,462 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 10:30:14,462 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 10:30:14,462 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 10:30:14,463 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 10:30:14,463 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 10:30:14,463 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 10:30:14,463 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 10:30:14,464 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 10:30:14,464 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 10:30:14,464 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 10:30:14,464 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 10:30:14,465 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 10:30:14,465 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 10:30:14,465 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 10:30:14,465 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 10:30:14,466 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:30:14,466 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 10:30:14,466 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 10:30:14,466 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 10:30:14,467 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 10:30:14,467 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 10:30:14,467 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 10:30:14,467 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 10:30:14,468 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 10:30:14,468 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 -> 2e5b1d71ba93ce7431f315c72529ea116ea643f5eb9195d392455a202e45b249 [2022-07-19 10:30:14,685 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 10:30:14,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 10:30:14,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 10:30:14,709 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 10:30:14,710 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 10:30:14,711 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/ifeqn5.c [2022-07-19 10:30:14,777 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a4c1db43/a226d5321b964d2496f0c798e98974aa/FLAG766813355 [2022-07-19 10:30:15,205 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 10:30:15,205 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ifeqn5.c [2022-07-19 10:30:15,212 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a4c1db43/a226d5321b964d2496f0c798e98974aa/FLAG766813355 [2022-07-19 10:30:15,226 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a4c1db43/a226d5321b964d2496f0c798e98974aa [2022-07-19 10:30:15,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 10:30:15,231 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 10:30:15,235 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 10:30:15,236 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 10:30:15,238 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 10:30:15,239 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:30:15" (1/1) ... [2022-07-19 10:30:15,240 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a94b7b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:30:15, skipping insertion in model container [2022-07-19 10:30:15,240 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:30:15" (1/1) ... [2022-07-19 10:30:15,246 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 10:30:15,260 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 10:30:15,384 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/ifeqn5.c[589,602] [2022-07-19 10:30:15,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:30:15,418 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 10:30:15,430 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ifeqn5.c[589,602] [2022-07-19 10:30:15,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:30:15,466 INFO L208 MainTranslator]: Completed translation [2022-07-19 10:30:15,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:30:15 WrapperNode [2022-07-19 10:30:15,467 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 10:30:15,468 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 10:30:15,468 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 10:30:15,468 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 10:30:15,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:30:15" (1/1) ... [2022-07-19 10:30:15,491 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:30:15" (1/1) ... [2022-07-19 10:30:15,518 INFO L137 Inliner]: procedures = 16, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2022-07-19 10:30:15,518 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 10:30:15,518 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 10:30:15,519 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 10:30:15,519 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 10:30:15,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:30:15" (1/1) ... [2022-07-19 10:30:15,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:30:15" (1/1) ... [2022-07-19 10:30:15,527 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:30:15" (1/1) ... [2022-07-19 10:30:15,527 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:30:15" (1/1) ... [2022-07-19 10:30:15,531 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:30:15" (1/1) ... [2022-07-19 10:30:15,534 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:30:15" (1/1) ... [2022-07-19 10:30:15,535 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:30:15" (1/1) ... [2022-07-19 10:30:15,537 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 10:30:15,538 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 10:30:15,538 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 10:30:15,538 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 10:30:15,539 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:30:15" (1/1) ... [2022-07-19 10:30:15,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:30:15,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:30:15,564 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-19 10:30:15,579 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-19 10:30:15,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 10:30:15,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 10:30:15,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 10:30:15,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 10:30:15,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 10:30:15,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 10:30:15,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 10:30:15,656 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 10:30:15,657 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 10:30:15,771 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 10:30:15,777 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 10:30:15,792 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-19 10:30:15,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:30:15 BoogieIcfgContainer [2022-07-19 10:30:15,794 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 10:30:15,796 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 10:30:15,796 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 10:30:15,798 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 10:30:15,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:30:15" (1/3) ... [2022-07-19 10:30:15,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4073fdbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:30:15, skipping insertion in model container [2022-07-19 10:30:15,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:30:15" (2/3) ... [2022-07-19 10:30:15,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4073fdbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:30:15, skipping insertion in model container [2022-07-19 10:30:15,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:30:15" (3/3) ... [2022-07-19 10:30:15,801 INFO L111 eAbstractionObserver]: Analyzing ICFG ifeqn5.c [2022-07-19 10:30:15,824 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 10:30:15,825 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 10:30:15,863 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 10:30:15,882 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@4e3f8992, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5e39a25 [2022-07-19 10:30:15,886 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 10:30:15,898 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:30:15,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-19 10:30:15,905 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:30:15,906 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:30:15,910 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:30:15,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:30:15,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1670316217, now seen corresponding path program 1 times [2022-07-19 10:30:15,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:30:15,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139509668] [2022-07-19 10:30:15,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:30:15,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:30:16,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:30:16,037 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-19 10:30:16,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:30:16,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139509668] [2022-07-19 10:30:16,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139509668] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:30:16,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:30:16,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 10:30:16,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488131037] [2022-07-19 10:30:16,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:30:16,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 10:30:16,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:30:16,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 10:30:16,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 10:30:16,072 INFO L87 Difference]: Start difference. First operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 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-19 10:30:16,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:30:16,089 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2022-07-19 10:30:16,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 10:30:16,091 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-07-19 10:30:16,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:30:16,096 INFO L225 Difference]: With dead ends: 42 [2022-07-19 10:30:16,097 INFO L226 Difference]: Without dead ends: 19 [2022-07-19 10:30:16,099 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-19 10:30:16,110 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-19 10:30:16,112 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-19 10:30:16,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-07-19 10:30:16,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-19 10:30:16,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:30:16,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-07-19 10:30:16,143 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2022-07-19 10:30:16,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:30:16,143 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-07-19 10:30:16,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 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-19 10:30:16,144 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-07-19 10:30:16,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-19 10:30:16,145 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:30:16,145 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:30:16,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 10:30:16,147 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:30:16,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:30:16,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1000416578, now seen corresponding path program 1 times [2022-07-19 10:30:16,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:30:16,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678578449] [2022-07-19 10:30:16,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:30:16,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:30:16,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:30:16,265 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-19 10:30:16,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:30:16,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678578449] [2022-07-19 10:30:16,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678578449] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:30:16,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:30:16,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:30:16,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16679560] [2022-07-19 10:30:16,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:30:16,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:30:16,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:30:16,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:30:16,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:30:16,275 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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-19 10:30:16,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:30:16,361 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2022-07-19 10:30:16,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:30:16,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-07-19 10:30:16,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:30:16,363 INFO L225 Difference]: With dead ends: 45 [2022-07-19 10:30:16,365 INFO L226 Difference]: Without dead ends: 31 [2022-07-19 10:30:16,365 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-19 10:30:16,366 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 37 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:30:16,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 17 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:30:16,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-19 10:30:16,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2022-07-19 10:30:16,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:30:16,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-07-19 10:30:16,378 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 12 [2022-07-19 10:30:16,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:30:16,378 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-07-19 10:30:16,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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-19 10:30:16,380 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-07-19 10:30:16,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-19 10:30:16,382 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:30:16,382 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:30:16,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 10:30:16,383 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:30:16,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:30:16,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1992201947, now seen corresponding path program 1 times [2022-07-19 10:30:16,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:30:16,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957087407] [2022-07-19 10:30:16,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:30:16,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:30:16,412 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:30:16,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [89768162] [2022-07-19 10:30:16,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:30:16,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:30:16,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:30:16,419 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-19 10:30:16,421 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-19 10:30:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:30:16,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-19 10:30:16,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:30:16,568 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-19 10:30:16,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 10:30:16,671 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:30:16,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:30:16,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957087407] [2022-07-19 10:30:16,673 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 10:30:16,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89768162] [2022-07-19 10:30:16,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89768162] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:30:16,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:30:16,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 10:30:16,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836736907] [2022-07-19 10:30:16,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:30:16,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 10:30:16,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:30:16,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 10:30:16,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:30:16,676 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 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-19 10:30:16,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:30:16,758 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-07-19 10:30:16,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 10:30:16,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-07-19 10:30:16,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:30:16,762 INFO L225 Difference]: With dead ends: 40 [2022-07-19 10:30:16,762 INFO L226 Difference]: Without dead ends: 38 [2022-07-19 10:30:16,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-19 10:30:16,764 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 16 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:30:16,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 62 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:30:16,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-19 10:30:16,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2022-07-19 10:30:16,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:30:16,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-07-19 10:30:16,783 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 18 [2022-07-19 10:30:16,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:30:16,783 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-07-19 10:30:16,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 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-19 10:30:16,784 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-07-19 10:30:16,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-19 10:30:16,785 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:30:16,785 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:30:16,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-19 10:30:16,986 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-19 10:30:16,986 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:30:16,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:30:16,987 INFO L85 PathProgramCache]: Analyzing trace with hash 259417010, now seen corresponding path program 1 times [2022-07-19 10:30:16,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:30:16,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018265367] [2022-07-19 10:30:16,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:30:16,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:30:17,019 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:30:17,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [578651480] [2022-07-19 10:30:17,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:30:17,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:30:17,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:30:17,026 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-19 10:30:17,031 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-19 10:30:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:30:17,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 10:30:17,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:30:17,164 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:30:17,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:30:17,197 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:30:17,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:30:17,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018265367] [2022-07-19 10:30:17,199 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 10:30:17,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578651480] [2022-07-19 10:30:17,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578651480] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:30:17,203 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:30:17,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-07-19 10:30:17,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999327305] [2022-07-19 10:30:17,203 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:30:17,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 10:30:17,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:30:17,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 10:30:17,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-19 10:30:17,205 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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-19 10:30:17,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:30:17,351 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2022-07-19 10:30:17,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 10:30:17,353 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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) Word has length 21 [2022-07-19 10:30:17,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:30:17,354 INFO L225 Difference]: With dead ends: 70 [2022-07-19 10:30:17,354 INFO L226 Difference]: Without dead ends: 43 [2022-07-19 10:30:17,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-07-19 10:30:17,358 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 35 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:30:17,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 44 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:30:17,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-19 10:30:17,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 27. [2022-07-19 10:30:17,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:30:17,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-07-19 10:30:17,370 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 21 [2022-07-19 10:30:17,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:30:17,371 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-19 10:30:17,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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-19 10:30:17,371 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-07-19 10:30:17,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-19 10:30:17,372 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:30:17,372 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:30:17,404 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-19 10:30:17,590 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-19 10:30:17,591 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:30:17,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:30:17,592 INFO L85 PathProgramCache]: Analyzing trace with hash 939318754, now seen corresponding path program 1 times [2022-07-19 10:30:17,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:30:17,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777397664] [2022-07-19 10:30:17,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:30:17,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:30:17,636 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:30:17,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1203716805] [2022-07-19 10:30:17,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:30:17,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:30:17,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:30:17,640 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-19 10:30:17,666 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-19 10:30:17,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:30:17,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-19 10:30:17,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:30:17,739 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-19 10:30:17,784 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-19 10:30:17,784 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 21 treesize of output 20 [2022-07-19 10:30:17,818 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 10:30:17,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:30:17,993 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 21 treesize of output 19 [2022-07-19 10:30:18,015 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 10:30:18,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:30:18,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777397664] [2022-07-19 10:30:18,016 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 10:30:18,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203716805] [2022-07-19 10:30:18,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203716805] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:30:18,016 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:30:18,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2022-07-19 10:30:18,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316111876] [2022-07-19 10:30:18,017 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:30:18,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 10:30:18,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:30:18,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 10:30:18,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:30:18,018 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 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-19 10:30:18,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:30:18,161 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2022-07-19 10:30:18,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 10:30:18,162 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 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 24 [2022-07-19 10:30:18,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:30:18,163 INFO L225 Difference]: With dead ends: 73 [2022-07-19 10:30:18,163 INFO L226 Difference]: Without dead ends: 61 [2022-07-19 10:30:18,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-07-19 10:30:18,164 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 34 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:30:18,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 71 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 80 Invalid, 0 Unknown, 39 Unchecked, 0.1s Time] [2022-07-19 10:30:18,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-19 10:30:18,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 38. [2022-07-19 10:30:18,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:30:18,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2022-07-19 10:30:18,171 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 24 [2022-07-19 10:30:18,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:30:18,171 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2022-07-19 10:30:18,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 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-19 10:30:18,171 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-07-19 10:30:18,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-19 10:30:18,172 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:30:18,172 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:30:18,190 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-19 10:30:18,379 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-19 10:30:18,380 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:30:18,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:30:18,380 INFO L85 PathProgramCache]: Analyzing trace with hash 430403928, now seen corresponding path program 1 times [2022-07-19 10:30:18,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:30:18,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169050170] [2022-07-19 10:30:18,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:30:18,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:30:18,420 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:30:18,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1525620748] [2022-07-19 10:30:18,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:30:18,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:30:18,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:30:18,430 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-19 10:30:18,432 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-19 10:30:18,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:30:18,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-19 10:30:18,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:30:18,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-19 10:30:18,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 10:30:18,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:30:18,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-19 10:30:18,697 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 19 treesize of output 18 [2022-07-19 10:30:18,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:30:18,764 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 10:30:18,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 32 [2022-07-19 10:30:18,962 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 10:30:18,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 38 [2022-07-19 10:30:18,975 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:30:18,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:30:19,660 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:30:19,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:30:19,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169050170] [2022-07-19 10:30:19,661 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 10:30:19,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525620748] [2022-07-19 10:30:19,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525620748] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:30:19,662 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:30:19,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2022-07-19 10:30:19,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105512703] [2022-07-19 10:30:19,662 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:30:19,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-19 10:30:19,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:30:19,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-19 10:30:19,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2022-07-19 10:30:19,664 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 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-19 10:31:12,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:31:12,365 INFO L93 Difference]: Finished difference Result 124 states and 151 transitions. [2022-07-19 10:31:12,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-19 10:31:12,366 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 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 28 [2022-07-19 10:31:12,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:31:12,368 INFO L225 Difference]: With dead ends: 124 [2022-07-19 10:31:12,368 INFO L226 Difference]: Without dead ends: 93 [2022-07-19 10:31:12,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 52.7s TimeCoverageRelationStatistics Valid=248, Invalid=1080, Unknown=4, NotChecked=0, Total=1332 [2022-07-19 10:31:12,369 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 29 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 10:31:12,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 76 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 221 Invalid, 0 Unknown, 77 Unchecked, 0.5s Time] [2022-07-19 10:31:12,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-19 10:31:12,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 78. [2022-07-19 10:31:12,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.2337662337662338) internal successors, (95), 77 states have internal predecessors, (95), 0 states have call successors, (0), 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-19 10:31:12,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 95 transitions. [2022-07-19 10:31:12,381 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 95 transitions. Word has length 28 [2022-07-19 10:31:12,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:31:12,381 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 95 transitions. [2022-07-19 10:31:12,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 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-19 10:31:12,382 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2022-07-19 10:31:12,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-19 10:31:12,383 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:31:12,383 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:31:12,410 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-19 10:31:12,583 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-19 10:31:12,584 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:31:12,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:31:12,584 INFO L85 PathProgramCache]: Analyzing trace with hash -849177916, now seen corresponding path program 2 times [2022-07-19 10:31:12,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:31:12,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106942580] [2022-07-19 10:31:12,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:31:12,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:31:12,606 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:31:12,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2025598012] [2022-07-19 10:31:12,614 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:31:12,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:31:12,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:31:12,616 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-19 10:31:12,620 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-19 10:31:12,677 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 10:31:12,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:31:12,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 10:31:12,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:31:12,697 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 10:31:12,697 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:31:12,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:31:12,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106942580] [2022-07-19 10:31:12,698 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 10:31:12,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025598012] [2022-07-19 10:31:12,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025598012] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:31:12,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:31:12,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 10:31:12,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214306689] [2022-07-19 10:31:12,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:31:12,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 10:31:12,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:31:12,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 10:31:12,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:31:12,700 INFO L87 Difference]: Start difference. First operand 78 states and 95 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:31:12,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:31:12,759 INFO L93 Difference]: Finished difference Result 121 states and 145 transitions. [2022-07-19 10:31:12,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 10:31:12,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-19 10:31:12,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:31:12,760 INFO L225 Difference]: With dead ends: 121 [2022-07-19 10:31:12,760 INFO L226 Difference]: Without dead ends: 80 [2022-07-19 10:31:12,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:31:12,761 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 26 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:31:12,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 35 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:31:12,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-19 10:31:12,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 66. [2022-07-19 10:31:12,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.1538461538461537) internal successors, (75), 65 states have internal predecessors, (75), 0 states have call successors, (0), 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-19 10:31:12,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2022-07-19 10:31:12,771 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 30 [2022-07-19 10:31:12,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:31:12,771 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2022-07-19 10:31:12,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:31:12,771 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2022-07-19 10:31:12,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-19 10:31:12,772 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:31:12,772 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:31:12,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-19 10:31:12,995 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-19 10:31:12,996 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:31:12,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:31:12,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1242204926, now seen corresponding path program 3 times [2022-07-19 10:31:12,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:31:12,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059355869] [2022-07-19 10:31:12,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:31:12,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:31:13,032 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:31:13,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [882613711] [2022-07-19 10:31:13,034 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 10:31:13,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:31:13,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:31:13,036 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-19 10:31:13,061 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-19 10:31:13,139 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-19 10:31:13,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:31:13,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-19 10:31:13,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:31:13,278 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 10:31:13,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:31:13,438 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 10:31:13,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:31:13,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059355869] [2022-07-19 10:31:13,439 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 10:31:13,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882613711] [2022-07-19 10:31:13,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882613711] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:31:13,439 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:31:13,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2022-07-19 10:31:13,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570309926] [2022-07-19 10:31:13,440 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:31:13,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-19 10:31:13,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:31:13,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-19 10:31:13,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-07-19 10:31:13,441 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 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-19 10:31:13,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:31:13,721 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2022-07-19 10:31:13,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-19 10:31:13,721 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 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-19 10:31:13,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:31:13,722 INFO L225 Difference]: With dead ends: 133 [2022-07-19 10:31:13,722 INFO L226 Difference]: Without dead ends: 113 [2022-07-19 10:31:13,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2022-07-19 10:31:13,723 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 251 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:31:13,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 103 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:31:13,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-19 10:31:13,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 63. [2022-07-19 10:31:13,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.1290322580645162) internal successors, (70), 62 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-19 10:31:13,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2022-07-19 10:31:13,732 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 30 [2022-07-19 10:31:13,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:31:13,733 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2022-07-19 10:31:13,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 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-19 10:31:13,733 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2022-07-19 10:31:13,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-19 10:31:13,734 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:31:13,734 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:31:13,764 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-19 10:31:13,955 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-19 10:31:13,956 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:31:13,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:31:13,956 INFO L85 PathProgramCache]: Analyzing trace with hash 877615566, now seen corresponding path program 2 times [2022-07-19 10:31:13,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:31:13,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375163643] [2022-07-19 10:31:13,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:31:13,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:31:13,975 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:31:13,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [291125660] [2022-07-19 10:31:13,988 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:31:13,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:31:13,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:31:13,989 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-19 10:31:14,019 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-19 10:31:14,052 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 10:31:14,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:31:14,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 10:31:14,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:31:14,137 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 10:31:14,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:31:14,186 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 10:31:14,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:31:14,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375163643] [2022-07-19 10:31:14,187 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 10:31:14,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291125660] [2022-07-19 10:31:14,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291125660] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:31:14,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:31:14,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-07-19 10:31:14,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880481511] [2022-07-19 10:31:14,188 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:31:14,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 10:31:14,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:31:14,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 10:31:14,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-07-19 10:31:14,190 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 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-19 10:31:14,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:31:14,346 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2022-07-19 10:31:14,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 10:31:14,346 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 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-19 10:31:14,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:31:14,347 INFO L225 Difference]: With dead ends: 102 [2022-07-19 10:31:14,347 INFO L226 Difference]: Without dead ends: 77 [2022-07-19 10:31:14,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 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-19 10:31:14,348 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 70 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:31:14,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 66 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:31:14,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-19 10:31:14,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 57. [2022-07-19 10:31:14,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:31:14,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-07-19 10:31:14,355 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 32 [2022-07-19 10:31:14,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:31:14,356 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-07-19 10:31:14,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 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-19 10:31:14,356 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-07-19 10:31:14,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-19 10:31:14,357 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:31:14,357 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:31:14,383 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-19 10:31:14,571 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-19 10:31:14,572 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:31:14,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:31:14,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1847758638, now seen corresponding path program 4 times [2022-07-19 10:31:14,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:31:14,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365223971] [2022-07-19 10:31:14,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:31:14,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:31:14,596 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:31:14,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [557985908] [2022-07-19 10:31:14,605 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 10:31:14,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:31:14,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:31:14,607 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-19 10:31:14,608 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-19 10:31:14,649 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 10:31:14,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:31:14,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 10:31:14,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:31:14,740 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:31:14,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:31:14,803 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:31:14,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:31:14,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365223971] [2022-07-19 10:31:14,804 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 10:31:14,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557985908] [2022-07-19 10:31:14,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557985908] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:31:14,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:31:14,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2022-07-19 10:31:14,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617755430] [2022-07-19 10:31:14,804 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:31:14,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-19 10:31:14,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:31:14,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-19 10:31:14,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-07-19 10:31:14,805 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 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-19 10:31:15,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:31:15,015 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2022-07-19 10:31:15,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 10:31:15,015 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 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 33 [2022-07-19 10:31:15,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:31:15,016 INFO L225 Difference]: With dead ends: 116 [2022-07-19 10:31:15,016 INFO L226 Difference]: Without dead ends: 103 [2022-07-19 10:31:15,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-07-19 10:31:15,017 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 129 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:31:15,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 115 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:31:15,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-19 10:31:15,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 64. [2022-07-19 10:31:15,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 63 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-19 10:31:15,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-07-19 10:31:15,031 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 33 [2022-07-19 10:31:15,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:31:15,032 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-07-19 10:31:15,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 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-19 10:31:15,032 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-07-19 10:31:15,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-19 10:31:15,035 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:31:15,035 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:31:15,060 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-19 10:31:15,255 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-19 10:31:15,255 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:31:15,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:31:15,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1646708229, now seen corresponding path program 3 times [2022-07-19 10:31:15,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:31:15,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270748918] [2022-07-19 10:31:15,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:31:15,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:31:15,274 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:31:15,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [838252284] [2022-07-19 10:31:15,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 10:31:15,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:31:15,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:31:15,276 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-19 10:31:15,305 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-19 10:31:15,518 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-19 10:31:15,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:31:15,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-19 10:31:15,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:31:15,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-19 10:31:15,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 10:31:15,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:15,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-07-19 10:31:15,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:15,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-07-19 10:31:15,951 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 19 treesize of output 18 [2022-07-19 10:31:16,050 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-19 10:31:16,051 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 139 treesize of output 127 [2022-07-19 10:31:16,055 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:31:16,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:16,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:16,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:16,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:16,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:16,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:16,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 194 [2022-07-19 10:31:16,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:16,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:16,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:16,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:16,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:16,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:16,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 99 [2022-07-19 10:31:16,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:16,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:16,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:16,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:16,244 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:31:16,244 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:31:16,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:16,248 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-07-19 10:31:16,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 75 [2022-07-19 10:31:16,509 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 10:31:16,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 32 [2022-07-19 10:31:16,524 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:31:16,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:31:18,248 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:31:18,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:31:18,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270748918] [2022-07-19 10:31:18,248 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 10:31:18,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838252284] [2022-07-19 10:31:18,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838252284] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:31:18,248 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:31:18,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 40 [2022-07-19 10:31:18,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131949967] [2022-07-19 10:31:18,249 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:31:18,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-19 10:31:18,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:31:18,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-19 10:31:18,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=1246, Unknown=0, NotChecked=0, Total=1560 [2022-07-19 10:31:18,250 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 40 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:31:19,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:31:19,352 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2022-07-19 10:31:19,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-19 10:31:19,353 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-19 10:31:19,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:31:19,354 INFO L225 Difference]: With dead ends: 97 [2022-07-19 10:31:19,354 INFO L226 Difference]: Without dead ends: 95 [2022-07-19 10:31:19,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 23 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1005 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=528, Invalid=2228, Unknown=0, NotChecked=0, Total=2756 [2022-07-19 10:31:19,356 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 42 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 276 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:31:19,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 93 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 172 Invalid, 0 Unknown, 276 Unchecked, 0.2s Time] [2022-07-19 10:31:19,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-19 10:31:19,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 86. [2022-07-19 10:31:19,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.1294117647058823) internal successors, (96), 85 states have internal predecessors, (96), 0 states have call successors, (0), 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-19 10:31:19,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2022-07-19 10:31:19,374 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 34 [2022-07-19 10:31:19,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:31:19,375 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2022-07-19 10:31:19,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:31:19,375 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2022-07-19 10:31:19,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-19 10:31:19,380 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:31:19,380 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:31:19,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-19 10:31:19,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:31:19,585 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:31:19,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:31:19,586 INFO L85 PathProgramCache]: Analyzing trace with hash -653025448, now seen corresponding path program 4 times [2022-07-19 10:31:19,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:31:19,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123368528] [2022-07-19 10:31:19,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:31:19,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:31:19,611 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:31:19,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [642966350] [2022-07-19 10:31:19,627 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 10:31:19,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:31:19,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:31:19,632 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:31:19,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-19 10:31:19,689 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 10:31:19,689 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:31:19,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 10:31:19,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:31:19,766 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 10:31:19,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:31:19,823 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 10:31:19,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:31:19,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123368528] [2022-07-19 10:31:19,823 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 10:31:19,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642966350] [2022-07-19 10:31:19,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642966350] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:31:19,823 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:31:19,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2022-07-19 10:31:19,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141386621] [2022-07-19 10:31:19,824 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:31:19,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-19 10:31:19,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:31:19,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-19 10:31:19,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2022-07-19 10:31:19,825 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 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-19 10:31:20,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:31:20,104 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2022-07-19 10:31:20,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 10:31:20,105 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 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 34 [2022-07-19 10:31:20,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:31:20,105 INFO L225 Difference]: With dead ends: 120 [2022-07-19 10:31:20,105 INFO L226 Difference]: Without dead ends: 99 [2022-07-19 10:31:20,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2022-07-19 10:31:20,106 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 156 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:31:20,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 111 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:31:20,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-19 10:31:20,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 61. [2022-07-19 10:31:20,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 0 states have call successors, (0), 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-19 10:31:20,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2022-07-19 10:31:20,115 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 34 [2022-07-19 10:31:20,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:31:20,115 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2022-07-19 10:31:20,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 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-19 10:31:20,116 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2022-07-19 10:31:20,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-19 10:31:20,116 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:31:20,116 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:31:20,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-19 10:31:20,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-19 10:31:20,335 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:31:20,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:31:20,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1259217666, now seen corresponding path program 5 times [2022-07-19 10:31:20,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:31:20,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234391247] [2022-07-19 10:31:20,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:31:20,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:31:20,361 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:31:20,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1705010267] [2022-07-19 10:31:20,361 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-19 10:31:20,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:31:20,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:31:20,363 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:31:20,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-19 10:31:21,595 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-19 10:31:21,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:31:21,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-19 10:31:21,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:31:21,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-19 10:31:21,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 10:31:21,700 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 110 treesize of output 99 [2022-07-19 10:31:21,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:21,704 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:31:21,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:21,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:21,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:21,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:21,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:21,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 172 [2022-07-19 10:31:21,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:21,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:21,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:21,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 47 [2022-07-19 10:31:21,834 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 125 treesize of output 110 [2022-07-19 10:31:21,839 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:31:21,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:21,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:21,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:21,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:21,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:21,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:21,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:21,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:21,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:21,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:21,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 187 [2022-07-19 10:31:21,860 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-19 10:31:21,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:21,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:21,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:21,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:21,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:21,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:21,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 48 [2022-07-19 10:31:22,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:22,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:22,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:22,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 46 [2022-07-19 10:31:22,172 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-19 10:31:22,173 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 174 treesize of output 154 [2022-07-19 10:31:22,182 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:31:22,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:22,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:22,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:22,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:22,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:22,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:22,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 197 [2022-07-19 10:31:22,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:22,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:22,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:22,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 59 [2022-07-19 10:31:22,373 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-19 10:31:22,374 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 180 treesize of output 156 [2022-07-19 10:31:22,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:22,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:22,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:22,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:22,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:22,385 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:31:22,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:22,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:22,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:22,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:22,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:22,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:22,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 213 [2022-07-19 10:31:22,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:22,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:22,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:22,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:22,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:22,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:22,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:22,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:22,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:22,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:22,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 114 [2022-07-19 10:31:22,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:22,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:22,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:22,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:22,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:22,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:22,568 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:31:22,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:22,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:22,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:31:22,571 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:31:22,575 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-19 10:31:22,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 90 treesize of output 82 [2022-07-19 10:31:22,693 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:31:22,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:31:52,504 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-19 10:31:52,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:31:52,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234391247] [2022-07-19 10:31:52,505 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 10:31:52,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705010267] [2022-07-19 10:31:52,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705010267] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:31:52,505 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:31:52,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11] total 27 [2022-07-19 10:31:52,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091799644] [2022-07-19 10:31:52,506 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:31:52,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-19 10:31:52,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:31:52,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-19 10:31:52,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=555, Unknown=5, NotChecked=0, Total=702 [2022-07-19 10:31:52,507 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 27 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-19 10:31:59,487 WARN L233 SmtUtils]: Spent 5.50s on a formula simplification that was a NOOP. DAG size: 115 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 10:32:04,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:32:04,052 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2022-07-19 10:32:04,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-19 10:32:04,052 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 27 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 36 [2022-07-19 10:32:04,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:32:04,053 INFO L225 Difference]: With dead ends: 97 [2022-07-19 10:32:04,053 INFO L226 Difference]: Without dead ends: 95 [2022-07-19 10:32:04,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 35.7s TimeCoverageRelationStatistics Valid=199, Invalid=852, Unknown=5, NotChecked=0, Total=1056 [2022-07-19 10:32:04,054 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 33 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 166 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:32:04,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 68 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 131 Invalid, 0 Unknown, 166 Unchecked, 0.1s Time] [2022-07-19 10:32:04,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-19 10:32:04,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2022-07-19 10:32:04,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.0930232558139534) internal successors, (94), 86 states have internal predecessors, (94), 0 states have call successors, (0), 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-19 10:32:04,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2022-07-19 10:32:04,067 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 36 [2022-07-19 10:32:04,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:32:04,068 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2022-07-19 10:32:04,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 27 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-19 10:32:04,068 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2022-07-19 10:32:04,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-19 10:32:04,069 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:32:04,069 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:32:04,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-19 10:32:04,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-19 10:32:04,275 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:32:04,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:32:04,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1129715953, now seen corresponding path program 5 times [2022-07-19 10:32:04,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:32:04,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362489900] [2022-07-19 10:32:04,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:32:04,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:32:04,290 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:32:04,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [85918023] [2022-07-19 10:32:04,291 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-19 10:32:04,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:32:04,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:32:04,293 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:32:04,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-19 10:32:04,780 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-19 10:32:04,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:32:04,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-19 10:32:04,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:32:04,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-19 10:32:04,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 10:32:04,834 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 110 treesize of output 99 [2022-07-19 10:32:04,878 INFO L356 Elim1Store]: treesize reduction 354, result has 8.5 percent of original size [2022-07-19 10:32:04,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 98 treesize of output 150 [2022-07-19 10:32:04,896 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-19 10:32:04,957 INFO L356 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2022-07-19 10:32:04,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 34 [2022-07-19 10:32:04,995 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-19 10:32:04,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-07-19 10:32:05,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 137 [2022-07-19 10:32:05,100 INFO L356 Elim1Store]: treesize reduction 354, result has 8.5 percent of original size [2022-07-19 10:32:05,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 123 treesize of output 175 [2022-07-19 10:32:05,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:32:05,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:32:05,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:32:05,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 89 [2022-07-19 10:32:05,227 INFO L356 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2022-07-19 10:32:05,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 58 [2022-07-19 10:32:05,501 INFO L356 Elim1Store]: treesize reduction 42, result has 2.3 percent of original size [2022-07-19 10:32:05,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 82 treesize of output 36 [2022-07-19 10:32:05,517 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:32:05,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:32:19,480 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (<= (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647))) (and (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~b~0#1.base| .cse2) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse0 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))) 31)) .cse3) (or (not .cse3) (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse6 (store (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~b~0#1.base| .cse6) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse6 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse4 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))))))))) is different from false [2022-07-19 10:32:21,546 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (<= (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647))) (and (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse2 (select (select (store .cse0 |c_ULTIMATE.start_main_~b~0#1.base| .cse1) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse1 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse2 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse2 1)))) 31)) (not .cse3)) (or .cse3 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse6 (store (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~b~0#1.base| .cse6) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse6 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse4 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))))))))) is different from false [2022-07-19 10:32:23,796 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (<= (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (.cse16 (<= (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647))) (let ((.cse1 (not .cse16)) (.cse15 (not .cse6)) (.cse0 (<= (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2147483647))) (and (or .cse0 (and (or .cse1 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select .cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368) (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)))) 10))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse4 (store (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| .cse4) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse4 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse2 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))) 31))) (or (and (or .cse6 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse10 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ (select .cse10 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368) (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)))) 10))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse9 (store (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~b~0#1.base| .cse9) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse9 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse7 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))) 31))) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse14 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ (select .cse14 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368) (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)))) 10))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse13 (store (select .cse12 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~b~0#1.base| .cse13) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse13 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse11 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))) 31)) .cse15)) .cse16))) (or (and (or .cse1 (and (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse20 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse20 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 10 (select .cse20 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))))))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse18 (store (select .cse17 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse19 (select (select (store .cse17 |c_ULTIMATE.start_main_~b~0#1.base| .cse18) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse17 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse18 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse19 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse19 1)))))) .cse15) (or .cse6 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse24 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse24 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 10 (select .cse24 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))))))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse23 (store (select .cse22 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse21 (select (select (store .cse22 |c_ULTIMATE.start_main_~b~0#1.base| .cse23) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse21 (select (select (store .cse22 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse23 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse21 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))))))))) (or .cse16 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse28 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse28 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ 10 (select .cse28 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))))))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse26 (store (select .cse25 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse27 (select (select (store .cse25 |c_ULTIMATE.start_main_~b~0#1.base| .cse26) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse25 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse26 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse27 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse27 1)))))))) (not .cse0))))) is different from false [2022-07-19 10:32:25,812 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse6 (<= (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (.cse16 (<= (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647))) (let ((.cse1 (not .cse16)) (.cse15 (not .cse6)) (.cse0 (<= (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2147483647))) (and (or .cse0 (and (or .cse1 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select .cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368) (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)))) 10))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse4 (store (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| .cse4) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse4 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse2 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))) 31))) (or (and (or .cse6 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse10 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ (select .cse10 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368) (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)))) 10))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse9 (store (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~b~0#1.base| .cse9) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse9 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse7 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))) 31))) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse14 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ (select .cse14 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368) (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)))) 10))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse13 (store (select .cse12 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~b~0#1.base| .cse13) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse13 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse11 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))) 31)) .cse15)) .cse16))) (or (and (or .cse1 (and (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse20 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse20 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 10 (select .cse20 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))))))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse18 (store (select .cse17 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse19 (select (select (store .cse17 |c_ULTIMATE.start_main_~b~0#1.base| .cse18) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse17 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse18 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse19 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse19 1)))))) .cse15) (or .cse6 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse24 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse24 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 10 (select .cse24 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))))))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse23 (store (select .cse22 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse21 (select (select (store .cse22 |c_ULTIMATE.start_main_~b~0#1.base| .cse23) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse21 (select (select (store .cse22 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse23 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse21 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))))))))) (or .cse16 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse28 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse28 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ 10 (select .cse28 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))))))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse26 (store (select .cse25 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse27 (select (select (store .cse25 |c_ULTIMATE.start_main_~b~0#1.base| .cse26) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse25 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse26 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse27 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse27 1)))))))) (not .cse0))))) is different from true [2022-07-19 10:32:28,139 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (<= (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (.cse15 (<= (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2147483647))) (let ((.cse6 (not .cse15)) (.cse16 (not .cse1)) (.cse0 (<= (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647))) (and (or (not .cse0) (and (or .cse1 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ 10 (select .cse5 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse3 (store (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_~b~0#1.base| .cse3) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse3 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse4 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse4 1)))) 31))) (or (and (or .cse6 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse10 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 10 (select .cse10 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse9 (store (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~b~0#1.base| .cse9) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse9 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse7 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))))))) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse14 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 10 (select .cse14 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse12 (store (select .cse11 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse13 (select (select (store .cse11 |c_ULTIMATE.start_main_~b~0#1.base| .cse12) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse11 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse12 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse13 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse13 1)))))) .cse15)) .cse16))) (or (and (or .cse1 (and (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse20 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse20 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ (select .cse20 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) 10))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse18 (store (select .cse17 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse19 (select (select (store .cse17 |c_ULTIMATE.start_main_~b~0#1.base| .cse18) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse17 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse18 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse19 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse19 1)))))) .cse15) (or .cse6 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse24 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse24 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ (select .cse24 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) 10))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse23 (store (select .cse22 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse21 (select (select (store .cse22 |c_ULTIMATE.start_main_~b~0#1.base| .cse23) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse21 (select (select (store .cse22 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse23 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse21 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))))))))) (or .cse16 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse28 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse28 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select .cse28 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) 10))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse27 (store (select .cse26 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse25 (select (select (store .cse26 |c_ULTIMATE.start_main_~b~0#1.base| .cse27) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse25 (select (select (store .cse26 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse27 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse25 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))) 31)))) .cse0)))) is different from false [2022-07-19 10:32:30,150 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (<= (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (.cse15 (<= (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2147483647))) (let ((.cse6 (not .cse15)) (.cse16 (not .cse1)) (.cse0 (<= (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647))) (and (or (not .cse0) (and (or .cse1 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ 10 (select .cse5 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse3 (store (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_~b~0#1.base| .cse3) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse3 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse4 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse4 1)))) 31))) (or (and (or .cse6 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse10 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 10 (select .cse10 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse9 (store (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~b~0#1.base| .cse9) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse9 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse7 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))))))) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse14 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 10 (select .cse14 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse12 (store (select .cse11 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse13 (select (select (store .cse11 |c_ULTIMATE.start_main_~b~0#1.base| .cse12) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse11 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse12 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse13 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse13 1)))))) .cse15)) .cse16))) (or (and (or .cse1 (and (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse20 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse20 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ (select .cse20 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) 10))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse18 (store (select .cse17 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse19 (select (select (store .cse17 |c_ULTIMATE.start_main_~b~0#1.base| .cse18) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse17 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse18 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse19 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse19 1)))))) .cse15) (or .cse6 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse24 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse24 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ (select .cse24 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) 10))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse23 (store (select .cse22 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse21 (select (select (store .cse22 |c_ULTIMATE.start_main_~b~0#1.base| .cse23) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse21 (select (select (store .cse22 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse23 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse21 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))))))))) (or .cse16 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse28 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse28 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select .cse28 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) 10))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse27 (store (select .cse26 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse25 (select (select (store .cse26 |c_ULTIMATE.start_main_~b~0#1.base| .cse27) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse25 (select (select (store .cse26 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse27 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse25 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))) 31)))) .cse0)))) is different from true [2022-07-19 10:32:30,203 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 20 refuted. 1 times theorem prover too weak. 0 trivial. 11 not checked. [2022-07-19 10:32:30,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:32:30,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362489900] [2022-07-19 10:32:30,204 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 10:32:30,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85918023] [2022-07-19 10:32:30,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85918023] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:32:30,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:32:30,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2022-07-19 10:32:30,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576337047] [2022-07-19 10:32:30,205 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:32:30,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-19 10:32:30,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:32:30,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-19 10:32:30,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=537, Unknown=14, NotChecked=204, Total=870 [2022-07-19 10:32:30,206 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 30 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 30 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:32:32,259 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (<= (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (.cse15 (<= (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2147483647))) (let ((.cse6 (not .cse15)) (.cse16 (not .cse1)) (.cse0 (<= (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647))) (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (or (not .cse0) (and (or .cse1 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ 10 (select .cse5 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse3 (store (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_~b~0#1.base| .cse3) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse3 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse4 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse4 1)))) 31))) (or (and (or .cse6 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse10 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 10 (select .cse10 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse9 (store (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~b~0#1.base| .cse9) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse9 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse7 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))))))) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse14 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 10 (select .cse14 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse12 (store (select .cse11 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse13 (select (select (store .cse11 |c_ULTIMATE.start_main_~b~0#1.base| .cse12) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse11 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse12 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse13 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse13 1)))))) .cse15)) .cse16))) (= 10 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (or (and (or .cse1 (and (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse20 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse20 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ (select .cse20 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) 10))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse18 (store (select .cse17 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse19 (select (select (store .cse17 |c_ULTIMATE.start_main_~b~0#1.base| .cse18) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse17 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse18 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse19 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse19 1)))))) .cse15) (or .cse6 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse24 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse24 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ (select .cse24 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) 10))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse23 (store (select .cse22 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse21 (select (select (store .cse22 |c_ULTIMATE.start_main_~b~0#1.base| .cse23) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse21 (select (select (store .cse22 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse23 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse21 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))))))))) (or .cse16 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse28 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse28 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select .cse28 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) 10))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse27 (store (select .cse26 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse25 (select (select (store .cse26 |c_ULTIMATE.start_main_~b~0#1.base| .cse27) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse25 (select (select (store .cse26 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse27 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse25 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))) 31)))) .cse0)))) is different from true [2022-07-19 10:32:34,276 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse6 (<= (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (.cse16 (<= (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647))) (let ((.cse1 (not .cse16)) (.cse15 (not .cse6)) (.cse0 (<= (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2147483647))) (and (or .cse0 (and (or .cse1 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select .cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368) (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)))) 10))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse4 (store (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| .cse4) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse4 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse2 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))) 31))) (or (and (or .cse6 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse10 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ (select .cse10 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368) (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)))) 10))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse9 (store (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~b~0#1.base| .cse9) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse9 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse7 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))) 31))) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse14 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ (select .cse14 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368) (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)))) 10))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse13 (store (select .cse12 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~b~0#1.base| .cse13) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse13 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse11 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))) 31)) .cse15)) .cse16))) (= 10 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (or (and (or .cse1 (and (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse20 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse20 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 10 (select .cse20 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))))))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse18 (store (select .cse17 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse19 (select (select (store .cse17 |c_ULTIMATE.start_main_~b~0#1.base| .cse18) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse17 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse18 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse19 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse19 1)))))) .cse15) (or .cse6 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse24 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse24 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 10 (select .cse24 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))))))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse23 (store (select .cse22 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse21 (select (select (store .cse22 |c_ULTIMATE.start_main_~b~0#1.base| .cse23) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse21 (select (select (store .cse22 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse23 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse21 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))))))))) (or .cse16 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse28 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse28 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ 10 (select .cse28 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))))))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse26 (store (select .cse25 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse27 (select (select (store .cse25 |c_ULTIMATE.start_main_~b~0#1.base| .cse26) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse25 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse26 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse27 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse27 1)))))))) (not .cse0)) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from true [2022-07-19 10:32:36,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:32:36,732 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2022-07-19 10:32:36,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-19 10:32:36,733 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 30 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-19 10:32:36,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:32:36,733 INFO L225 Difference]: With dead ends: 89 [2022-07-19 10:32:36,733 INFO L226 Difference]: Without dead ends: 65 [2022-07-19 10:32:36,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 30.2s TimeCoverageRelationStatistics Valid=164, Invalid=773, Unknown=17, NotChecked=378, Total=1332 [2022-07-19 10:32:36,735 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 19 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:32:36,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 129 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 164 Unchecked, 0.2s Time] [2022-07-19 10:32:36,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-19 10:32:36,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-07-19 10:32:36,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.109375) internal successors, (71), 64 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:32:36,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2022-07-19 10:32:36,742 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 38 [2022-07-19 10:32:36,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:32:36,742 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2022-07-19 10:32:36,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 30 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:32:36,743 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-07-19 10:32:36,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-19 10:32:36,743 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:32:36,743 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:32:36,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-19 10:32:36,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-19 10:32:36,944 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:32:36,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:32:36,944 INFO L85 PathProgramCache]: Analyzing trace with hash 173090424, now seen corresponding path program 6 times [2022-07-19 10:32:36,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:32:36,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083388891] [2022-07-19 10:32:36,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:32:36,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:32:36,960 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:32:36,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1416880419] [2022-07-19 10:32:36,961 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-19 10:32:36,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:32:36,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:32:36,962 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:32:36,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-19 10:32:37,541 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-07-19 10:32:37,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:32:37,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 57 conjunts are in the unsatisfiable core [2022-07-19 10:32:37,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:32:37,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-19 10:32:37,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 10:32:37,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:32:37,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-07-19 10:32:37,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:32:37,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-07-19 10:32:37,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:32:37,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-19 10:32:37,785 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 19 treesize of output 18 [2022-07-19 10:32:37,864 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-19 10:32:37,865 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 139 treesize of output 127 [2022-07-19 10:32:37,868 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:32:37,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:32:37,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:32:37,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:32:37,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:32:37,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:32:37,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:32:37,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 194 [2022-07-19 10:32:37,880 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-19 10:32:38,014 INFO L356 Elim1Store]: treesize reduction 32, result has 13.5 percent of original size [2022-07-19 10:32:38,014 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 102 treesize of output 94 [2022-07-19 10:32:38,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:32:38,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:32:38,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:32:38,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:32:38,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:32:38,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 62 [2022-07-19 10:32:38,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:32:38,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:32:38,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:32:38,085 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 10:32:38,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 44 [2022-07-19 10:32:38,213 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 10:32:38,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 32 [2022-07-19 10:32:38,231 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:32:38,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:33:11,970 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:33:11,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:33:11,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083388891] [2022-07-19 10:33:11,970 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 10:33:11,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416880419] [2022-07-19 10:33:11,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416880419] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:33:11,971 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:33:11,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21] total 34 [2022-07-19 10:33:11,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117498710] [2022-07-19 10:33:11,972 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:33:11,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-19 10:33:11,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:33:11,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-19 10:33:11,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=944, Unknown=0, NotChecked=0, Total=1122 [2022-07-19 10:33:11,973 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 34 states, 34 states have (on average 2.176470588235294) internal successors, (74), 34 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:33:13,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:33:13,743 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2022-07-19 10:33:13,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-19 10:33:13,744 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.176470588235294) internal successors, (74), 34 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-07-19 10:33:13,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:33:13,744 INFO L225 Difference]: With dead ends: 101 [2022-07-19 10:33:13,744 INFO L226 Difference]: Without dead ends: 99 [2022-07-19 10:33:13,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=268, Invalid=1454, Unknown=0, NotChecked=0, Total=1722 [2022-07-19 10:33:13,746 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 28 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 187 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:33:13,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 114 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 96 Invalid, 0 Unknown, 187 Unchecked, 0.1s Time] [2022-07-19 10:33:13,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-19 10:33:13,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 90. [2022-07-19 10:33:13,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.1123595505617978) internal successors, (99), 89 states have internal predecessors, (99), 0 states have call successors, (0), 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-19 10:33:13,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2022-07-19 10:33:13,757 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 40 [2022-07-19 10:33:13,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:33:13,758 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2022-07-19 10:33:13,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.176470588235294) internal successors, (74), 34 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:33:13,758 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2022-07-19 10:33:13,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-19 10:33:13,758 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:33:13,758 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:33:13,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-19 10:33:13,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-19 10:33:13,959 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:33:13,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:33:13,959 INFO L85 PathProgramCache]: Analyzing trace with hash -734671131, now seen corresponding path program 6 times [2022-07-19 10:33:13,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:33:13,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375814890] [2022-07-19 10:33:13,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:33:13,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:33:13,983 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:33:13,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [620722410] [2022-07-19 10:33:13,984 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-19 10:33:13,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:33:13,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:33:13,985 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:33:13,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-19 10:33:18,113 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-07-19 10:33:18,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:33:18,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-19 10:33:18,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:33:18,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 11 treesize of output 7 [2022-07-19 10:33:18,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:18,487 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-19 10:33:18,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:18,553 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-19 10:33:18,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:18,601 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-19 10:33:18,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:18,670 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-19 10:33:18,742 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:33:18,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:33:19,656 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 54 treesize of output 52 [2022-07-19 10:33:19,858 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-19 10:33:19,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:33:19,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375814890] [2022-07-19 10:33:19,858 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 10:33:19,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620722410] [2022-07-19 10:33:19,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620722410] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:33:19,858 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:33:19,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 17] total 38 [2022-07-19 10:33:19,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853705280] [2022-07-19 10:33:19,859 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:33:19,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-19 10:33:19,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:33:19,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-19 10:33:19,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=1133, Unknown=0, NotChecked=0, Total=1406 [2022-07-19 10:33:19,860 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 38 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 38 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-19 10:33:23,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:33:23,159 INFO L93 Difference]: Finished difference Result 156 states and 173 transitions. [2022-07-19 10:33:23,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-07-19 10:33:23,159 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 38 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 42 [2022-07-19 10:33:23,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:33:23,160 INFO L225 Difference]: With dead ends: 156 [2022-07-19 10:33:23,160 INFO L226 Difference]: Without dead ends: 154 [2022-07-19 10:33:23,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1787 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=843, Invalid=4559, Unknown=0, NotChecked=0, Total=5402 [2022-07-19 10:33:23,161 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 131 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 351 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 10:33:23,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 147 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 363 Invalid, 0 Unknown, 351 Unchecked, 0.4s Time] [2022-07-19 10:33:23,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-07-19 10:33:23,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 119. [2022-07-19 10:33:23,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.1355932203389831) internal successors, (134), 118 states have internal predecessors, (134), 0 states have call successors, (0), 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-19 10:33:23,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 134 transitions. [2022-07-19 10:33:23,184 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 134 transitions. Word has length 42 [2022-07-19 10:33:23,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:33:23,184 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 134 transitions. [2022-07-19 10:33:23,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 38 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-19 10:33:23,184 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 134 transitions. [2022-07-19 10:33:23,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-19 10:33:23,185 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:33:23,185 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:33:23,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-19 10:33:23,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:33:23,391 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:33:23,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:33:23,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1596358930, now seen corresponding path program 7 times [2022-07-19 10:33:23,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:33:23,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917271754] [2022-07-19 10:33:23,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:33:23,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:33:23,411 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:33:23,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [661938478] [2022-07-19 10:33:23,411 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-19 10:33:23,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:33:23,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:33:23,413 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:33:23,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-19 10:33:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:33:23,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-19 10:33:23,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:33:23,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-19 10:33:23,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 10:33:23,899 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 110 treesize of output 99 [2022-07-19 10:33:23,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:23,902 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:33:23,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:23,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:23,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:23,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:23,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:23,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 172 [2022-07-19 10:33:23,914 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-19 10:33:24,001 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 132 treesize of output 119 [2022-07-19 10:33:24,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:24,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:24,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:24,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:24,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:24,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2022-07-19 10:33:24,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:24,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:24,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:24,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-19 10:33:24,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:24,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-07-19 10:33:24,208 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-19 10:33:24,208 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 151 treesize of output 137 [2022-07-19 10:33:24,211 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:33:24,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:24,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:24,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:24,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:24,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:24,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:24,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 197 [2022-07-19 10:33:24,340 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-19 10:33:24,340 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 170 treesize of output 150 [2022-07-19 10:33:24,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:24,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:24,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:24,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:24,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:24,347 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:33:24,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:24,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:24,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:24,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:24,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:24,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:24,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 216 [2022-07-19 10:33:24,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:24,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:24,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:24,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:24,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:24,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:24,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 80 [2022-07-19 10:33:24,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:24,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:24,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:24,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:24,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:24,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:24,500 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:33:24,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:24,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:24,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:33:24,502 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:33:24,505 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-19 10:33:24,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 90 treesize of output 78 [2022-07-19 10:33:24,811 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:33:24,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:34:06,010 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 88241170 treesize of output 87340050