./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s1lif.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/s1lif.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 cdcd45f06ced2bb4437693c85186d4d1862b19794596dce357397727796a8cdf --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:13:35,492 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:13:35,493 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:13:35,535 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:13:35,551 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:13:35,552 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:13:35,552 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:13:35,553 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:13:35,554 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:13:35,555 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:13:35,556 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:13:35,556 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:13:35,557 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:13:35,557 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:13:35,558 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:13:35,559 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:13:35,559 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:13:35,560 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:13:35,561 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:13:35,562 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:13:35,563 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:13:35,563 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:13:35,564 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:13:35,565 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:13:35,565 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:13:35,567 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:13:35,567 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:13:35,567 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:13:35,568 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:13:35,568 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:13:35,569 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:13:35,569 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:13:35,569 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:13:35,570 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:13:35,570 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:13:35,571 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:13:35,571 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:13:35,572 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:13:35,572 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:13:35,572 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:13:35,573 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:13:35,573 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:13:35,574 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 11:13:35,587 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:13:35,587 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:13:35,588 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:13:35,588 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:13:35,588 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:13:35,589 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:13:35,589 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:13:35,589 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:13:35,589 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:13:35,590 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:13:35,590 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:13:35,590 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 11:13:35,590 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:13:35,590 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:13:35,590 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:13:35,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:13:35,591 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:13:35,591 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:13:35,591 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:13:35,591 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:13:35,591 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:13:35,591 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:13:35,591 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:13:35,592 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:13:35,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:13:35,592 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:13:35,592 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:13:35,592 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:13:35,592 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 11:13:35,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 11:13:35,593 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:13:35,593 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:13:35,593 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:13:35,593 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 -> cdcd45f06ced2bb4437693c85186d4d1862b19794596dce357397727796a8cdf [2022-07-13 11:13:35,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:13:35,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:13:35,811 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:13:35,812 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:13:35,813 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:13:35,814 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s1lif.c [2022-07-13 11:13:35,853 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56776e3fe/34575d915d6246d19ac6e5c6556998ff/FLAG591e7af64 [2022-07-13 11:13:36,249 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:13:36,250 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s1lif.c [2022-07-13 11:13:36,256 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56776e3fe/34575d915d6246d19ac6e5c6556998ff/FLAG591e7af64 [2022-07-13 11:13:36,264 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56776e3fe/34575d915d6246d19ac6e5c6556998ff [2022-07-13 11:13:36,265 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:13:36,267 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:13:36,268 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:13:36,268 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:13:36,272 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:13:36,273 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:13:36" (1/1) ... [2022-07-13 11:13:36,273 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40418ccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:13:36, skipping insertion in model container [2022-07-13 11:13:36,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:13:36" (1/1) ... [2022-07-13 11:13:36,278 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:13:36,287 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:13:36,388 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/s1lif.c[588,601] [2022-07-13 11:13:36,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:13:36,407 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:13:36,414 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/s1lif.c[588,601] [2022-07-13 11:13:36,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:13:36,426 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:13:36,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:13:36 WrapperNode [2022-07-13 11:13:36,427 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:13:36,428 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:13:36,428 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:13:36,428 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:13:36,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:13:36" (1/1) ... [2022-07-13 11:13:36,445 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:13:36" (1/1) ... [2022-07-13 11:13:36,464 INFO L137 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2022-07-13 11:13:36,464 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:13:36,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:13:36,465 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:13:36,465 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:13:36,470 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:13:36" (1/1) ... [2022-07-13 11:13:36,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:13:36" (1/1) ... [2022-07-13 11:13:36,474 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:13:36" (1/1) ... [2022-07-13 11:13:36,474 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:13:36" (1/1) ... [2022-07-13 11:13:36,487 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:13:36" (1/1) ... [2022-07-13 11:13:36,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:13:36" (1/1) ... [2022-07-13 11:13:36,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:13:36" (1/1) ... [2022-07-13 11:13:36,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:13:36,495 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:13:36,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:13:36,496 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:13:36,496 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:13:36" (1/1) ... [2022-07-13 11:13:36,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:13:36,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:13:36,517 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 11:13:36,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 11:13:36,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:13:36,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 11:13:36,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 11:13:36,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 11:13:36,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 11:13:36,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:13:36,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:13:36,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 11:13:36,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 11:13:36,595 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:13:36,597 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:13:36,763 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:13:36,767 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:13:36,768 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-13 11:13:36,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:13:36 BoogieIcfgContainer [2022-07-13 11:13:36,769 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:13:36,770 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:13:36,770 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:13:36,788 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:13:36,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:13:36" (1/3) ... [2022-07-13 11:13:36,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be1c136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:13:36, skipping insertion in model container [2022-07-13 11:13:36,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:13:36" (2/3) ... [2022-07-13 11:13:36,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be1c136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:13:36, skipping insertion in model container [2022-07-13 11:13:36,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:13:36" (3/3) ... [2022-07-13 11:13:36,790 INFO L111 eAbstractionObserver]: Analyzing ICFG s1lif.c [2022-07-13 11:13:36,806 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:13:36,806 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:13:36,857 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:13:36,862 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@297b8151, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3665a4b1 [2022-07-13 11:13:36,862 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:13:36,864 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-13 11:13:36,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 11:13:36,876 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:13:36,876 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:13:36,877 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:13:36,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:13:36,882 INFO L85 PathProgramCache]: Analyzing trace with hash -845640729, now seen corresponding path program 1 times [2022-07-13 11:13:36,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:13:36,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549786636] [2022-07-13 11:13:36,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:13:36,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:13:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:13:37,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:13:37,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:13:37,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549786636] [2022-07-13 11:13:37,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549786636] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:13:37,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:13:37,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 11:13:37,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364861309] [2022-07-13 11:13:37,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:13:37,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 11:13:37,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:13:37,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 11:13:37,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 11:13:37,033 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.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:13:37,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:13:37,045 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-07-13 11:13:37,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 11:13:37,047 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-13 11:13:37,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:13:37,052 INFO L225 Difference]: With dead ends: 40 [2022-07-13 11:13:37,052 INFO L226 Difference]: Without dead ends: 18 [2022-07-13 11:13: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-13 11:13:37,057 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-13 11:13:37,058 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-13 11:13:37,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-07-13 11:13:37,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-07-13 11:13:37,078 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-13 11:13:37,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-07-13 11:13:37,080 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2022-07-13 11:13:37,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:13:37,080 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-07-13 11:13:37,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:13:37,081 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-07-13 11:13:37,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 11:13:37,082 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:13:37,082 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:13:37,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 11:13:37,082 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:13:37,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:13:37,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1238667739, now seen corresponding path program 1 times [2022-07-13 11:13:37,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:13:37,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534672357] [2022-07-13 11:13:37,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:13:37,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:13:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:13:37,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:13:37,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:13:37,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534672357] [2022-07-13 11:13:37,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534672357] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:13:37,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:13:37,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:13:37,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076098278] [2022-07-13 11:13:37,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:13:37,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:13:37,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:13:37,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:13:37,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:13:37,186 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:13:37,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:13:37,237 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-07-13 11:13:37,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:13:37,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-13 11:13:37,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:13:37,239 INFO L225 Difference]: With dead ends: 36 [2022-07-13 11:13:37,239 INFO L226 Difference]: Without dead ends: 25 [2022-07-13 11:13:37,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:13:37,243 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:13:37,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 11 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:13:37,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-13 11:13:37,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-07-13 11:13:37,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:13:37,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-07-13 11:13:37,251 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2022-07-13 11:13:37,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:13:37,252 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-07-13 11:13:37,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:13:37,253 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-07-13 11:13:37,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 11:13:37,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:13:37,255 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:13:37,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 11:13:37,255 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:13:37,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:13:37,256 INFO L85 PathProgramCache]: Analyzing trace with hash 2001188913, now seen corresponding path program 1 times [2022-07-13 11:13:37,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:13:37,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165634104] [2022-07-13 11:13:37,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:13:37,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:13:37,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:13:37,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:13:37,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:13:37,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165634104] [2022-07-13 11:13:37,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165634104] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:13:37,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792605877] [2022-07-13 11:13:37,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:13:37,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:13:37,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:13:37,649 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:13:37,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 11:13:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:13:37,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-13 11:13:37,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:13:37,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-13 11:13:37,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 11:13:37,830 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 14 treesize of output 16 [2022-07-13 11:13:37,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2022-07-13 11:13:38,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2022-07-13 11:13:38,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:13:38,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:13:38,285 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:13:38,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 28 [2022-07-13 11:13:38,334 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:13:38,335 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-13 11:13:38,337 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:13:38,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2022-07-13 11:13:38,343 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 16 treesize of output 12 [2022-07-13 11:13:38,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:13:38,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792605877] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:13:38,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:13:38,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 27 [2022-07-13 11:13:38,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459813663] [2022-07-13 11:13:38,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:13:38,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-13 11:13:38,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:13:38,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-13 11:13:38,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=550, Unknown=0, NotChecked=0, Total=702 [2022-07-13 11:13:38,361 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 27 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 27 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:13:38,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:13:38,676 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-07-13 11:13:38,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-13 11:13:38,676 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 27 states have internal predecessors, (46), 0 states have call successors, (0), 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-13 11:13:38,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:13:38,678 INFO L225 Difference]: With dead ends: 46 [2022-07-13 11:13:38,678 INFO L226 Difference]: Without dead ends: 41 [2022-07-13 11:13:38,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=217, Invalid=905, Unknown=0, NotChecked=0, Total=1122 [2022-07-13 11:13:38,679 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 17 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:13:38,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 68 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 179 Invalid, 0 Unknown, 51 Unchecked, 0.1s Time] [2022-07-13 11:13:38,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-07-13 11:13:38,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2022-07-13 11:13:38,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:13:38,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-07-13 11:13:38,684 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 20 [2022-07-13 11:13:38,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:13:38,684 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-07-13 11:13:38,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 27 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:13:38,685 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-07-13 11:13:38,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 11:13:38,685 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:13:38,685 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:13:38,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-13 11:13:38,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:13:38,899 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:13:38,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:13:38,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1608161903, now seen corresponding path program 1 times [2022-07-13 11:13:38,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:13:38,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821549478] [2022-07-13 11:13:38,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:13:38,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:13:38,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:13:39,008 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:13:39,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:13:39,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821549478] [2022-07-13 11:13:39,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821549478] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:13:39,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676143165] [2022-07-13 11:13:39,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:13:39,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:13:39,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:13:39,010 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:13:39,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 11:13:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:13:39,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-13 11:13:39,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:13:39,067 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 18 treesize of output 14 [2022-07-13 11:13:39,091 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 15 treesize of output 7 [2022-07-13 11:13:39,096 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:13:39,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:13:39,114 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 14 treesize of output 12 [2022-07-13 11:13:39,116 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 22 treesize of output 20 [2022-07-13 11:13:39,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:13:39,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676143165] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:13:39,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:13:39,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-07-13 11:13:39,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074623376] [2022-07-13 11:13:39,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:13:39,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 11:13:39,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:13:39,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 11:13:39,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-13 11:13:39,126 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:13:39,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:13:39,188 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2022-07-13 11:13:39,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 11:13:39,188 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-13 11:13:39,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:13:39,191 INFO L225 Difference]: With dead ends: 49 [2022-07-13 11:13:39,191 INFO L226 Difference]: Without dead ends: 38 [2022-07-13 11:13:39,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-07-13 11:13:39,193 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:13:39,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 56 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:13:39,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-13 11:13:39,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-07-13 11:13:39,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:13:39,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2022-07-13 11:13:39,211 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 20 [2022-07-13 11:13:39,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:13:39,212 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2022-07-13 11:13:39,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:13:39,212 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-07-13 11:13:39,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 11:13:39,213 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:13:39,213 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:13:39,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 11:13:39,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-13 11:13:39,423 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:13:39,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:13:39,424 INFO L85 PathProgramCache]: Analyzing trace with hash -949569453, now seen corresponding path program 2 times [2022-07-13 11:13:39,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:13:39,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961530938] [2022-07-13 11:13:39,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:13:39,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:13:39,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:13:39,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:13:39,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:13:39,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961530938] [2022-07-13 11:13:39,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961530938] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:13:39,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813694354] [2022-07-13 11:13:39,483 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:13:39,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:13:39,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:13:39,485 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:13:39,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 11:13:39,530 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:13:39,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:13:39,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 11:13:39,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:13:39,565 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:13:39,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:13:39,586 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:13:39,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813694354] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:13:39,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:13:39,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-13 11:13:39,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884437732] [2022-07-13 11:13:39,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:13:39,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 11:13:39,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:13:39,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 11:13:39,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:13:39,588 INFO L87 Difference]: Start difference. First operand 35 states and 42 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-13 11:13:39,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:13:39,687 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2022-07-13 11:13:39,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 11:13:39,687 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 22 [2022-07-13 11:13:39,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:13:39,688 INFO L225 Difference]: With dead ends: 70 [2022-07-13 11:13:39,688 INFO L226 Difference]: Without dead ends: 44 [2022-07-13 11:13:39,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 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-13 11:13:39,690 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 54 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:13:39,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 31 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:13:39,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-13 11:13:39,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2022-07-13 11:13:39,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:13:39,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-07-13 11:13:39,697 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2022-07-13 11:13:39,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:13:39,697 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-07-13 11:13:39,698 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-13 11:13:39,698 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-07-13 11:13:39,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 11:13:39,698 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:13:39,698 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:13:39,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 11:13:39,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:13:39,915 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:13:39,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:13:39,915 INFO L85 PathProgramCache]: Analyzing trace with hash -2105967953, now seen corresponding path program 3 times [2022-07-13 11:13:39,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:13:39,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436025569] [2022-07-13 11:13:39,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:13:39,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:13:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:13:39,981 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:13:39,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:13:39,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436025569] [2022-07-13 11:13:39,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436025569] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:13:39,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721092288] [2022-07-13 11:13:39,981 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 11:13:39,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:13:39,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:13:39,983 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:13:39,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 11:13:40,027 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-13 11:13:40,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:13:40,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 11:13:40,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:13:40,070 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:13:40,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:13:40,099 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:13:40,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721092288] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:13:40,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:13:40,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-13 11:13:40,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977973441] [2022-07-13 11:13:40,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:13:40,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 11:13:40,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:13:40,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 11:13:40,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:13:40,101 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:13:40,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:13:40,188 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-07-13 11:13:40,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 11:13:40,189 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-13 11:13:40,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:13:40,190 INFO L225 Difference]: With dead ends: 39 [2022-07-13 11:13:40,190 INFO L226 Difference]: Without dead ends: 31 [2022-07-13 11:13:40,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-13 11:13:40,191 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 38 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:13:40,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 30 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:13:40,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-13 11:13:40,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-07-13 11:13:40,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 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-13 11:13:40,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-07-13 11:13:40,196 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 22 [2022-07-13 11:13:40,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:13:40,197 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-07-13 11:13:40,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:13:40,197 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-07-13 11:13:40,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-13 11:13:40,197 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:13:40,198 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:13:40,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 11:13:40,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:13:40,413 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:13:40,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:13:40,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1032594067, now seen corresponding path program 4 times [2022-07-13 11:13:40,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:13:40,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077180604] [2022-07-13 11:13:40,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:13:40,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:13:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:13:40,983 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:13:40,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:13:40,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077180604] [2022-07-13 11:13:40,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077180604] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:13:40,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018172194] [2022-07-13 11:13:40,984 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 11:13:40,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:13:40,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:13:40,986 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:13:40,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 11:13:41,033 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 11:13:41,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:13:41,035 WARN L261 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-13 11:13:41,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:13:41,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 11:13:41,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:41,069 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 14 treesize of output 16 [2022-07-13 11:13:41,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:41,098 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 14 treesize of output 16 [2022-07-13 11:13:41,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:41,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-13 11:13:41,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:41,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:41,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2022-07-13 11:13:41,499 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:13:41,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:41,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:41,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2022-07-13 11:13:41,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:41,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 39 [2022-07-13 11:13:41,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:41,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 34 [2022-07-13 11:13:41,708 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:13:41,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:13:42,416 INFO L356 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2022-07-13 11:13:42,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 137 treesize of output 73 [2022-07-13 11:13:42,428 WARN L833 $PredicateComparison]: unable to prove that (forall ((~N~0 Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_3 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (= (* 2 ~N~0) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_3))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse3))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (= (+ (- 1) .cse0) 1)) (not (= (+ (- 1) (select v_arrayElimArr_3 .cse4)) 1)) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0))))) is different from false [2022-07-13 11:13:42,443 WARN L833 $PredicateComparison]: unable to prove that (forall ((~N~0 Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_3 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (= (* 2 ~N~0) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_3))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse3))))) (not (= (+ (- 1) .cse0) 1)) (not (= (+ (- 1) (select v_arrayElimArr_3 .cse4)) 1))))) is different from false [2022-07-13 11:13:42,468 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-13 11:13:42,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018172194] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:13:42,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:13:42,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 49 [2022-07-13 11:13:42,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784175297] [2022-07-13 11:13:42,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:13:42,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-13 11:13:42,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:13:42,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-13 11:13:42,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=1863, Unknown=2, NotChecked=182, Total=2352 [2022-07-13 11:13:42,471 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 49 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 49 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-13 11:13:45,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:13:45,727 INFO L93 Difference]: Finished difference Result 77 states and 93 transitions. [2022-07-13 11:13:45,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-07-13 11:13:45,728 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 49 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-13 11:13:45,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:13:45,728 INFO L225 Difference]: With dead ends: 77 [2022-07-13 11:13:45,728 INFO L226 Difference]: Without dead ends: 72 [2022-07-13 11:13:45,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1845 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=842, Invalid=4864, Unknown=2, NotChecked=298, Total=6006 [2022-07-13 11:13:45,730 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 58 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 171 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 11:13:45,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 116 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 679 Invalid, 0 Unknown, 171 Unchecked, 0.6s Time] [2022-07-13 11:13:45,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-13 11:13:45,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 44. [2022-07-13 11:13:45,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:13:45,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-07-13 11:13:45,735 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 27 [2022-07-13 11:13:45,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:13:45,736 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-07-13 11:13:45,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 49 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-13 11:13:45,736 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-07-13 11:13:45,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-13 11:13:45,736 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:13:45,736 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, 1] [2022-07-13 11:13:45,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 11:13:45,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:13:45,959 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:13:45,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:13:45,959 INFO L85 PathProgramCache]: Analyzing trace with hash -774428629, now seen corresponding path program 1 times [2022-07-13 11:13:45,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:13:45,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62051235] [2022-07-13 11:13:45,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:13:45,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:13:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:13:46,082 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 11:13:46,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:13:46,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62051235] [2022-07-13 11:13:46,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62051235] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:13:46,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728184630] [2022-07-13 11:13:46,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:13:46,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:13:46,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:13:46,084 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:13:46,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 11:13:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:13:46,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-13 11:13:46,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:13:46,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 11:13:46,165 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-13 11:13:46,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-07-13 11:13:46,181 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 19 treesize of output 7 [2022-07-13 11:13:46,188 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 11:13:46,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:13:46,241 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 16 treesize of output 14 [2022-07-13 11:13:46,242 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 28 treesize of output 24 [2022-07-13 11:13:46,258 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 11:13:46,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728184630] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:13:46,258 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:13:46,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 18 [2022-07-13 11:13:46,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164113944] [2022-07-13 11:13:46,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:13:46,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-13 11:13:46,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:13:46,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-13 11:13:46,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-07-13 11:13:46,260 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:13:46,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:13:46,447 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-07-13 11:13:46,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 11:13:46,447 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-13 11:13:46,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:13:46,448 INFO L225 Difference]: With dead ends: 63 [2022-07-13 11:13:46,448 INFO L226 Difference]: Without dead ends: 50 [2022-07-13 11:13:46,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2022-07-13 11:13:46,449 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 24 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:13:46,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 54 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:13:46,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-13 11:13:46,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2022-07-13 11:13:46,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:13:46,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2022-07-13 11:13:46,454 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 27 [2022-07-13 11:13:46,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:13:46,454 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2022-07-13 11:13:46,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:13:46,454 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2022-07-13 11:13:46,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 11:13:46,455 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:13:46,455 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:13:46,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 11:13:46,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:13:46,664 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:13:46,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:13:46,664 INFO L85 PathProgramCache]: Analyzing trace with hash -132219249, now seen corresponding path program 5 times [2022-07-13 11:13:46,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:13:46,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404949211] [2022-07-13 11:13:46,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:13:46,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:13:46,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:13:46,726 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 11:13:46,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:13:46,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404949211] [2022-07-13 11:13:46,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404949211] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:13:46,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959704515] [2022-07-13 11:13:46,727 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 11:13:46,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:13:46,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:13:46,728 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:13:46,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 11:13:46,784 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-13 11:13:46,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:13:46,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 11:13:46,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:13:46,840 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 11:13:46,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:13:46,872 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 11:13:46,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959704515] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:13:46,872 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:13:46,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-13 11:13:46,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38469326] [2022-07-13 11:13:46,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:13:46,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 11:13:46,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:13:46,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 11:13:46,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-13 11:13:46,873 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:13:46,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:13:46,973 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2022-07-13 11:13:46,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 11:13:46,974 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-13 11:13:46,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:13:46,974 INFO L225 Difference]: With dead ends: 77 [2022-07-13 11:13:46,974 INFO L226 Difference]: Without dead ends: 43 [2022-07-13 11:13:46,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-07-13 11:13:46,975 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 60 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:13:46,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 35 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:13:46,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-13 11:13:46,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2022-07-13 11:13:46,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:13:46,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-07-13 11:13:46,978 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 29 [2022-07-13 11:13:46,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:13:46,978 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-07-13 11:13:46,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:13:46,978 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-07-13 11:13:46,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-13 11:13:46,978 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:13:46,978 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:13:46,994 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-13 11:13:47,187 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-13 11:13:47,187 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:13:47,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:13:47,188 INFO L85 PathProgramCache]: Analyzing trace with hash -863925553, now seen corresponding path program 6 times [2022-07-13 11:13:47,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:13:47,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114565599] [2022-07-13 11:13:47,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:13:47,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:13:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:13:47,251 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:13:47,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:13:47,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114565599] [2022-07-13 11:13:47,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114565599] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:13:47,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372173684] [2022-07-13 11:13:47,252 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-13 11:13:47,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:13:47,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:13:47,258 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-13 11:13:47,258 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-13 11:13:47,310 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-07-13 11:13:47,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:13:47,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 11:13:47,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:13:47,363 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:13:47,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:13:47,391 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:13:47,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372173684] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:13:47,391 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:13:47,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-13 11:13:47,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846252963] [2022-07-13 11:13:47,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:13:47,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 11:13:47,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:13:47,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 11:13:47,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-13 11:13:47,393 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:13:47,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:13:47,503 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-07-13 11:13:47,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 11:13:47,504 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-13 11:13:47,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:13:47,504 INFO L225 Difference]: With dead ends: 42 [2022-07-13 11:13:47,504 INFO L226 Difference]: Without dead ends: 38 [2022-07-13 11:13:47,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-07-13 11:13:47,505 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 62 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:13:47,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 23 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:13:47,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-13 11:13:47,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-07-13 11:13:47,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:13:47,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-07-13 11:13:47,508 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 32 [2022-07-13 11:13:47,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:13:47,509 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-07-13 11:13:47,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:13:47,509 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-07-13 11:13:47,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-13 11:13:47,509 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:13:47,510 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:13:47,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 11:13:47,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-13 11:13:47,712 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:13:47,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:13:47,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1250534543, now seen corresponding path program 7 times [2022-07-13 11:13:47,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:13:47,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854306915] [2022-07-13 11:13:47,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:13:47,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:13:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:13:48,736 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:13:48,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:13:48,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854306915] [2022-07-13 11:13:48,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854306915] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:13:48,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081004404] [2022-07-13 11:13:48,737 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-13 11:13:48,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:13:48,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:13:48,738 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:13:48,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 11:13:48,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:13:48,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 75 conjunts are in the unsatisfiable core [2022-07-13 11:13:48,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:13:48,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-13 11:13:48,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 11:13:48,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 14 treesize of output 16 [2022-07-13 11:13:48,858 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 14 treesize of output 16 [2022-07-13 11:13:48,890 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 14 treesize of output 16 [2022-07-13 11:13:49,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-13 11:13:49,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:49,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 39 [2022-07-13 11:13:49,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:49,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:49,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:49,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-07-13 11:13:49,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:49,417 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:13:49,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:49,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:49,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2022-07-13 11:13:49,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:49,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:49,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:49,525 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:13:49,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:49,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 53 [2022-07-13 11:13:49,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 48 [2022-07-13 11:13:49,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 37 [2022-07-13 11:13:49,743 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:13:49,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:13:51,770 INFO L356 Elim1Store]: treesize reduction 106, result has 21.5 percent of original size [2022-07-13 11:13:51,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 429 treesize of output 149 [2022-07-13 11:13:51,790 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_4 (Array Int Int)) (~N~0 Int)) (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_4 .cse0) 2)) (not (= (+ (- 1) (select v_arrayElimArr_4 .cse1)) 1)) (not (= (+ (- 1) .cse2) 1)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (= (* 2 ~N~0) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse5 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse5 .cse6)))))) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0))))) is different from false [2022-07-13 11:13:51,830 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_4 (Array Int Int)) (~N~0 Int)) (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (= (select v_arrayElimArr_4 .cse0) 2)) (not (= (+ (- 1) (select v_arrayElimArr_4 .cse1)) 1)) (not (= (+ (- 1) .cse2) 1)) (= (* 2 ~N~0) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse5 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse5 .cse6))))))))) is different from false [2022-07-13 11:13:51,873 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_4 (Array Int Int)) (~N~0 Int)) (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_4 .cse0) 2)) (not (= (+ (- 1) (select v_arrayElimArr_4 .cse1)) 1)) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (= (+ (- 1) .cse2) 1)) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (= (* 2 ~N~0) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse5 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse5 .cse6))))))))) is different from false [2022-07-13 11:13:51,931 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-13 11:13:51,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081004404] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:13:51,931 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:13:51,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 67 [2022-07-13 11:13:51,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717689516] [2022-07-13 11:13:51,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:13:51,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-07-13 11:13:51,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:13:51,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-07-13 11:13:51,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=508, Invalid=3533, Unknown=3, NotChecked=378, Total=4422 [2022-07-13 11:13:51,933 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 67 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 67 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:02,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:14:02,779 INFO L93 Difference]: Finished difference Result 99 states and 116 transitions. [2022-07-13 11:14:02,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-07-13 11:14:02,780 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 67 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-13 11:14:02,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:14:02,780 INFO L225 Difference]: With dead ends: 99 [2022-07-13 11:14:02,780 INFO L226 Difference]: Without dead ends: 81 [2022-07-13 11:14:02,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 103 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3573 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=1212, Invalid=9099, Unknown=3, NotChecked=606, Total=10920 [2022-07-13 11:14:02,783 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 83 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 1482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:14:02,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 130 Invalid, 1482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 1052 Invalid, 0 Unknown, 128 Unchecked, 1.1s Time] [2022-07-13 11:14:02,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-13 11:14:02,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 55. [2022-07-13 11:14:02,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 54 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:02,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2022-07-13 11:14:02,789 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 34 [2022-07-13 11:14:02,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:14:02,789 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2022-07-13 11:14:02,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 67 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:02,790 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-07-13 11:14:02,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-13 11:14:02,790 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:14:02,790 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:14:02,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-13 11:14:02,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:14:02,995 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:14:02,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:14:02,995 INFO L85 PathProgramCache]: Analyzing trace with hash 2033315503, now seen corresponding path program 2 times [2022-07-13 11:14:02,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:14:02,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075390063] [2022-07-13 11:14:02,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:14:02,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:14:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:14:03,121 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:14:03,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:14:03,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075390063] [2022-07-13 11:14:03,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075390063] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:14:03,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376861314] [2022-07-13 11:14:03,121 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:14:03,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:14:03,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:14:03,122 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:14:03,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-13 11:14:03,175 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:14:03,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:14:03,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-13 11:14:03,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:14:03,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 11:14:03,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:03,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-07-13 11:14:03,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:03,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-07-13 11:14:03,299 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 15 treesize of output 7 [2022-07-13 11:14:03,309 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:14:03,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:14:03,357 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 16 treesize of output 14 [2022-07-13 11:14:03,358 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 28 treesize of output 24 [2022-07-13 11:14:03,382 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:14:03,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376861314] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:14:03,382 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:14:03,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 27 [2022-07-13 11:14:03,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727679017] [2022-07-13 11:14:03,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:14:03,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-13 11:14:03,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:14:03,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-13 11:14:03,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2022-07-13 11:14:03,384 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:03,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:14:03,673 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2022-07-13 11:14:03,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-13 11:14:03,674 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-13 11:14:03,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:14:03,675 INFO L225 Difference]: With dead ends: 76 [2022-07-13 11:14:03,675 INFO L226 Difference]: Without dead ends: 61 [2022-07-13 11:14:03,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=245, Invalid=1315, Unknown=0, NotChecked=0, Total=1560 [2022-07-13 11:14:03,676 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 50 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:14:03,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 72 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:14:03,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-13 11:14:03,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2022-07-13 11:14:03,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:03,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2022-07-13 11:14:03,684 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 34 [2022-07-13 11:14:03,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:14:03,684 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2022-07-13 11:14:03,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:03,684 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-07-13 11:14:03,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 11:14:03,685 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:14:03,685 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:14:03,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-13 11:14:03,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-13 11:14:03,895 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:14:03,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:14:03,896 INFO L85 PathProgramCache]: Analyzing trace with hash 880380819, now seen corresponding path program 8 times [2022-07-13 11:14:03,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:14:03,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573413993] [2022-07-13 11:14:03,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:14:03,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:14:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:14:03,950 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:14:03,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:14:03,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573413993] [2022-07-13 11:14:03,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573413993] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:14:03,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776576929] [2022-07-13 11:14:03,950 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:14:03,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:14:03,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:14:03,951 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:14:03,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-13 11:14:04,005 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:14:04,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:14:04,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 11:14:04,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:14:04,070 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:14:04,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:14:04,101 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:14:04,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776576929] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:14:04,101 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:14:04,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-13 11:14:04,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486387212] [2022-07-13 11:14:04,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:14:04,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 11:14:04,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:14:04,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 11:14:04,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-13 11:14:04,102 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 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-13 11:14:04,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:14:04,269 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2022-07-13 11:14:04,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 11:14:04,270 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 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 36 [2022-07-13 11:14:04,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:14:04,270 INFO L225 Difference]: With dead ends: 86 [2022-07-13 11:14:04,270 INFO L226 Difference]: Without dead ends: 50 [2022-07-13 11:14:04,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2022-07-13 11:14:04,271 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 82 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:14:04,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 36 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:14:04,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-13 11:14:04,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. [2022-07-13 11:14:04,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:04,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-07-13 11:14:04,276 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 36 [2022-07-13 11:14:04,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:14:04,276 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-07-13 11:14:04,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 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-13 11:14:04,276 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-07-13 11:14:04,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-13 11:14:04,277 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:14:04,277 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:14:04,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-13 11:14:04,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-13 11:14:04,487 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:14:04,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:14:04,487 INFO L85 PathProgramCache]: Analyzing trace with hash 975408915, now seen corresponding path program 9 times [2022-07-13 11:14:04,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:14:04,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050712681] [2022-07-13 11:14:04,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:14:04,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:14:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:14:04,541 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 11:14:04,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:14:04,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050712681] [2022-07-13 11:14:04,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050712681] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:14:04,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950230180] [2022-07-13 11:14:04,543 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 11:14:04,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:14:04,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:14:04,544 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:14:04,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-13 11:14:04,618 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-13 11:14:04,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:14:04,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 11:14:04,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:14:04,691 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 19 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 11:14:04,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:14:04,721 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 19 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 11:14:04,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950230180] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:14:04,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:14:04,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-13 11:14:04,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190606436] [2022-07-13 11:14:04,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:14:04,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 11:14:04,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:14:04,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 11:14:04,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-13 11:14:04,722 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:04,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:14:04,862 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-07-13 11:14:04,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 11:14:04,862 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-13 11:14:04,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:14:04,863 INFO L225 Difference]: With dead ends: 49 [2022-07-13 11:14:04,863 INFO L226 Difference]: Without dead ends: 45 [2022-07-13 11:14:04,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-07-13 11:14:04,864 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 56 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:14:04,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 33 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:14:04,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-13 11:14:04,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-07-13 11:14:04,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 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-13 11:14:04,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-07-13 11:14:04,868 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 39 [2022-07-13 11:14:04,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:14:04,868 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-07-13 11:14:04,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:04,869 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-07-13 11:14:04,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-13 11:14:04,869 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:14:04,869 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:14:04,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-13 11:14:05,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-13 11:14:05,083 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:14:05,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:14:05,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1118330549, now seen corresponding path program 10 times [2022-07-13 11:14:05,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:14:05,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313046] [2022-07-13 11:14:05,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:14:05,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:14:05,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:14:06,520 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 1 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:14:06,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:14:06,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313046] [2022-07-13 11:14:06,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313046] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:14:06,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437783977] [2022-07-13 11:14:06,520 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 11:14:06,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:14:06,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:14:06,521 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:14:06,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-13 11:14:06,581 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 11:14:06,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:14:06,582 WARN L261 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 92 conjunts are in the unsatisfiable core [2022-07-13 11:14:06,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:14:06,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 11:14:06,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:06,637 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 14 treesize of output 16 [2022-07-13 11:14:06,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:06,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:14:06,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:06,724 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 14 treesize of output 16 [2022-07-13 11:14:06,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:06,762 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 14 treesize of output 16 [2022-07-13 11:14:06,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:06,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-13 11:14:07,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:07,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:07,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2022-07-13 11:14:07,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:07,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:07,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:07,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:07,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 51 [2022-07-13 11:14:07,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:07,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:07,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:07,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:07,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:07,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:07,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:07,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 63 [2022-07-13 11:14:07,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:07,530 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:14:07,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:07,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:07,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:07,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:07,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:07,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:07,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 67 [2022-07-13 11:14:07,651 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:14:07,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:07,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:07,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:07,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:07,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:07,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:07,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:07,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 66 [2022-07-13 11:14:07,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:07,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:07,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:07,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:07,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:07,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:07,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:07,780 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:14:07,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:07,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 71 [2022-07-13 11:14:07,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:07,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 63 [2022-07-13 11:14:07,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:14:07,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 40 [2022-07-13 11:14:08,034 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:14:08,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:14:14,682 INFO L356 Elim1Store]: treesize reduction 233, result has 14.3 percent of original size [2022-07-13 11:14:14,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 1159 treesize of output 287 [2022-07-13 11:14:14,713 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (~N~0 Int)) (let ((.cse2 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_5 .cse0) 2)) (not (= (+ (- 1) (select v_arrayElimArr_5 .cse1)) 1)) (not (= 2 (select v_arrayElimArr_5 .cse2))) (not (= (+ (- 1) .cse3) 1)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (= (* 2 ~N~0) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse4 .cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse3 .cse8))))))) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0))))) is different from false [2022-07-13 11:14:14,747 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (~N~0 Int)) (let ((.cse2 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_5 .cse0) 2)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (= (+ (- 1) (select v_arrayElimArr_5 .cse1)) 1)) (not (= 2 (select v_arrayElimArr_5 .cse2))) (not (= (+ (- 1) .cse3) 1)) (= (* 2 ~N~0) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse4 .cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse3 .cse8)))))))))) is different from false [2022-07-13 11:14:14,815 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (~N~0 Int)) (let ((.cse2 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_5 .cse0) 2)) (not (= (+ (- 1) (select v_arrayElimArr_5 .cse1)) 1)) (not (= 2 (select v_arrayElimArr_5 .cse2))) (not (= (+ (- 1) .cse3) 1)) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (= (* 2 ~N~0) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse4 .cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse3 .cse8)))))))))) is different from false [2022-07-13 11:14:14,879 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (~N~0 Int)) (let ((.cse2 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_5 .cse0) 2)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (not (= (+ (- 1) (select v_arrayElimArr_5 .cse1)) 1)) (not (= 2 (select v_arrayElimArr_5 .cse2))) (not (= (+ (- 1) .cse3) 1)) (= (* 2 ~N~0) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse4 .cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse3 .cse8))))))) (not (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0))))) is different from false [2022-07-13 11:14:14,924 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-07-13 11:14:14,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437783977] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:14:14,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:14:14,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 86 [2022-07-13 11:14:14,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427927178] [2022-07-13 11:14:14,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:14:14,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-07-13 11:14:14,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:14:14,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-07-13 11:14:14,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=819, Invalid=5835, Unknown=4, NotChecked=652, Total=7310 [2022-07-13 11:14:14,927 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 86 states, 86 states have (on average 1.302325581395349) internal successors, (112), 86 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:49,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:14:49,674 INFO L93 Difference]: Finished difference Result 114 states and 130 transitions. [2022-07-13 11:14:49,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-07-13 11:14:49,675 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 86 states have (on average 1.302325581395349) internal successors, (112), 86 states have internal predecessors, (112), 0 states have call successors, (0), 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 41 [2022-07-13 11:14:49,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:14:49,675 INFO L225 Difference]: With dead ends: 114 [2022-07-13 11:14:49,675 INFO L226 Difference]: Without dead ends: 94 [2022-07-13 11:14:49,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 120 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 4969 ImplicationChecksByTransitivity, 40.2s TimeCoverageRelationStatistics Valid=1531, Invalid=12287, Unknown=4, NotChecked=940, Total=14762 [2022-07-13 11:14:49,678 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 115 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 1513 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 2267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 1513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 321 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:14:49,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 162 Invalid, 2267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 1513 Invalid, 0 Unknown, 321 Unchecked, 2.2s Time] [2022-07-13 11:14:49,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-13 11:14:49,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 65. [2022-07-13 11:14:49,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.140625) internal successors, (73), 64 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:49,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2022-07-13 11:14:49,687 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 41 [2022-07-13 11:14:49,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:14:49,687 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2022-07-13 11:14:49,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 86 states have (on average 1.302325581395349) internal successors, (112), 86 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:14:49,688 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2022-07-13 11:14:49,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-13 11:14:49,688 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:14:49,688 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:14:49,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-13 11:14:49,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-13 11:14:49,895 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:14:49,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:14:49,896 INFO L85 PathProgramCache]: Analyzing trace with hash 97262195, now seen corresponding path program 3 times [2022-07-13 11:14:49,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:14:49,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255548057] [2022-07-13 11:14:49,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:14:49,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:14:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:14:50,080 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 11:14:50,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:14:50,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255548057] [2022-07-13 11:14:50,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255548057] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:14:50,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208145433] [2022-07-13 11:14:50,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 11:14:50,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:14:50,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:14:50,082 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:14:50,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-13 11:14:50,162 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-13 11:14:50,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:14:50,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-13 11:14:50,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:14:50,169 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-13 11:14:50,248 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-07-13 11:14:50,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 34 [2022-07-13 11:14:50,350 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-07-13 11:14:50,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 48 [2022-07-13 11:14:50,434 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-07-13 11:14:50,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 38 [2022-07-13 11:14:50,544 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:14:50,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2022-07-13 11:14:50,736 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 23 proven. 22 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:14:50,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:15:19,079 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 23 proven. 20 refuted. 2 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 11:15:19,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208145433] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:15:19,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:15:19,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 18] total 48 [2022-07-13 11:15:19,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799370161] [2022-07-13 11:15:19,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:15:19,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-13 11:15:19,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:15:19,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-13 11:15:19,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=1812, Unknown=24, NotChecked=0, Total=2256 [2022-07-13 11:15:19,085 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 48 states, 48 states have (on average 1.8333333333333333) internal successors, (88), 48 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:15:27,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:15:27,399 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2022-07-13 11:15:27,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-13 11:15:27,399 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.8333333333333333) internal successors, (88), 48 states have internal predecessors, (88), 0 states have call successors, (0), 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 41 [2022-07-13 11:15:27,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:15:27,400 INFO L225 Difference]: With dead ends: 96 [2022-07-13 11:15:27,400 INFO L226 Difference]: Without dead ends: 76 [2022-07-13 11:15:27,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1595 ImplicationChecksByTransitivity, 36.7s TimeCoverageRelationStatistics Valid=879, Invalid=4200, Unknown=33, NotChecked=0, Total=5112 [2022-07-13 11:15:27,401 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 40 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:15:27,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 49 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 247 Invalid, 0 Unknown, 75 Unchecked, 0.1s Time] [2022-07-13 11:15:27,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-13 11:15:27,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2022-07-13 11:15:27,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.1492537313432836) internal successors, (77), 67 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:15:27,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2022-07-13 11:15:27,411 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 41 [2022-07-13 11:15:27,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:15:27,411 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2022-07-13 11:15:27,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.8333333333333333) internal successors, (88), 48 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:15:27,411 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2022-07-13 11:15:27,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-13 11:15:27,412 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:15:27,412 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:15:27,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-13 11:15:27,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:15:27,623 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:15:27,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:15:27,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1027067351, now seen corresponding path program 11 times [2022-07-13 11:15:27,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:15:27,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918704572] [2022-07-13 11:15:27,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:15:27,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:15:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:15:27,691 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 11:15:27,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:15:27,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918704572] [2022-07-13 11:15:27,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918704572] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:15:27,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434956564] [2022-07-13 11:15:27,692 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 11:15:27,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:15:27,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:15:27,694 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:15:27,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-13 11:15:27,849 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-13 11:15:27,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:15:27,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 11:15:27,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:15:27,936 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 25 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 11:15:27,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:15:27,977 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 25 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 11:15:27,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434956564] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:15:27,978 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:15:27,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-07-13 11:15:27,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634545437] [2022-07-13 11:15:27,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:15:27,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-13 11:15:27,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:15:27,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-13 11:15:27,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-07-13 11:15:27,979 INFO L87 Difference]: Start difference. First operand 68 states and 77 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-13 11:15:28,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:15:28,138 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2022-07-13 11:15:28,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 11:15:28,139 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 43 [2022-07-13 11:15:28,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:15:28,139 INFO L225 Difference]: With dead ends: 109 [2022-07-13 11:15:28,139 INFO L226 Difference]: Without dead ends: 62 [2022-07-13 11:15:28,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2022-07-13 11:15:28,140 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 106 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:15:28,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 38 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:15:28,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-13 11:15:28,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2022-07-13 11:15:28,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 49 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:15:28,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-07-13 11:15:28,147 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 43 [2022-07-13 11:15:28,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:15:28,147 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-07-13 11:15:28,147 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-13 11:15:28,148 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-07-13 11:15:28,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-13 11:15:28,148 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:15:28,148 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:15:28,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-13 11:15:28,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-13 11:15:28,355 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:15:28,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:15:28,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1824213007, now seen corresponding path program 12 times [2022-07-13 11:15:28,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:15:28,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603862833] [2022-07-13 11:15:28,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:15:28,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:15:28,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:15:28,437 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 32 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-13 11:15:28,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:15:28,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603862833] [2022-07-13 11:15:28,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603862833] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:15:28,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700548215] [2022-07-13 11:15:28,438 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-13 11:15:28,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:15:28,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:15:28,439 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:15:28,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-13 11:15:28,551 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-07-13 11:15:28,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:15:28,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 11:15:28,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:15:28,634 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 22 proven. 29 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-13 11:15:28,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:15:28,671 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 22 proven. 29 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-13 11:15:28,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700548215] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:15:28,671 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:15:28,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-07-13 11:15:28,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675734826] [2022-07-13 11:15:28,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:15:28,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-13 11:15:28,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:15:28,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-13 11:15:28,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-07-13 11:15:28,672 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:15:28,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:15:28,846 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2022-07-13 11:15:28,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 11:15:28,846 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-07-13 11:15:28,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:15:28,847 INFO L225 Difference]: With dead ends: 61 [2022-07-13 11:15:28,847 INFO L226 Difference]: Without dead ends: 57 [2022-07-13 11:15:28,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2022-07-13 11:15:28,847 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 99 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:15:28,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 24 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:15:28,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-13 11:15:28,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2022-07-13 11:15:28,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 51 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:15:28,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2022-07-13 11:15:28,855 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 46 [2022-07-13 11:15:28,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:15:28,855 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2022-07-13 11:15:28,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:15:28,856 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-07-13 11:15:28,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-13 11:15:28,856 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:15:28,856 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:15:28,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-13 11:15:29,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-13 11:15:29,056 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:15:29,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:15:29,057 INFO L85 PathProgramCache]: Analyzing trace with hash 775276721, now seen corresponding path program 13 times [2022-07-13 11:15:29,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:15:29,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363000284] [2022-07-13 11:15:29,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:15:29,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:15:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:15:30,989 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:15:30,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:15:30,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363000284] [2022-07-13 11:15:30,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363000284] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:15:30,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139109834] [2022-07-13 11:15:30,990 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-13 11:15:30,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:15:30,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:15:30,991 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:15:30,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-13 11:15:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:15:31,065 WARN L261 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 115 conjunts are in the unsatisfiable core [2022-07-13 11:15:31,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:15:31,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 11:15:31,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-13 11:15:31,086 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 14 treesize of output 16 [2022-07-13 11:15:31,105 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 14 treesize of output 16 [2022-07-13 11:15:31,125 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 14 treesize of output 16 [2022-07-13 11:15:31,150 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 14 treesize of output 16 [2022-07-13 11:15:31,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:15:31,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-13 11:15:31,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:31,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 44 [2022-07-13 11:15:31,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:31,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:31,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:31,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 53 [2022-07-13 11:15:31,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:31,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:31,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:31,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:31,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:31,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:31,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 63 [2022-07-13 11:15:32,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 73 [2022-07-13 11:15:32,278 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:15:32,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 79 [2022-07-13 11:15:32,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,427 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:15:32,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 78 [2022-07-13 11:15:32,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,591 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:15:32,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 77 [2022-07-13 11:15:32,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,750 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:15:32,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:15:32,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 79 [2022-07-13 11:15:32,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 67 [2022-07-13 11:15:33,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 43 [2022-07-13 11:15:33,060 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:15:33,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:15:53,526 INFO L356 Elim1Store]: treesize reduction 420, result has 10.4 percent of original size [2022-07-13 11:15:53,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 2897 treesize of output 549 [2022-07-13 11:15:53,578 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (~N~0 Int)) (let ((.cse1 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse10 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_6 .cse0) 2)) (not (= (select v_arrayElimArr_6 .cse1) 2)) (not (= (+ (- 1) .cse2) 1)) (not (= 2 (select v_arrayElimArr_6 .cse3))) (= (* 2 ~N~0) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse6 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse9 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6 .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse2 .cse6 .cse7 .cse8 .cse9)))))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (= 2 (select v_arrayElimArr_6 .cse10))) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0))))) is different from false [2022-07-13 11:15:53,641 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (~N~0 Int)) (let ((.cse1 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse10 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_6 .cse0) 2)) (not (= (select v_arrayElimArr_6 .cse1) 2)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (= (+ (- 1) .cse2) 1)) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (= 2 (select v_arrayElimArr_6 .cse3))) (= (* 2 ~N~0) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse6 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse9 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6 .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse2 .cse6 .cse7 .cse8 .cse9)))))))) (not (= 2 (select v_arrayElimArr_6 .cse10)))))) is different from false [2022-07-13 11:15:53,757 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (~N~0 Int)) (let ((.cse1 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse10 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_6 .cse0) 2)) (not (= (select v_arrayElimArr_6 .cse1) 2)) (not (= (+ (- 1) .cse2) 1)) (not (= 2 (select v_arrayElimArr_6 .cse3))) (= (* 2 ~N~0) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse6 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse9 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6 .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse2 .cse6 .cse7 .cse8 .cse9)))))))) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (not (= 2 (select v_arrayElimArr_6 .cse10)))))) is different from false [2022-07-13 11:15:53,913 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (~N~0 Int)) (let ((.cse1 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse10 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_6 .cse0) 2)) (not (= (select v_arrayElimArr_6 .cse1) 2)) (not (= (+ (- 1) .cse2) 1)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (not (= 2 (select v_arrayElimArr_6 .cse3))) (= (* 2 ~N~0) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse6 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse9 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6 .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse2 .cse6 .cse7 .cse8 .cse9)))))))) (not (= 2 (select v_arrayElimArr_6 .cse10))) (not (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0))))) is different from false [2022-07-13 11:15:54,034 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (~N~0 Int)) (let ((.cse1 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse10 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_6 .cse0) 2)) (not (= (select v_arrayElimArr_6 .cse1) 2)) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0)) (not (= (+ (- 1) .cse2) 1)) (not (= 2 (select v_arrayElimArr_6 .cse3))) (= (* 2 ~N~0) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse6 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse9 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6 .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse2 .cse6 .cse7 .cse8 .cse9)))))))) (not (= 2 (select v_arrayElimArr_6 .cse10))) (< (+ 5 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)))) is different from false [2022-07-13 11:15:54,111 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 25 not checked. [2022-07-13 11:15:54,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139109834] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:15:54,112 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:15:54,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 36, 36] total 99 [2022-07-13 11:15:54,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124799364] [2022-07-13 11:15:54,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:15:54,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 99 states [2022-07-13 11:15:54,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:15:54,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2022-07-13 11:15:54,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=984, Invalid=7773, Unknown=5, NotChecked=940, Total=9702 [2022-07-13 11:15:54,114 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 99 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 99 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:18:12,511 WARN L233 SmtUtils]: Spent 1.23m on a formula simplification. DAG size of input: 270 DAG size of output: 262 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)