./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/res1o.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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/res1o.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 64693615f2d98484fbf4ccec390e9fe8d95f9d4648b0c6cc4a2e86f0656bfacf --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:12:36,236 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:12:36,237 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:12:36,270 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:12:36,272 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:12:36,272 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:12:36,275 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:12:36,279 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:12:36,280 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:12:36,283 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:12:36,284 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:12:36,286 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:12:36,286 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:12:36,287 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:12:36,298 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:12:36,300 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:12:36,300 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:12:36,302 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:12:36,304 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:12:36,308 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:12:36,309 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:12:36,309 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:12:36,310 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:12:36,310 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:12:36,311 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:12:36,315 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:12:36,315 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:12:36,315 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:12:36,316 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:12:36,316 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:12:36,316 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:12:36,317 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:12:36,318 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:12:36,318 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:12:36,319 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:12:36,320 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:12:36,320 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:12:36,321 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:12:36,321 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:12:36,321 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:12:36,322 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:12:36,323 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:12:36,324 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 11:12:36,344 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:12:36,345 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:12:36,345 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:12:36,345 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:12:36,346 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:12:36,346 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:12:36,346 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:12:36,346 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:12:36,346 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:12:36,347 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:12:36,347 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:12:36,347 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 11:12:36,347 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:12:36,347 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:12:36,347 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:12:36,347 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:12:36,347 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:12:36,348 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:12:36,348 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:12:36,348 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:12:36,348 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:12:36,348 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:12:36,348 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:12:36,348 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:12:36,349 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:12:36,349 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:12:36,349 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:12:36,349 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:12:36,349 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 11:12:36,349 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 11:12:36,349 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:12:36,350 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:12:36,350 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:12:36,350 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 -> 64693615f2d98484fbf4ccec390e9fe8d95f9d4648b0c6cc4a2e86f0656bfacf [2022-07-13 11:12:36,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:12:36,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:12:36,566 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:12:36,567 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:12:36,567 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:12:36,568 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/res1o.c [2022-07-13 11:12:36,626 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a08d1ac0/fbbf7c66b0f74b4eb9c7a34c8e402776/FLAG8d7e45952 [2022-07-13 11:12:36,913 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:12:36,914 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/res1o.c [2022-07-13 11:12:36,918 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a08d1ac0/fbbf7c66b0f74b4eb9c7a34c8e402776/FLAG8d7e45952 [2022-07-13 11:12:37,366 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a08d1ac0/fbbf7c66b0f74b4eb9c7a34c8e402776 [2022-07-13 11:12:37,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:12:37,369 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:12:37,371 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:12:37,371 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:12:37,374 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:12:37,374 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:12:37" (1/1) ... [2022-07-13 11:12:37,375 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@246a53c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:12:37, skipping insertion in model container [2022-07-13 11:12:37,376 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:12:37" (1/1) ... [2022-07-13 11:12:37,380 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:12:37,390 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:12:37,475 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/res1o.c[588,601] [2022-07-13 11:12:37,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:12:37,491 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:12:37,502 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/res1o.c[588,601] [2022-07-13 11:12:37,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:12:37,515 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:12:37,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:12:37 WrapperNode [2022-07-13 11:12:37,516 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:12:37,516 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:12:37,516 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:12:37,517 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:12:37,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:12:37" (1/1) ... [2022-07-13 11:12:37,536 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:12:37" (1/1) ... [2022-07-13 11:12:37,547 INFO L137 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 88 [2022-07-13 11:12:37,547 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:12:37,548 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:12:37,548 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:12:37,548 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:12:37,553 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:12:37" (1/1) ... [2022-07-13 11:12:37,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:12:37" (1/1) ... [2022-07-13 11:12:37,554 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:12:37" (1/1) ... [2022-07-13 11:12:37,555 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:12:37" (1/1) ... [2022-07-13 11:12:37,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:12:37" (1/1) ... [2022-07-13 11:12:37,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:12:37" (1/1) ... [2022-07-13 11:12:37,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:12:37" (1/1) ... [2022-07-13 11:12:37,581 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:12:37,582 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:12:37,582 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:12:37,582 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:12:37,583 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:12:37" (1/1) ... [2022-07-13 11:12:37,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:12:37,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:12:37,612 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-13 11:12:37,616 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-13 11:12:37,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:12:37,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 11:12:37,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 11:12:37,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 11:12:37,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 11:12:37,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:12:37,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:12:37,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 11:12:37,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 11:12:37,689 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:12:37,690 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:12:37,788 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:12:37,805 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:12:37,805 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-13 11:12:37,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:12:37 BoogieIcfgContainer [2022-07-13 11:12:37,807 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:12:37,816 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:12:37,816 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:12:37,818 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:12:37,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:12:37" (1/3) ... [2022-07-13 11:12:37,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ce18f17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:12:37, skipping insertion in model container [2022-07-13 11:12:37,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:12:37" (2/3) ... [2022-07-13 11:12:37,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ce18f17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:12:37, skipping insertion in model container [2022-07-13 11:12:37,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:12:37" (3/3) ... [2022-07-13 11:12:37,820 INFO L111 eAbstractionObserver]: Analyzing ICFG res1o.c [2022-07-13 11:12:37,829 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:12:37,829 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:12:37,860 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:12:37,865 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@554c748b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@35948e66 [2022-07-13 11:12:37,865 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:12:37,869 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:12:37,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-13 11:12:37,874 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:12:37,875 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:12:37,875 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:12:37,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:12:37,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1202110748, now seen corresponding path program 1 times [2022-07-13 11:12:37,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:12:37,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454882888] [2022-07-13 11:12:37,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:12:37,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:12:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:12:37,999 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-13 11:12:38,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:12:38,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454882888] [2022-07-13 11:12:38,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454882888] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:12:38,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:12:38,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 11:12:38,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531248219] [2022-07-13 11:12:38,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:12:38,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 11:12:38,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:12:38,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 11:12:38,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 11:12:38,040 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 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-13 11:12:38,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:12:38,052 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2022-07-13 11:12:38,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 11:12:38,054 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-07-13 11:12:38,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:12:38,059 INFO L225 Difference]: With dead ends: 44 [2022-07-13 11:12:38,059 INFO L226 Difference]: Without dead ends: 20 [2022-07-13 11:12:38,062 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-13 11:12:38,067 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-13 11:12:38,068 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-13 11:12:38,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-13 11:12:38,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-13 11:12:38,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:12:38,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-07-13 11:12:38,092 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 15 [2022-07-13 11:12:38,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:12:38,093 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-07-13 11:12:38,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 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-13 11:12:38,093 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-07-13 11:12:38,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-13 11:12:38,094 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:12:38,094 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:12:38,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 11:12:38,095 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:12:38,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:12:38,097 INFO L85 PathProgramCache]: Analyzing trace with hash -944124056, now seen corresponding path program 1 times [2022-07-13 11:12:38,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:12:38,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213314718] [2022-07-13 11:12:38,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:12:38,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:12:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:12:38,190 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-13 11:12:38,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:12:38,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213314718] [2022-07-13 11:12:38,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213314718] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:12:38,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:12:38,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:12:38,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162877619] [2022-07-13 11:12:38,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:12:38,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:12:38,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:12:38,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:12:38,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:12:38,194 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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-13 11:12:38,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:12:38,261 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-07-13 11:12:38,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:12:38,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-07-13 11:12:38,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:12:38,263 INFO L225 Difference]: With dead ends: 41 [2022-07-13 11:12:38,263 INFO L226 Difference]: Without dead ends: 28 [2022-07-13 11:12:38,263 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-13 11:12:38,265 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:12:38,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 12 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:12:38,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-13 11:12:38,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2022-07-13 11:12:38,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 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-13 11:12:38,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-07-13 11:12:38,275 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 15 [2022-07-13 11:12:38,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:12:38,276 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-07-13 11:12:38,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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-13 11:12:38,277 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-07-13 11:12:38,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-13 11:12:38,278 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:12:38,278 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:12:38,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 11:12:38,279 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:12:38,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:12:38,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1401448688, now seen corresponding path program 1 times [2022-07-13 11:12:38,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:12:38,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735980741] [2022-07-13 11:12:38,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:12:38,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:12:38,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:12:38,789 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:12:38,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:12:38,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735980741] [2022-07-13 11:12:38,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735980741] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:12:38,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533351629] [2022-07-13 11:12:38,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:12:38,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:12:38,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:12:38,796 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-13 11:12:38,801 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-13 11:12:38,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:12:38,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-13 11:12:38,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:12:38,948 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-13 11:12:38,975 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-13 11:12:39,031 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-13 11:12:39,168 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 39 treesize of output 26 [2022-07-13 11:12:39,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:39,309 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-13 11:12:39,309 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 1 case distinctions, treesize of input 30 treesize of output 32 [2022-07-13 11:12:39,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:39,402 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 39 treesize of output 26 [2022-07-13 11:12:39,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:39,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2022-07-13 11:12:39,491 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:12:39,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:12:40,305 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:40,306 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:40,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:12:40,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533351629] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:12:40,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:12:40,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 29 [2022-07-13 11:12:40,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806553973] [2022-07-13 11:12:40,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:12:40,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-13 11:12:40,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:12:40,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-13 11:12:40,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=656, Unknown=0, NotChecked=0, Total=812 [2022-07-13 11:12:40,317 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 29 states have internal predecessors, (57), 0 states have call successors, (0), 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-13 11:12:40,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:12:40,805 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-07-13 11:12:40,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-13 11:12:40,806 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 29 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-13 11:12:40,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:12:40,807 INFO L225 Difference]: With dead ends: 67 [2022-07-13 11:12:40,807 INFO L226 Difference]: Without dead ends: 62 [2022-07-13 11:12:40,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 30 SyntacticMatches, 8 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=324, Invalid=1398, Unknown=0, NotChecked=0, Total=1722 [2022-07-13 11:12:40,809 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 39 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 199 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:12:40,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 92 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 107 Invalid, 0 Unknown, 199 Unchecked, 0.1s Time] [2022-07-13 11:12:40,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-13 11:12:40,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 47. [2022-07-13 11:12:40,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 46 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:12:40,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2022-07-13 11:12:40,821 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 23 [2022-07-13 11:12:40,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:12:40,822 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2022-07-13 11:12:40,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 29 states have internal predecessors, (57), 0 states have call successors, (0), 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-13 11:12:40,822 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-07-13 11:12:40,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-13 11:12:40,823 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:12:40,823 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:12:40,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 11:12:41,039 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-13 11:12:41,039 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:12:41,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:12:41,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1774307726, now seen corresponding path program 2 times [2022-07-13 11:12:41,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:12:41,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669785370] [2022-07-13 11:12:41,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:12:41,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:12:41,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:12:41,112 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 11:12:41,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:12:41,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669785370] [2022-07-13 11:12:41,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669785370] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:12:41,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780548659] [2022-07-13 11:12:41,113 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:12:41,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:12:41,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:12:41,120 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-13 11:12:41,121 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-13 11:12:41,177 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:12:41,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:12:41,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 11:12:41,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:12:41,223 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 11:12:41,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:12:41,251 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 11:12:41,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780548659] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:12:41,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:12:41,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-13 11:12:41,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688562253] [2022-07-13 11:12:41,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:12:41,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 11:12:41,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:12:41,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 11:12:41,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:12:41,255 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:12:41,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:12:41,368 INFO L93 Difference]: Finished difference Result 93 states and 108 transitions. [2022-07-13 11:12:41,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 11:12:41,371 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-13 11:12:41,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:12:41,371 INFO L225 Difference]: With dead ends: 93 [2022-07-13 11:12:41,371 INFO L226 Difference]: Without dead ends: 58 [2022-07-13 11:12:41,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-13 11:12:41,373 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 60 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:12:41,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 33 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:12:41,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-13 11:12:41,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 44. [2022-07-13 11:12:41,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 43 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-13 11:12:41,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-07-13 11:12:41,382 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 25 [2022-07-13 11:12:41,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:12:41,382 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-07-13 11:12:41,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:12:41,382 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-07-13 11:12:41,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-13 11:12:41,383 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:12:41,383 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:12:41,401 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-13 11:12:41,583 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-13 11:12:41,584 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:12:41,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:12:41,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1964080588, now seen corresponding path program 3 times [2022-07-13 11:12:41,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:12:41,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212586432] [2022-07-13 11:12:41,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:12:41,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:12:41,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:12:41,636 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-13 11:12:41,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:12:41,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212586432] [2022-07-13 11:12:41,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212586432] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:12:41,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52891838] [2022-07-13 11:12:41,637 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 11:12:41,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:12:41,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:12:41,639 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-13 11:12:41,641 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-13 11:12:41,692 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-13 11:12:41,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:12:41,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 11:12:41,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:12:41,735 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 11:12:41,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:12:41,764 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 11:12:41,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52891838] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:12:41,765 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:12:41,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-13 11:12:41,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301172780] [2022-07-13 11:12:41,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:12:41,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 11:12:41,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:12:41,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 11:12:41,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:12:41,767 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:12:41,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:12:41,857 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2022-07-13 11:12:41,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 11:12:41,857 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-13 11:12:41,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:12:41,858 INFO L225 Difference]: With dead ends: 53 [2022-07-13 11:12:41,858 INFO L226 Difference]: Without dead ends: 41 [2022-07-13 11:12:41,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-13 11:12:41,859 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 50 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:12:41,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 24 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:12:41,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-07-13 11:12:41,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2022-07-13 11:12:41,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:12:41,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-07-13 11:12:41,862 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 27 [2022-07-13 11:12:41,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:12:41,862 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-07-13 11:12:41,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:12:41,862 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-07-13 11:12:41,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-13 11:12:41,863 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:12:41,863 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:12:41,882 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-13 11:12:42,079 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-13 11:12:42,080 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:12:42,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:12:42,080 INFO L85 PathProgramCache]: Analyzing trace with hash 666081912, now seen corresponding path program 4 times [2022-07-13 11:12:42,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:12:42,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152212951] [2022-07-13 11:12:42,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:12:42,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:12:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:12:42,950 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:12:42,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:12:42,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152212951] [2022-07-13 11:12:42,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152212951] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:12:42,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091884117] [2022-07-13 11:12:42,950 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 11:12:42,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:12:42,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:12:42,952 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-13 11:12:42,955 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-13 11:12:43,006 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 11:12:43,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:12:43,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 55 conjunts are in the unsatisfiable core [2022-07-13 11:12:43,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:12:43,023 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-13 11:12:43,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:43,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-13 11:12:43,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:43,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:43,155 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-13 11:12:43,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:43,305 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:43,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:43,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2022-07-13 11:12:43,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:43,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 36 [2022-07-13 11:12:43,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:43,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:43,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:43,567 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:43,575 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-13 11:12:43,576 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 1 case distinctions, treesize of input 47 treesize of output 48 [2022-07-13 11:12:43,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:43,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:43,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:43,771 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:43,780 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-07-13 11:12:43,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 67 [2022-07-13 11:12:43,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:43,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:43,981 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:43,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2022-07-13 11:12:44,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:44,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, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 38 [2022-07-13 11:12:44,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:44,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2022-07-13 11:12:44,195 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:12:44,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:13:36,654 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:13:36,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091884117] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:13:36,655 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:13:36,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19, 19] total 56 [2022-07-13 11:13:36,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423020694] [2022-07-13 11:13:36,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:13:36,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-07-13 11:13:36,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:13:36,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-07-13 11:13:36,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=2794, Unknown=20, NotChecked=0, Total=3080 [2022-07-13 11:13:36,658 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 56 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 56 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:13:51,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:13:51,347 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2022-07-13 11:13:51,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-13 11:13:51,347 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 56 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-13 11:13:51,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:13:51,348 INFO L225 Difference]: With dead ends: 83 [2022-07-13 11:13:51,348 INFO L226 Difference]: Without dead ends: 78 [2022-07-13 11:13:51,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2070 ImplicationChecksByTransitivity, 67.3s TimeCoverageRelationStatistics Valid=592, Invalid=5865, Unknown=23, NotChecked=0, Total=6480 [2022-07-13 11:13:51,351 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 21 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 389 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:13:51,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 157 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 282 Invalid, 0 Unknown, 389 Unchecked, 0.2s Time] [2022-07-13 11:13:51,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-13 11:13:51,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 65. [2022-07-13 11:13:51,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.171875) internal successors, (75), 64 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-13 11:13:51,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2022-07-13 11:13:51,360 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 31 [2022-07-13 11:13:51,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:13:51,361 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2022-07-13 11:13:51,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 56 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:13:51,361 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2022-07-13 11:13:51,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-13 11:13:51,362 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:13:51,362 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:13:51,378 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-13 11:13:51,563 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-13 11:13:51,563 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:13:51,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:13:51,564 INFO L85 PathProgramCache]: Analyzing trace with hash 207824378, now seen corresponding path program 5 times [2022-07-13 11:13:51,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:13:51,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342849022] [2022-07-13 11:13:51,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:13:51,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:13:51,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:13:51,640 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 11:13:51,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:13:51,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342849022] [2022-07-13 11:13:51,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342849022] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:13:51,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131241742] [2022-07-13 11:13:51,641 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 11:13:51,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:13:51,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:13:51,642 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-13 11:13:51,643 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-13 11:13:51,708 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-13 11:13:51,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:13:51,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 11:13:51,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:13:51,772 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 11:13:51,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:13:51,807 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 11:13:51,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131241742] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:13:51,808 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:13:51,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-13 11:13:51,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505825226] [2022-07-13 11:13:51,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:13:51,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 11:13:51,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:13:51,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 11:13:51,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-13 11:13:51,809 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:13:51,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:13:51,957 INFO L93 Difference]: Finished difference Result 121 states and 137 transitions. [2022-07-13 11:13:51,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 11:13:51,958 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-13 11:13:51,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:13:51,959 INFO L225 Difference]: With dead ends: 121 [2022-07-13 11:13:51,959 INFO L226 Difference]: Without dead ends: 72 [2022-07-13 11:13:51,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-07-13 11:13:51,963 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 94 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:13:51,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 32 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:13:51,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-13 11:13:51,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 58. [2022-07-13 11:13:51,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 57 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-13 11:13:51,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2022-07-13 11:13:51,972 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 33 [2022-07-13 11:13:51,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:13:51,973 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2022-07-13 11:13:51,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:13:51,973 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2022-07-13 11:13:51,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-13 11:13:51,974 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:13:51,974 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:13:51,996 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-13 11:13:52,187 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-13 11:13:52,188 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:13:52,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:13:52,188 INFO L85 PathProgramCache]: Analyzing trace with hash 236928956, now seen corresponding path program 6 times [2022-07-13 11:13:52,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:13:52,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432023915] [2022-07-13 11:13:52,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:13:52,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:13:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:13:52,290 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 11:13:52,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:13:52,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432023915] [2022-07-13 11:13:52,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432023915] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:13:52,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249988287] [2022-07-13 11:13:52,290 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-13 11:13:52,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:13:52,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:13:52,292 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-13 11:13:52,292 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-13 11:13:52,355 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-07-13 11:13:52,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:13:52,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 11:13:52,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:13:52,422 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 11:13:52,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:13:52,457 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 11:13:52,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249988287] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:13:52,458 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:13:52,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-13 11:13:52,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161184905] [2022-07-13 11:13:52,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:13:52,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 11:13:52,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:13:52,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 11:13:52,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-13 11:13:52,459 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:13:52,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:13:52,591 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2022-07-13 11:13:52,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 11:13:52,591 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-13 11:13:52,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:13:52,592 INFO L225 Difference]: With dead ends: 67 [2022-07-13 11:13:52,592 INFO L226 Difference]: Without dead ends: 51 [2022-07-13 11:13:52,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-07-13 11:13:52,593 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 67 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:13:52,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 22 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:13:52,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-13 11:13:52,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2022-07-13 11:13:52,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:13:52,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-07-13 11:13:52,598 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 35 [2022-07-13 11:13:52,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:13:52,598 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-07-13 11:13:52,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:13:52,598 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-07-13 11:13:52,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-13 11:13:52,599 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:13:52,599 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:13:52,617 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-13 11:13:52,811 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-13 11:13:52,811 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:13:52,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:13:52,812 INFO L85 PathProgramCache]: Analyzing trace with hash 315843584, now seen corresponding path program 7 times [2022-07-13 11:13:52,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:13:52,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104016219] [2022-07-13 11:13:52,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:13:52,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:13:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:13:54,364 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:13:54,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:13:54,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104016219] [2022-07-13 11:13:54,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104016219] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:13:54,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434044569] [2022-07-13 11:13:54,365 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-13 11:13:54,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:13:54,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:13:54,366 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-13 11:13:54,367 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-13 11:13:54,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:13:54,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 80 conjunts are in the unsatisfiable core [2022-07-13 11:13:54,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:13:54,438 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-13 11:13:54,442 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-13 11:13:54,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-13 11:13:54,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:54,587 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 30 treesize of output 32 [2022-07-13 11:13:54,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:54,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:54,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:54,698 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 37 treesize of output 42 [2022-07-13 11:13:54,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:54,861 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:13:54,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:54,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:54,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2022-07-13 11:13:55,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:55,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:55,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:55,021 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:13:55,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:55,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 57 [2022-07-13 11:13:55,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 48 [2022-07-13 11:13:55,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:55,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:55,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:55,357 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:13:55,368 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-13 11:13:55,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 59 [2022-07-13 11:13:55,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:55,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:55,632 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:13:55,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:55,633 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:13:55,642 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-07-13 11:13:55,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 95 treesize of output 86 [2022-07-13 11:13:55,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:55,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:55,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:55,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:55,932 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:13:55,933 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:13:55,943 INFO L356 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-07-13 11:13:55,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 92 treesize of output 90 [2022-07-13 11:13:56,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:56,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:56,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:56,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:56,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:56,353 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:13:56,354 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:13:56,354 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:13:56,359 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-13 11:13:56,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 110 treesize of output 96 [2022-07-13 11:13:56,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:56,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:56,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:56,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:56,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:56,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:56,562 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:13:56,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 54 [2022-07-13 11:13:56,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:56,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 49 [2022-07-13 11:13:56,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:56,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 20 [2022-07-13 11:13:56,865 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:13:56,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:16:48,440 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 31 refuted. 5 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:16:48,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434044569] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:16:48,441 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:16:48,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 27] total 80 [2022-07-13 11:16:48,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718618415] [2022-07-13 11:16:48,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:16:48,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-07-13 11:16:48,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:16:48,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-07-13 11:16:48,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=492, Invalid=5758, Unknown=70, NotChecked=0, Total=6320 [2022-07-13 11:16:48,443 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 80 states, 80 states have (on average 1.3) internal successors, (104), 80 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:16:53,751 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse28 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse18 (= .cse28 0)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 0) 1) (forall ((v_ArrVal_445 Int) (v_ArrVal_433 Int) (v_ArrVal_443 Int) (v_ArrVal_431 Int) (v_ArrVal_440 Int) (~N~0 Int) (v_ArrVal_428 Int) (v_ArrVal_438 Int) (v_ArrVal_437 Int) (v_ArrVal_447 Int) (v_ArrVal_435 Int)) (let ((.cse1 (let ((.cse9 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_428) (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_431)))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse1))) (let ((.cse5 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse6 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse2 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (let ((.cse8 (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_437)))) (store .cse8 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_438) .cse5 v_ArrVal_440) .cse6 v_ArrVal_443))))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_433 (+ (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_431 1)) (not (<= v_ArrVal_443 1)) (not (<= v_ArrVal_438 1)) (not (<= v_ArrVal_447 (+ v_ArrVal_445 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_445)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)))) (<= (+ v_ArrVal_447 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_447)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)) (* 2 ~N~0)) (not (<= v_ArrVal_445 (+ v_ArrVal_438 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_428 1)) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (<= v_ArrVal_437 (+ v_ArrVal_435 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_435)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_435 (+ v_ArrVal_433 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_433)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (<= v_ArrVal_440 1))))))))) (< 2 c_~N~0) (<= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((v_ArrVal_445 Int) (v_ArrVal_433 Int) (v_ArrVal_443 Int) (v_ArrVal_431 Int) (v_ArrVal_440 Int) (~N~0 Int) (v_ArrVal_438 Int) (v_ArrVal_437 Int) (v_ArrVal_447 Int) (v_ArrVal_435 Int)) (let ((.cse12 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_431))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse12))) (let ((.cse14 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse15 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse11 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse13 (let ((.cse17 (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_437)))) (store .cse17 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse17 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_438) .cse14 v_ArrVal_440) .cse15 v_ArrVal_443))))) (let ((.cse10 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_431 1)) (not (<= v_ArrVal_443 1)) (not (<= v_ArrVal_438 1)) (not (<= v_ArrVal_445 (+ v_ArrVal_438 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (<= v_ArrVal_433 (+ (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= v_ArrVal_440 1)) (not (<= v_ArrVal_447 (+ (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_445)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse14) v_ArrVal_445))) (<= (+ v_ArrVal_447 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_447)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse15)) (* 2 ~N~0)) (not (<= v_ArrVal_435 (+ v_ArrVal_433 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_433)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (<= v_ArrVal_437 (+ v_ArrVal_435 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_435)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))))))) (or (and (= (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) .cse18) (< 2 |c_ULTIMATE.start_main_~i~0#1|)) (forall ((v_ArrVal_428 Int) (v_ArrVal_438 Int) (v_ArrVal_426 Int) (v_ArrVal_437 Int) (v_ArrVal_447 Int) (v_ArrVal_435 Int) (v_ArrVal_445 Int) (v_ArrVal_433 Int) (v_ArrVal_443 Int) (v_ArrVal_431 Int) (v_ArrVal_440 Int) (~N~0 Int)) (let ((.cse21 (let ((.cse27 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_426) (+ .cse27 |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_428) (+ .cse27 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse21))) (let ((.cse24 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse25 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse20 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse22 (let ((.cse26 (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_437)))) (store .cse26 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse26 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_438) .cse24 v_ArrVal_440) .cse25 v_ArrVal_443))))) (let ((.cse23 (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_431 1)) (not (<= v_ArrVal_443 1)) (not (<= v_ArrVal_438 1)) (not (<= v_ArrVal_435 (+ v_ArrVal_433 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_433)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (<= v_ArrVal_428 1)) (not (<= v_ArrVal_433 (+ (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse21 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= v_ArrVal_440 1)) (not (<= v_ArrVal_447 (+ v_ArrVal_445 (select (select (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_445)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse24)))) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (not (<= v_ArrVal_426 1)) (not (<= v_ArrVal_437 (+ v_ArrVal_435 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_435)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (<= (+ v_ArrVal_447 (select (select (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_447)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse25)) (* 2 ~N~0)) (not (<= v_ArrVal_445 (+ v_ArrVal_438 (select .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= 3 c_~N~0) (<= (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (<= .cse28 0) (forall ((v_ArrVal_445 Int) (v_ArrVal_433 Int) (v_ArrVal_443 Int) (v_ArrVal_431 Int) (v_ArrVal_440 Int) (~N~0 Int) (v_ArrVal_428 Int) (v_ArrVal_438 Int) (v_ArrVal_437 Int) (v_ArrVal_447 Int) (v_ArrVal_435 Int)) (let ((.cse35 (let ((.cse37 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse37 |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_428) (+ .cse37 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse35))) (let ((.cse34 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse33 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse31 (select .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse32 (let ((.cse36 (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_437)))) (store .cse36 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse36 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_438) .cse34 v_ArrVal_440) .cse33 v_ArrVal_443))))) (let ((.cse29 (select .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_431 1)) (not (<= v_ArrVal_445 (+ v_ArrVal_438 (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_443 1)) (not (<= v_ArrVal_438 1)) (not (<= v_ArrVal_428 1)) (not (<= v_ArrVal_435 (+ v_ArrVal_433 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_433)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (<= (+ v_ArrVal_447 (select (select (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_447)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse33)) (* 2 ~N~0)) (not (<= v_ArrVal_447 (+ v_ArrVal_445 (select (select (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_445)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse34)))) (not (<= v_ArrVal_440 1)) (not (<= v_ArrVal_437 (+ v_ArrVal_435 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_435)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_433 (+ (select .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0))))))))) (< (+ |c_ULTIMATE.start_main_~b~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (or (and .cse18 (= (select .cse0 (+ (* c_~N~0 4) |c_ULTIMATE.start_main_~a~0#1.offset| (- 8))) 1) (= (select .cse0 8) 1)) (< 3 c_~N~0)) (forall ((~N~0 Int)) (or (forall ((v_ArrVal_445 Int) (v_ArrVal_433 Int) (v_ArrVal_443 Int) (v_ArrVal_431 Int) (v_ArrVal_440 Int) (v_ArrVal_438 Int) (v_ArrVal_437 Int) (v_ArrVal_447 Int) (v_ArrVal_435 Int)) (let ((.cse41 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431))) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse41))) (let ((.cse43 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse44 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse39 (select .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse42 (let ((.cse45 (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_437)))) (store .cse45 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse45 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_438) .cse43 v_ArrVal_440) .cse44 v_ArrVal_443))))) (let ((.cse40 (select .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_437 (+ v_ArrVal_435 (select (select (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_435)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_431 1)) (not (<= v_ArrVal_443 1)) (not (<= v_ArrVal_438 1)) (not (<= v_ArrVal_445 (+ (select .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset|) v_ArrVal_438))) (not (<= v_ArrVal_433 (+ (select .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse41 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= v_ArrVal_447 (+ v_ArrVal_445 (select (select (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_445)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse43)))) (not (<= v_ArrVal_435 (+ v_ArrVal_433 (select (select (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_433)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (<= v_ArrVal_440 1)) (<= (+ v_ArrVal_447 (select (select (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_447)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse44)) (* 2 ~N~0))))))))) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0))))))) is different from true