./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/condm.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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/condm.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 6f961be2104ef3ac444088284f7936b105cc31dfbd8617bc6896bf1b51a5f23d --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 23:15:35,496 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:15:35,498 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:15:35,534 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:15:35,534 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:15:35,535 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:15:35,536 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:15:35,537 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:15:35,538 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:15:35,539 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:15:35,540 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:15:35,540 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:15:35,541 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:15:35,541 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:15:35,542 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:15:35,543 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:15:35,543 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:15:35,544 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:15:35,545 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:15:35,546 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:15:35,547 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:15:35,555 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:15:35,557 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:15:35,558 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:15:35,560 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:15:35,565 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:15:35,566 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:15:35,567 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:15:35,567 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:15:35,568 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:15:35,568 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:15:35,569 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:15:35,570 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:15:35,570 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:15:35,571 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:15:35,572 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:15:35,572 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:15:35,572 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:15:35,572 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:15:35,573 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:15:35,573 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:15:35,579 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:15:35,581 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 23:15:35,602 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:15:35,604 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:15:35,604 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:15:35,605 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:15:35,606 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:15:35,606 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:15:35,607 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:15:35,607 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:15:35,607 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:15:35,608 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:15:35,608 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:15:35,608 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 23:15:35,608 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:15:35,608 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:15:35,609 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:15:35,609 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:15:35,609 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:15:35,609 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:15:35,610 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:15:35,610 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:15:35,610 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:15:35,611 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:15:35,611 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:15:35,611 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:15:35,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:15:35,612 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:15:35,612 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:15:35,612 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:15:35,623 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 23:15:35,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 23:15:35,623 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:15:35,624 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:15:35,624 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:15:35,624 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 -> 6f961be2104ef3ac444088284f7936b105cc31dfbd8617bc6896bf1b51a5f23d [2022-07-11 23:15:35,834 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:15:35,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:15:35,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:15:35,855 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:15:35,856 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:15:35,856 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/condm.c [2022-07-11 23:15:35,907 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8604ba368/c74059dafc9b403aa695cc4d508a4649/FLAG45494a4a6 [2022-07-11 23:15:36,282 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:15:36,282 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/condm.c [2022-07-11 23:15:36,288 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8604ba368/c74059dafc9b403aa695cc4d508a4649/FLAG45494a4a6 [2022-07-11 23:15:36,300 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8604ba368/c74059dafc9b403aa695cc4d508a4649 [2022-07-11 23:15:36,302 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:15:36,303 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:15:36,304 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:15:36,315 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:15:36,318 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:15:36,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:15:36" (1/1) ... [2022-07-11 23:15:36,320 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f9e395a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:15:36, skipping insertion in model container [2022-07-11 23:15:36,320 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:15:36" (1/1) ... [2022-07-11 23:15:36,329 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:15:36,346 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:15:36,444 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/condm.c[588,601] [2022-07-11 23:15:36,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:15:36,464 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:15:36,479 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/condm.c[588,601] [2022-07-11 23:15:36,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:15:36,503 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:15:36,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:15:36 WrapperNode [2022-07-11 23:15:36,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:15:36,505 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:15:36,505 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:15:36,505 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:15:36,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:15:36" (1/1) ... [2022-07-11 23:15:36,530 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:15:36" (1/1) ... [2022-07-11 23:15:36,548 INFO L137 Inliner]: procedures = 16, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 67 [2022-07-11 23:15:36,549 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:15:36,549 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:15:36,550 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:15:36,550 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:15:36,555 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:15:36" (1/1) ... [2022-07-11 23:15:36,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:15:36" (1/1) ... [2022-07-11 23:15:36,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:15:36" (1/1) ... [2022-07-11 23:15:36,558 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:15:36" (1/1) ... [2022-07-11 23:15:36,571 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:15:36" (1/1) ... [2022-07-11 23:15:36,574 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:15:36" (1/1) ... [2022-07-11 23:15:36,574 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:15:36" (1/1) ... [2022-07-11 23:15:36,579 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:15:36,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:15:36,580 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:15:36,580 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:15:36,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:15:36" (1/1) ... [2022-07-11 23:15:36,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:15:36,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:15:36,603 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-11 23:15:36,617 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-11 23:15:36,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:15:36,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 23:15:36,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-11 23:15:36,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-11 23:15:36,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:15:36,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:15:36,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-11 23:15:36,667 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:15:36,669 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:15:36,772 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:15:36,776 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:15:36,777 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-11 23:15:36,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:15:36 BoogieIcfgContainer [2022-07-11 23:15:36,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:15:36,780 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:15:36,780 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:15:36,782 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:15:36,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:15:36" (1/3) ... [2022-07-11 23:15:36,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f7995a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:15:36, skipping insertion in model container [2022-07-11 23:15:36,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:15:36" (2/3) ... [2022-07-11 23:15:36,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f7995a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:15:36, skipping insertion in model container [2022-07-11 23:15:36,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:15:36" (3/3) ... [2022-07-11 23:15:36,791 INFO L111 eAbstractionObserver]: Analyzing ICFG condm.c [2022-07-11 23:15:36,800 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:15:36,815 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:15:36,846 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:15:36,851 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@46626ba5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@24b6e2a6 [2022-07-11 23:15:36,851 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:15:36,854 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:15:36,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-11 23:15:36,859 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:15:36,859 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:15:36,860 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:15:36,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:15:36,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1828392228, now seen corresponding path program 1 times [2022-07-11 23:15:36,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:15:36,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844086797] [2022-07-11 23:15:36,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:15:36,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:15:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:15:36,998 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-11 23:15:36,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:15:37,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844086797] [2022-07-11 23:15:37,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844086797] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:15:37,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:15:37,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-11 23:15:37,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935816483] [2022-07-11 23:15:37,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:15:37,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-11 23:15:37,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:15:37,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-11 23:15:37,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-11 23:15:37,032 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:15:37,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:15:37,044 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-07-11 23:15:37,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-11 23:15:37,045 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-11 23:15:37,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:15:37,051 INFO L225 Difference]: With dead ends: 40 [2022-07-11 23:15:37,052 INFO L226 Difference]: Without dead ends: 18 [2022-07-11 23:15:37,054 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-11 23:15:37,058 INFO L413 NwaCegarLoop]: 26 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, 26 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-11 23:15:37,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:15:37,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-07-11 23:15:37,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-07-11 23:15:37,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 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-11 23:15:37,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-07-11 23:15:37,080 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 12 [2022-07-11 23:15:37,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:15:37,081 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-07-11 23:15:37,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:15:37,082 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-07-11 23:15:37,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-11 23:15:37,082 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:15:37,083 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:15:37,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 23:15:37,083 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:15:37,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:15:37,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1148333858, now seen corresponding path program 1 times [2022-07-11 23:15:37,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:15:37,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839157897] [2022-07-11 23:15:37,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:15:37,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:15:37,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:15:37,152 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-11 23:15:37,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:15:37,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839157897] [2022-07-11 23:15:37,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839157897] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:15:37,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:15:37,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:15:37,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040142647] [2022-07-11 23:15:37,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:15:37,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:15:37,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:15:37,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:15:37,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:15:37,155 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:15:37,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:15:37,198 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2022-07-11 23:15:37,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:15:37,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-11 23:15:37,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:15:37,202 INFO L225 Difference]: With dead ends: 40 [2022-07-11 23:15:37,202 INFO L226 Difference]: Without dead ends: 29 [2022-07-11 23:15:37,202 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-11 23:15:37,203 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 24 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:15:37,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 15 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:15:37,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-11 23:15:37,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2022-07-11 23:15:37,209 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-11 23:15:37,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-07-11 23:15:37,210 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2022-07-11 23:15:37,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:15:37,210 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-07-11 23:15:37,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:15:37,211 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-07-11 23:15:37,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-11 23:15:37,211 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:15:37,211 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:15:37,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-11 23:15:37,212 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:15:37,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:15:37,212 INFO L85 PathProgramCache]: Analyzing trace with hash -2142875084, now seen corresponding path program 1 times [2022-07-11 23:15:37,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:15:37,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256157576] [2022-07-11 23:15:37,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:15:37,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:15:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:15:37,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:15:37,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:15:37,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256157576] [2022-07-11 23:15:37,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256157576] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:15:37,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031543595] [2022-07-11 23:15:37,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:15:37,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:15:37,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:15:37,459 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-11 23:15:37,460 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-11 23:15:37,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:15:37,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-11 23:15:37,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:15:37,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11 23:15:37,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-11 23:15:37,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2022-07-11 23:15:37,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:15:37,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:15:38,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-07-11 23:15:38,336 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 32 treesize of output 30 [2022-07-11 23:15:38,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:15:38,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031543595] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:15:38,379 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:15:38,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 19 [2022-07-11 23:15:38,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047381831] [2022-07-11 23:15:38,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:15:38,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-11 23:15:38,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:15:38,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-11 23:15:38,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2022-07-11 23:15:38,381 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:15:39,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:15:39,186 INFO L93 Difference]: Finished difference Result 76 states and 92 transitions. [2022-07-11 23:15:39,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-11 23:15:39,186 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-11 23:15:39,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:15:39,187 INFO L225 Difference]: With dead ends: 76 [2022-07-11 23:15:39,187 INFO L226 Difference]: Without dead ends: 66 [2022-07-11 23:15:39,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=308, Invalid=814, Unknown=0, NotChecked=0, Total=1122 [2022-07-11 23:15:39,189 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 293 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:15:39,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 80 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:15:39,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-11 23:15:39,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 37. [2022-07-11 23:15:39,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 36 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:15:39,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-07-11 23:15:39,195 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 17 [2022-07-11 23:15:39,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:15:39,196 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-07-11 23:15:39,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:15:39,196 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-07-11 23:15:39,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-11 23:15:39,196 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:15:39,197 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:15:39,227 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-11 23:15:39,397 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-11 23:15:39,397 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:15:39,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:15:39,398 INFO L85 PathProgramCache]: Analyzing trace with hash -596215012, now seen corresponding path program 1 times [2022-07-11 23:15:39,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:15:39,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137371640] [2022-07-11 23:15:39,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:15:39,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:15:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:15:39,477 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:15:39,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:15:39,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137371640] [2022-07-11 23:15:39,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137371640] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:15:39,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53728802] [2022-07-11 23:15:39,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:15:39,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:15:39,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:15:39,485 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-11 23:15:39,486 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-11 23:15:39,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:15:39,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-11 23:15:39,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:15:39,549 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:15:39,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:15:39,567 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:15:39,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53728802] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:15:39,568 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:15:39,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-11 23:15:39,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075024079] [2022-07-11 23:15:39,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:15:39,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-11 23:15:39,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:15:39,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-11 23:15:39,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:15:39,570 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:15:39,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:15:39,644 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2022-07-11 23:15:39,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-11 23:15:39,645 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-11 23:15:39,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:15:39,645 INFO L225 Difference]: With dead ends: 72 [2022-07-11 23:15:39,646 INFO L226 Difference]: Without dead ends: 50 [2022-07-11 23:15:39,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-11 23:15:39,647 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 38 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:15:39,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 51 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:15:39,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-11 23:15:39,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 34. [2022-07-11 23:15:39,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 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-11 23:15:39,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2022-07-11 23:15:39,652 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 20 [2022-07-11 23:15:39,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:15:39,652 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2022-07-11 23:15:39,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:15:39,652 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-07-11 23:15:39,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-11 23:15:39,653 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:15:39,653 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:15:39,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-11 23:15:39,867 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-11 23:15:39,868 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:15:39,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:15:39,868 INFO L85 PathProgramCache]: Analyzing trace with hash -408404582, now seen corresponding path program 2 times [2022-07-11 23:15:39,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:15:39,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878065380] [2022-07-11 23:15:39,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:15:39,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:15:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:15:40,111 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-11 23:15:40,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:15:40,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878065380] [2022-07-11 23:15:40,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878065380] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:15:40,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771375786] [2022-07-11 23:15:40,112 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:15:40,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:15:40,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:15:40,114 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-11 23:15:40,115 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-11 23:15:40,154 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:15:40,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:15:40,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-11 23:15:40,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:15:40,228 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-11 23:15:40,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:15:40,297 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-11 23:15:40,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771375786] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:15:40,297 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:15:40,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2022-07-11 23:15:40,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827144035] [2022-07-11 23:15:40,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:15:40,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-11 23:15:40,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:15:40,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-11 23:15:40,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-07-11 23:15:40,299 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:15:40,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:15:40,605 INFO L93 Difference]: Finished difference Result 153 states and 172 transitions. [2022-07-11 23:15:40,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-11 23:15:40,606 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-11 23:15:40,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:15:40,606 INFO L225 Difference]: With dead ends: 153 [2022-07-11 23:15:40,606 INFO L226 Difference]: Without dead ends: 141 [2022-07-11 23:15:40,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=286, Invalid=584, Unknown=0, NotChecked=0, Total=870 [2022-07-11 23:15:40,607 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 541 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:15:40,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 64 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:15:40,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-11 23:15:40,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 42. [2022-07-11 23:15:40,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 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-11 23:15:40,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2022-07-11 23:15:40,614 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 22 [2022-07-11 23:15:40,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:15:40,614 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2022-07-11 23:15:40,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:15:40,615 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-07-11 23:15:40,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-11 23:15:40,615 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:15:40,615 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:15:40,637 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-11 23:15:40,838 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-11 23:15:40,838 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:15:40,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:15:40,838 INFO L85 PathProgramCache]: Analyzing trace with hash -311207784, now seen corresponding path program 3 times [2022-07-11 23:15:40,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:15:40,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420084522] [2022-07-11 23:15:40,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:15:40,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:15:40,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:15:40,927 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:15:40,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:15:40,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420084522] [2022-07-11 23:15:40,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420084522] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:15:40,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008820527] [2022-07-11 23:15:40,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-11 23:15:40,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:15:40,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:15:40,941 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-11 23:15:40,943 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-11 23:15:40,983 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-11 23:15:40,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:15:40,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-11 23:15:40,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:15:41,090 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:15:41,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:15:41,145 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:15:41,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008820527] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:15:41,146 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:15:41,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 20 [2022-07-11 23:15:41,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135638098] [2022-07-11 23:15:41,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:15:41,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-11 23:15:41,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:15:41,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-11 23:15:41,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2022-07-11 23:15:41,148 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 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-11 23:15:41,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:15:41,726 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2022-07-11 23:15:41,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-11 23:15:41,727 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-11 23:15:41,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:15:41,727 INFO L225 Difference]: With dead ends: 112 [2022-07-11 23:15:41,727 INFO L226 Difference]: Without dead ends: 102 [2022-07-11 23:15:41,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=382, Invalid=1258, Unknown=0, NotChecked=0, Total=1640 [2022-07-11 23:15:41,728 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 272 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:15:41,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 171 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:15:41,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-11 23:15:41,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 58. [2022-07-11 23:15:41,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 57 states have internal predecessors, (66), 0 states have call successors, (0), 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-11 23:15:41,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2022-07-11 23:15:41,735 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 24 [2022-07-11 23:15:41,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:15:41,735 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2022-07-11 23:15:41,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 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-11 23:15:41,736 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2022-07-11 23:15:41,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-11 23:15:41,736 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:15:41,737 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:15:41,769 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-11 23:15:41,951 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-11 23:15:41,951 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:15:41,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:15:41,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1394926352, now seen corresponding path program 1 times [2022-07-11 23:15:41,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:15:41,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408940939] [2022-07-11 23:15:41,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:15:41,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:15:41,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:15:42,285 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:15:42,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:15:42,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408940939] [2022-07-11 23:15:42,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408940939] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:15:42,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933581053] [2022-07-11 23:15:42,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:15:42,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:15:42,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:15:42,292 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-11 23:15:42,293 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-11 23:15:42,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:15:42,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-11 23:15:42,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:15:42,350 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 15 treesize of output 11 [2022-07-11 23:15:42,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:15:42,390 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 21 treesize of output 20 [2022-07-11 23:15:42,461 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:15:42,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:15:42,465 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:15:42,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 41 [2022-07-11 23:15:42,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:15:42,533 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:15:42,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2022-07-11 23:15:42,797 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:15:42,798 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 1 case distinctions, treesize of input 47 treesize of output 31 [2022-07-11 23:15:42,816 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:15:42,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:15:44,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 170 [2022-07-11 23:15:44,010 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-11 23:15:44,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 360 treesize of output 342 [2022-07-11 23:15:44,076 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:15:44,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933581053] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:15:44,077 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:15:44,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 40 [2022-07-11 23:15:44,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633167759] [2022-07-11 23:15:44,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:15:44,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-11 23:15:44,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:15:44,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-11 23:15:44,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=1281, Unknown=0, NotChecked=0, Total=1560 [2022-07-11 23:15:44,079 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand has 40 states, 40 states have (on average 1.725) internal successors, (69), 40 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:15:53,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:15:53,418 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2022-07-11 23:15:53,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-07-11 23:15:53,419 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.725) internal successors, (69), 40 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-11 23:15:53,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:15:53,420 INFO L225 Difference]: With dead ends: 136 [2022-07-11 23:15:53,420 INFO L226 Difference]: Without dead ends: 134 [2022-07-11 23:15:53,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2656 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=1328, Invalid=7044, Unknown=0, NotChecked=0, Total=8372 [2022-07-11 23:15:53,422 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 507 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-11 23:15:53,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 258 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-11 23:15:53,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-11 23:15:53,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 62. [2022-07-11 23:15:53,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 61 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:15:53,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2022-07-11 23:15:53,431 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 26 [2022-07-11 23:15:53,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:15:53,431 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2022-07-11 23:15:53,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.725) internal successors, (69), 40 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:15:53,431 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2022-07-11 23:15:53,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-11 23:15:53,432 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:15:53,432 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:15:53,449 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-11 23:15:53,643 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-11 23:15:53,644 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:15:53,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:15:53,644 INFO L85 PathProgramCache]: Analyzing trace with hash -562149382, now seen corresponding path program 4 times [2022-07-11 23:15:53,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:15:53,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618967388] [2022-07-11 23:15:53,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:15:53,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:15:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:15:54,575 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:15:54,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:15:54,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618967388] [2022-07-11 23:15:54,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618967388] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:15:54,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110387127] [2022-07-11 23:15:54,575 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-11 23:15:54,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:15:54,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:15:54,576 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-11 23:15:54,577 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-11 23:15:54,614 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-11 23:15:54,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:15:54,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-11 23:15:54,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:15:54,630 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 15 treesize of output 11 [2022-07-11 23:15:54,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:15:54,662 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-11 23:15:54,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:15:54,685 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-11 23:15:54,738 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:15:54,740 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:15:54,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2022-07-11 23:15:54,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:15:54,788 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-11 23:15:54,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:15:54,828 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-11 23:15:54,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-11 23:15:54,897 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:15:54,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:15:57,174 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (< c_~N~0 0))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_66| Int)) (or (forall ((v_ArrVal_147 Int)) (= (+ (- 2) (mod (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (+ (- 2) (mod c_~N~0 2)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_66|)))) (or (forall ((v_ArrVal_147 Int) (|v_ULTIMATE.start_main_~i~0#1_66| Int)) (let ((.cse0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (mod .cse0 2) 0) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_66|)) (not (< .cse0 0))))) .cse1) (or (forall ((v_ArrVal_147 Int) (|v_ULTIMATE.start_main_~i~0#1_66| Int)) (or (< (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_66|)))) (not .cse1) (= (mod c_~N~0 2) 0)))) is different from false [2022-07-11 23:16:43,266 WARN L233 SmtUtils]: Spent 24.23s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-11 23:17:13,321 WARN L233 SmtUtils]: Spent 29.89s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-11 23:17:56,021 WARN L233 SmtUtils]: Spent 14.03s on a formula simplification. DAG size of input: 55 DAG size of output: 50 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-11 23:17:58,072 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_140 Int) (|v_ULTIMATE.start_main_~i~0#1_70| Int)) (or (forall ((v_ArrVal_147 Int) (v_ArrVal_145 Int) (v_ArrVal_142 Int) (|v_ULTIMATE.start_main_~i~0#1_67| Int) (|v_ULTIMATE.start_main_~i~0#1_66| Int)) (let ((.cse0 (select (store (store (let ((.cse1 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_140) (+ (* |v_ULTIMATE.start_main_~i~0#1_70| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_142))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_67| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_145) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_67| 1) |v_ULTIMATE.start_main_~i~0#1_66|)) (not (< .cse0 0)) (= (mod .cse0 2) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_67|))))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_70|)))) (forall ((v_ArrVal_140 Int) (|v_ULTIMATE.start_main_~i~0#1_70| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_70|)) (forall ((v_ArrVal_147 Int) (v_ArrVal_145 Int) (v_ArrVal_142 Int) (|v_ULTIMATE.start_main_~i~0#1_67| Int) (|v_ULTIMATE.start_main_~i~0#1_66| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_67| 1) |v_ULTIMATE.start_main_~i~0#1_66|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_67|)) (<= 1 (mod (select (store (store (let ((.cse2 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_140) (+ (* |v_ULTIMATE.start_main_~i~0#1_70| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_142))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_67| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_145) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|) 2))))))) is different from false [2022-07-11 23:18:00,124 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_71|)) (forall ((v_ArrVal_140 Int) (|v_ULTIMATE.start_main_~i~0#1_70| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_71| 1) |v_ULTIMATE.start_main_~i~0#1_70|)) (forall ((v_ArrVal_147 Int) (v_ArrVal_145 Int) (v_ArrVal_142 Int) (|v_ULTIMATE.start_main_~i~0#1_67| Int) (|v_ULTIMATE.start_main_~i~0#1_66| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_67| 1) |v_ULTIMATE.start_main_~i~0#1_66|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_67|)) (<= 1 (mod (select (store (store (let ((.cse0 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_140) (+ (* |v_ULTIMATE.start_main_~i~0#1_70| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_142))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_67| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_145) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_71|)) (forall ((v_ArrVal_140 Int) (|v_ULTIMATE.start_main_~i~0#1_70| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_71| 1) |v_ULTIMATE.start_main_~i~0#1_70|)) (forall ((v_ArrVal_147 Int) (v_ArrVal_145 Int) (v_ArrVal_142 Int) (|v_ULTIMATE.start_main_~i~0#1_67| Int) (|v_ULTIMATE.start_main_~i~0#1_66| Int)) (let ((.cse1 (select (store (store (let ((.cse2 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_140) (+ (* |v_ULTIMATE.start_main_~i~0#1_70| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_142))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_67| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_145) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_67| 1) |v_ULTIMATE.start_main_~i~0#1_66|)) (not (< .cse1 0)) (= (mod .cse1 2) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_67|)))))))))) is different from false [2022-07-11 23:18:00,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 70 [2022-07-11 23:18:00,168 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 896 treesize of output 888 [2022-07-11 23:18:00,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 140 [2022-07-11 23:18:00,292 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 1682 treesize of output 1666 [2022-07-11 23:18:00,401 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-07-11 23:18:00,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110387127] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:18:00,401 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:18:00,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13, 16] total 42 [2022-07-11 23:18:00,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581471397] [2022-07-11 23:18:00,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:18:00,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-11 23:18:00,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:18:00,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-11 23:18:00,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=1236, Unknown=23, NotChecked=228, Total=1722 [2022-07-11 23:18:00,403 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand has 42 states, 42 states have (on average 1.7142857142857142) internal successors, (72), 42 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:18:02,424 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (<= 1 c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_71|)) (forall ((v_ArrVal_140 Int) (|v_ULTIMATE.start_main_~i~0#1_70| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_71| 1) |v_ULTIMATE.start_main_~i~0#1_70|)) (forall ((v_ArrVal_147 Int) (v_ArrVal_145 Int) (v_ArrVal_142 Int) (|v_ULTIMATE.start_main_~i~0#1_67| Int) (|v_ULTIMATE.start_main_~i~0#1_66| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_67| 1) |v_ULTIMATE.start_main_~i~0#1_66|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_67|)) (<= 1 (mod (select (store (store (let ((.cse0 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_140) (+ (* |v_ULTIMATE.start_main_~i~0#1_70| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_142))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_67| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_145) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_71|)) (forall ((v_ArrVal_140 Int) (|v_ULTIMATE.start_main_~i~0#1_70| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_71| 1) |v_ULTIMATE.start_main_~i~0#1_70|)) (forall ((v_ArrVal_147 Int) (v_ArrVal_145 Int) (v_ArrVal_142 Int) (|v_ULTIMATE.start_main_~i~0#1_67| Int) (|v_ULTIMATE.start_main_~i~0#1_66| Int)) (let ((.cse1 (select (store (store (let ((.cse2 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_140) (+ (* |v_ULTIMATE.start_main_~i~0#1_70| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_142))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_67| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_145) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_67| 1) |v_ULTIMATE.start_main_~i~0#1_66|)) (not (< .cse1 0)) (= (mod .cse1 2) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_67|)))))))))) is different from false [2022-07-11 23:18:06,945 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (< c_~N~0 0))) (and (= (+ (* 2 (div c_~N~0 2)) 1) c_~N~0) (<= 3 c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_66| Int)) (or (forall ((v_ArrVal_147 Int)) (= (+ (- 2) (mod (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (+ (- 2) (mod c_~N~0 2)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_66|)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (or (forall ((v_ArrVal_147 Int) (|v_ULTIMATE.start_main_~i~0#1_66| Int)) (let ((.cse0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (mod .cse0 2) 0) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_66|)) (not (< .cse0 0))))) .cse1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (or (forall ((v_ArrVal_147 Int) (|v_ULTIMATE.start_main_~i~0#1_66| Int)) (or (< (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_66|)))) (not .cse1) (= (mod c_~N~0 2) 0)))) is different from false [2022-07-11 23:18:08,978 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (< c_~N~0 0))) (and (= (+ (* 2 (div c_~N~0 2)) 1) c_~N~0) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (<= 3 c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_66| Int)) (or (forall ((v_ArrVal_147 Int)) (= (+ (- 2) (mod (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (+ (- 2) (mod c_~N~0 2)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_66|)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (or (forall ((v_ArrVal_147 Int) (|v_ULTIMATE.start_main_~i~0#1_66| Int)) (let ((.cse0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (mod .cse0 2) 0) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_66|)) (not (< .cse0 0))))) .cse1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (or (forall ((v_ArrVal_147 Int) (|v_ULTIMATE.start_main_~i~0#1_66| Int)) (or (< (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_66|)))) (not .cse1) (= (mod c_~N~0 2) 0)))) is different from false [2022-07-11 23:18:10,989 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (< c_~N~0 0))) (and (= (+ (* 2 (div c_~N~0 2)) 1) c_~N~0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 1) (<= (+ (div (* (- 1) |c_ULTIMATE.start_main_~a~0#1.offset|) 4) 3) c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_67| Int)) (or (forall ((v_ArrVal_145 Int) (|v_ULTIMATE.start_main_~i~0#1_66| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_67| 1) |v_ULTIMATE.start_main_~i~0#1_66|)) (forall ((v_ArrVal_147 Int)) (= (+ (- 2) (mod c_~N~0 2)) (+ (- 2) (mod (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_67| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_145) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)))))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_67|)))) (or (not .cse0) (= (mod c_~N~0 2) 0) (forall ((v_ArrVal_147 Int) (v_ArrVal_145 Int) (|v_ULTIMATE.start_main_~i~0#1_67| Int) (|v_ULTIMATE.start_main_~i~0#1_66| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_67| 1) |v_ULTIMATE.start_main_~i~0#1_66|)) (< (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_67| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_145) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_67|))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (or (forall ((v_ArrVal_147 Int) (v_ArrVal_145 Int) (|v_ULTIMATE.start_main_~i~0#1_67| Int) (|v_ULTIMATE.start_main_~i~0#1_66| Int)) (let ((.cse1 (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_67| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_145) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_67| 1) |v_ULTIMATE.start_main_~i~0#1_66|)) (= (mod .cse1 2) 0) (not (< .cse1 0)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_67|))))) .cse0))) is different from false [2022-07-11 23:18:11,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:18:11,124 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2022-07-11 23:18:11,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-11 23:18:11,125 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.7142857142857142) internal successors, (72), 42 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-11 23:18:11,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:18:11,125 INFO L225 Difference]: With dead ends: 85 [2022-07-11 23:18:11,125 INFO L226 Difference]: Without dead ends: 83 [2022-07-11 23:18:11,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1037 ImplicationChecksByTransitivity, 135.4s TimeCoverageRelationStatistics Valid=426, Invalid=2331, Unknown=27, NotChecked=756, Total=3540 [2022-07-11 23:18:11,127 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 59 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 259 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:18:11,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 194 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 235 Invalid, 0 Unknown, 259 Unchecked, 0.2s Time] [2022-07-11 23:18:11,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-11 23:18:11,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 62. [2022-07-11 23:18:11,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 61 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:18:11,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2022-07-11 23:18:11,139 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 27 [2022-07-11 23:18:11,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:18:11,140 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2022-07-11 23:18:11,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.7142857142857142) internal successors, (72), 42 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:18:11,141 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2022-07-11 23:18:11,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-11 23:18:11,143 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:18:11,143 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:18:11,160 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-11 23:18:11,359 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-11 23:18:11,360 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:18:11,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:18:11,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1446324666, now seen corresponding path program 2 times [2022-07-11 23:18:11,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:18:11,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386000591] [2022-07-11 23:18:11,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:18:11,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:18:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:18:11,427 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-11 23:18:11,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:18:11,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386000591] [2022-07-11 23:18:11,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386000591] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:18:11,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37649289] [2022-07-11 23:18:11,429 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:18:11,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:18:11,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:18:11,430 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-11 23:18:11,446 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-11 23:18:11,495 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:18:11,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:18:11,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-11 23:18:11,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:18:11,566 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-11 23:18:11,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:18:11,604 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-11 23:18:11,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37649289] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:18:11,605 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:18:11,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-11 23:18:11,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340031915] [2022-07-11 23:18:11,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:18:11,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-11 23:18:11,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:18:11,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-11 23:18:11,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-11 23:18:11,608 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:18:11,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:18:11,706 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2022-07-11 23:18:11,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-11 23:18:11,706 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-11 23:18:11,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:18:11,707 INFO L225 Difference]: With dead ends: 111 [2022-07-11 23:18:11,707 INFO L226 Difference]: Without dead ends: 77 [2022-07-11 23:18:11,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 54 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-11 23:18:11,707 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 68 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:18:11,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 64 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:18:11,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-11 23:18:11,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 61. [2022-07-11 23:18:11,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.1333333333333333) internal successors, (68), 60 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:18:11,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2022-07-11 23:18:11,735 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 30 [2022-07-11 23:18:11,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:18:11,736 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2022-07-11 23:18:11,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:18:11,736 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-07-11 23:18:11,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-11 23:18:11,737 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:18:11,737 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:18:11,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-11 23:18:11,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:18:11,939 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:18:11,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:18:11,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1857271344, now seen corresponding path program 1 times [2022-07-11 23:18:11,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:18:11,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252382586] [2022-07-11 23:18:11,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:18:11,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:18:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:18:12,893 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:18:12,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:18:12,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252382586] [2022-07-11 23:18:12,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252382586] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:18:12,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574120039] [2022-07-11 23:18:12,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:18:12,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:18:12,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:18:12,896 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:18:12,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-11 23:18:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:18:12,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-11 23:18:12,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:18:12,960 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 15 treesize of output 11 [2022-07-11 23:18:13,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:18:13,003 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 28 treesize of output 27 [2022-07-11 23:18:13,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:18:13,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:18:13,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:18:13,074 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:18:13,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2022-07-11 23:18:13,131 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:18:13,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:18:13,134 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:18:13,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 41 [2022-07-11 23:18:13,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:18:13,194 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:18:13,197 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:18:13,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 48 [2022-07-11 23:18:13,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:18:13,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:18:13,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:18:13,261 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:18:13,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2022-07-11 23:18:13,598 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:18:13,599 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 1 case distinctions, treesize of input 96 treesize of output 56 [2022-07-11 23:18:13,620 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:18:13,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:18:48,563 WARN L233 SmtUtils]: Spent 10.04s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-11 23:18:50,619 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_94| Int)) (or (forall ((v_ArrVal_207 Int)) (let ((.cse1 (store (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse3 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_207))) (let ((.cse0 (mod (select .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 2))) (or (not (= .cse0 0)) (= (mod (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) 2) .cse0))))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_94|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_94| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_94|)) (forall ((v_ArrVal_207 Int)) (let ((.cse5 (store (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse7 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_207))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (<= 0 .cse4) (= (mod .cse4 2) 0) (< (select .cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_94| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_94|)) (forall ((v_ArrVal_207 Int)) (let ((.cse8 (store (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse11 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse10 .cse11 (+ (select .cse10 .cse11) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_207))) (let ((.cse9 (select .cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= (mod (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) 2) (mod .cse9 2)) (< .cse9 0))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_94| Int)) (or (forall ((v_ArrVal_207 Int)) (let ((.cse13 (store (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse15 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse14 .cse15 (+ (select .cse14 .cse15) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_207))) (let ((.cse12 (select .cse13 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (not (< .cse12 0)) (= (mod .cse12 2) 0) (not (= (mod (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|) 2) 0)))))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_94|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_94| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_94|)) (forall ((v_ArrVal_207 Int)) (let ((.cse16 (store (let ((.cse18 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse19 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse18 .cse19 (+ (select .cse18 .cse19) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_207))) (let ((.cse17 (select .cse16 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (< (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (< .cse17 0)) (= (mod .cse17 2) 0)))))))) is different from false [2022-07-11 23:18:52,721 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_94| Int)) (or (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_94|)) (forall ((v_ArrVal_207 Int)) (let ((.cse1 (store (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse3 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_207))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= (mod .cse0 2) 0) (< (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (< .cse0 0)))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_94| Int)) (or (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_94|)) (forall ((v_ArrVal_207 Int)) (let ((.cse4 (store (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse7 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_207))) (let ((.cse5 (select .cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= (mod (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) 2) (mod .cse5 2)) (< .cse5 0))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_94| Int)) (or (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_94|)) (forall ((v_ArrVal_207 Int)) (let ((.cse9 (store (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse11 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store .cse10 .cse11 (+ (select .cse10 .cse11) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_207))) (let ((.cse8 (mod (select .cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 2))) (or (not (= .cse8 0)) (= (mod (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|) 2) .cse8))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_94| Int)) (or (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_94|)) (forall ((v_ArrVal_207 Int)) (let ((.cse13 (store (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse15 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store .cse14 .cse15 (+ (select .cse14 .cse15) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_207))) (let ((.cse12 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (<= 0 .cse12) (= (mod .cse12 2) 0) (< (select .cse13 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_94| Int)) (or (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_94|)) (forall ((v_ArrVal_207 Int)) (let ((.cse17 (store (let ((.cse18 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse19 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store .cse18 .cse19 (+ (select .cse18 .cse19) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_207))) (let ((.cse16 (select .cse17 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= (mod .cse16 2) 0) (not (< .cse16 0)) (not (= (mod (select .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|) 2) 0))))))))) is different from false [2022-07-11 23:19:33,056 WARN L233 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-11 23:20:16,606 WARN L233 SmtUtils]: Spent 10.04s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-11 23:20:18,711 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_98| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_98|)) (forall ((v_ArrVal_201 Int) (|v_ULTIMATE.start_main_~i~0#1_94| Int)) (or (forall ((v_ArrVal_207 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse0 (store (let ((.cse3 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 4)) v_ArrVal_201))) (store (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse2 (+ (select .cse3 .cse2) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_207))) (let ((.cse1 (select .cse0 .cse2))) (or (not (= (mod (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 2) 0)) (not (< .cse1 0)) (= (mod .cse1 2) 0)))))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_94|)))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_98| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_98|)) (forall ((v_ArrVal_201 Int) (|v_ULTIMATE.start_main_~i~0#1_94| Int)) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_94|)) (forall ((v_ArrVal_207 Int)) (let ((.cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse4 (store (let ((.cse7 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 4)) v_ArrVal_201))) (store (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse6 (+ (select .cse7 .cse6) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_207))) (let ((.cse5 (select .cse4 .cse6))) (or (< (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (< .cse5 0)) (= (mod .cse5 2) 0)))))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_98| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_98|)) (forall ((v_ArrVal_201 Int) (|v_ULTIMATE.start_main_~i~0#1_94| Int)) (or (forall ((v_ArrVal_207 Int)) (let ((.cse10 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse9 (store (let ((.cse11 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 4)) v_ArrVal_201))) (store (store .cse11 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse10 (+ (select .cse11 .cse10) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_207))) (let ((.cse8 (select .cse9 .cse10))) (or (< .cse8 0) (= (mod (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|) 2) (mod .cse8 2))))))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_94|)))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_98| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_98|)) (forall ((v_ArrVal_201 Int) (|v_ULTIMATE.start_main_~i~0#1_94| Int)) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_94|)) (forall ((v_ArrVal_207 Int)) (let ((.cse14 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse13 (store (let ((.cse15 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 4)) v_ArrVal_201))) (store (store .cse15 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse14 (+ (select .cse15 .cse14) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_207))) (let ((.cse12 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (mod .cse12 2) 0) (<= 0 .cse12) (< (select .cse13 .cse14) 0)))))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_98| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_98|)) (forall ((v_ArrVal_201 Int) (|v_ULTIMATE.start_main_~i~0#1_94| Int)) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_94|)) (forall ((v_ArrVal_207 Int)) (let ((.cse18 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse17 (store (let ((.cse19 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 4)) v_ArrVal_201))) (store (store .cse19 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse19 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse18 (+ (select .cse19 .cse18) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_207))) (let ((.cse16 (mod (select .cse17 .cse18) 2))) (or (not (= .cse16 0)) (= (mod (select .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|) 2) .cse16))))))))))) is different from false