./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/merge_sort-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-manipulation/merge_sort-2.i -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 e47f94c757882803b8e19e21a897c3f5ab1653c3391e3b246153a1c416bdab7c --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 14:22:51,933 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 14:22:51,934 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 14:22:51,967 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 14:22:51,968 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 14:22:51,969 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 14:22:51,970 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 14:22:51,972 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 14:22:51,973 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 14:22:51,977 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 14:22:51,978 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 14:22:51,979 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 14:22:51,980 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 14:22:51,981 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 14:22:51,982 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 14:22:51,985 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 14:22:51,986 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 14:22:51,987 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 14:22:51,988 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 14:22:51,992 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 14:22:51,993 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 14:22:51,994 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 14:22:51,994 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 14:22:51,995 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 14:22:51,996 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 14:22:52,000 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 14:22:52,000 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 14:22:52,000 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 14:22:52,001 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 14:22:52,002 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 14:22:52,002 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 14:22:52,003 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 14:22:52,004 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 14:22:52,004 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 14:22:52,005 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 14:22:52,005 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 14:22:52,005 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 14:22:52,006 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 14:22:52,006 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 14:22:52,006 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 14:22:52,008 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 14:22:52,009 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 14:22:52,010 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 14:22:52,035 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 14:22:52,036 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 14:22:52,036 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 14:22:52,036 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 14:22:52,037 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 14:22:52,037 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 14:22:52,037 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 14:22:52,037 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 14:22:52,037 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 14:22:52,038 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 14:22:52,038 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 14:22:52,039 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 14:22:52,039 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 14:22:52,039 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 14:22:52,039 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 14:22:52,039 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 14:22:52,039 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 14:22:52,039 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 14:22:52,040 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 14:22:52,041 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 14:22:52,041 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 14:22:52,041 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 14:22:52,041 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 14:22:52,041 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 14:22:52,041 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:22:52,042 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 14:22:52,042 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 14:22:52,042 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 14:22:52,042 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 14:22:52,042 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 14:22:52,042 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 14:22:52,043 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 14:22:52,043 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 14:22:52,043 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 -> e47f94c757882803b8e19e21a897c3f5ab1653c3391e3b246153a1c416bdab7c [2022-07-19 14:22:52,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 14:22:52,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 14:22:52,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 14:22:52,301 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 14:22:52,302 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 14:22:52,303 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/merge_sort-2.i [2022-07-19 14:22:52,355 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/251305287/884527697bee45f9908371fa46fcc695/FLAG39974d71d [2022-07-19 14:22:52,749 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 14:22:52,750 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-2.i [2022-07-19 14:22:52,772 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/251305287/884527697bee45f9908371fa46fcc695/FLAG39974d71d [2022-07-19 14:22:53,145 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/251305287/884527697bee45f9908371fa46fcc695 [2022-07-19 14:22:53,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 14:22:53,148 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 14:22:53,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 14:22:53,152 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 14:22:53,155 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 14:22:53,155 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:22:53" (1/1) ... [2022-07-19 14:22:53,156 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@af68b55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:53, skipping insertion in model container [2022-07-19 14:22:53,156 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:22:53" (1/1) ... [2022-07-19 14:22:53,161 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 14:22:53,186 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 14:22:53,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/heap-manipulation/merge_sort-2.i[22632,22645] [2022-07-19 14:22:53,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:22:53,411 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 14:22:53,433 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/heap-manipulation/merge_sort-2.i[22632,22645] [2022-07-19 14:22:53,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:22:53,463 INFO L208 MainTranslator]: Completed translation [2022-07-19 14:22:53,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:53 WrapperNode [2022-07-19 14:22:53,463 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 14:22:53,464 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 14:22:53,464 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 14:22:53,464 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 14:22:53,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:53" (1/1) ... [2022-07-19 14:22:53,479 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:53" (1/1) ... [2022-07-19 14:22:53,497 INFO L137 Inliner]: procedures = 125, calls = 83, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 285 [2022-07-19 14:22:53,498 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 14:22:53,498 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 14:22:53,499 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 14:22:53,499 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 14:22:53,505 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:53" (1/1) ... [2022-07-19 14:22:53,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:53" (1/1) ... [2022-07-19 14:22:53,508 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:53" (1/1) ... [2022-07-19 14:22:53,509 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:53" (1/1) ... [2022-07-19 14:22:53,517 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:53" (1/1) ... [2022-07-19 14:22:53,523 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:53" (1/1) ... [2022-07-19 14:22:53,525 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:53" (1/1) ... [2022-07-19 14:22:53,528 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 14:22:53,531 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 14:22:53,531 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 14:22:53,532 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 14:22:53,532 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:53" (1/1) ... [2022-07-19 14:22:53,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:22:53,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:22:53,566 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 14:22:53,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 14:22:53,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 14:22:53,592 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2022-07-19 14:22:53,592 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2022-07-19 14:22:53,592 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2022-07-19 14:22:53,593 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2022-07-19 14:22:53,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 14:22:53,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 14:22:53,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 14:22:53,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 14:22:53,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 14:22:53,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 14:22:53,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 14:22:53,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 14:22:53,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 14:22:53,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 14:22:53,668 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 14:22:53,670 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 14:22:53,935 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 14:22:53,940 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 14:22:53,940 INFO L299 CfgBuilder]: Removed 33 assume(true) statements. [2022-07-19 14:22:53,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:22:53 BoogieIcfgContainer [2022-07-19 14:22:53,942 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 14:22:53,943 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 14:22:53,943 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 14:22:53,955 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 14:22:53,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 02:22:53" (1/3) ... [2022-07-19 14:22:53,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f8fd8d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:22:53, skipping insertion in model container [2022-07-19 14:22:53,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:53" (2/3) ... [2022-07-19 14:22:53,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f8fd8d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:22:53, skipping insertion in model container [2022-07-19 14:22:53,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:22:53" (3/3) ... [2022-07-19 14:22:53,964 INFO L111 eAbstractionObserver]: Analyzing ICFG merge_sort-2.i [2022-07-19 14:22:53,973 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 14:22:53,974 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 14:22:54,011 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 14:22:54,016 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@2395a99a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1fd1f83a [2022-07-19 14:22:54,018 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 14:22:54,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 77 states have (on average 1.8051948051948052) internal successors, (139), 93 states have internal predecessors, (139), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-19 14:22:54,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-19 14:22:54,035 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:54,036 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:22:54,036 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:54,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:54,040 INFO L85 PathProgramCache]: Analyzing trace with hash 2117458630, now seen corresponding path program 1 times [2022-07-19 14:22:54,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:22:54,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129374663] [2022-07-19 14:22:54,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:54,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:22:54,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:54,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-19 14:22:54,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:22:54,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129374663] [2022-07-19 14:22:54,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129374663] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:54,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:54,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 14:22:54,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812777681] [2022-07-19 14:22:54,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:54,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 14:22:54,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:22:54,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 14:22:54,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 14:22:54,211 INFO L87 Difference]: Start difference. First operand has 96 states, 77 states have (on average 1.8051948051948052) internal successors, (139), 93 states have internal predecessors, (139), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:22:54,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:54,245 INFO L93 Difference]: Finished difference Result 188 states and 335 transitions. [2022-07-19 14:22:54,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 14:22:54,247 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-19 14:22:54,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:54,256 INFO L225 Difference]: With dead ends: 188 [2022-07-19 14:22:54,257 INFO L226 Difference]: Without dead ends: 87 [2022-07-19 14:22:54,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 14:22:54,262 INFO L413 NwaCegarLoop]: 119 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, 119 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:54,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:22:54,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-19 14:22:54,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-07-19 14:22:54,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 84 states have internal predecessors, (93), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:22:54,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 110 transitions. [2022-07-19 14:22:54,306 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 110 transitions. Word has length 7 [2022-07-19 14:22:54,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:54,307 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 110 transitions. [2022-07-19 14:22:54,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:22:54,308 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2022-07-19 14:22:54,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-19 14:22:54,308 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:54,309 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:22:54,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 14:22:54,309 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:54,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:54,310 INFO L85 PathProgramCache]: Analyzing trace with hash 592840654, now seen corresponding path program 1 times [2022-07-19 14:22:54,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:22:54,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392105377] [2022-07-19 14:22:54,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:54,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:22:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:54,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:22:54,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:22:54,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392105377] [2022-07-19 14:22:54,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392105377] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:54,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:54,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 14:22:54,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289463062] [2022-07-19 14:22:54,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:54,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 14:22:54,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:22:54,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 14:22:54,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:22:54,371 INFO L87 Difference]: Start difference. First operand 87 states and 110 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:22:54,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:54,400 INFO L93 Difference]: Finished difference Result 172 states and 218 transitions. [2022-07-19 14:22:54,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 14:22:54,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-19 14:22:54,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:54,401 INFO L225 Difference]: With dead ends: 172 [2022-07-19 14:22:54,401 INFO L226 Difference]: Without dead ends: 93 [2022-07-19 14:22:54,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:22:54,403 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 4 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:54,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 212 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:22:54,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-19 14:22:54,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2022-07-19 14:22:54,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 86 states have internal predecessors, (95), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:22:54,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 112 transitions. [2022-07-19 14:22:54,409 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 112 transitions. Word has length 8 [2022-07-19 14:22:54,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:54,410 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 112 transitions. [2022-07-19 14:22:54,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:22:54,410 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 112 transitions. [2022-07-19 14:22:54,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-19 14:22:54,410 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:54,410 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:22:54,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 14:22:54,411 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:54,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:54,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1362713673, now seen corresponding path program 1 times [2022-07-19 14:22:54,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:22:54,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467482467] [2022-07-19 14:22:54,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:54,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:22:54,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:54,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:22:54,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:22:54,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467482467] [2022-07-19 14:22:54,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467482467] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:54,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:54,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 14:22:54,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742317394] [2022-07-19 14:22:54,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:54,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 14:22:54,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:22:54,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 14:22:54,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:22:54,483 INFO L87 Difference]: Start difference. First operand 89 states and 112 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:22:54,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:54,598 INFO L93 Difference]: Finished difference Result 235 states and 308 transitions. [2022-07-19 14:22:54,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 14:22:54,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-19 14:22:54,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:54,603 INFO L225 Difference]: With dead ends: 235 [2022-07-19 14:22:54,604 INFO L226 Difference]: Without dead ends: 230 [2022-07-19 14:22:54,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-19 14:22:54,607 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 516 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:54,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 276 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:22:54,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-07-19 14:22:54,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 92. [2022-07-19 14:22:54,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 89 states have internal predecessors, (99), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:22:54,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 115 transitions. [2022-07-19 14:22:54,627 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 115 transitions. Word has length 14 [2022-07-19 14:22:54,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:54,627 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 115 transitions. [2022-07-19 14:22:54,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:22:54,627 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 115 transitions. [2022-07-19 14:22:54,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-19 14:22:54,628 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:54,628 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:22:54,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 14:22:54,630 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:54,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:54,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1343418310, now seen corresponding path program 1 times [2022-07-19 14:22:54,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:22:54,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845204994] [2022-07-19 14:22:54,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:54,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:22:54,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:54,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 14:22:54,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:22:54,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845204994] [2022-07-19 14:22:54,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845204994] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:54,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:54,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 14:22:54,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511793817] [2022-07-19 14:22:54,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:54,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 14:22:54,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:22:54,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 14:22:54,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:22:54,735 INFO L87 Difference]: Start difference. First operand 92 states and 115 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:22:54,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:54,846 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2022-07-19 14:22:54,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 14:22:54,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-19 14:22:54,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:54,849 INFO L225 Difference]: With dead ends: 94 [2022-07-19 14:22:54,849 INFO L226 Difference]: Without dead ends: 91 [2022-07-19 14:22:54,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:22:54,851 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 11 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:54,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 319 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:22:54,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-19 14:22:54,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-07-19 14:22:54,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 76 states have (on average 1.2894736842105263) internal successors, (98), 88 states have internal predecessors, (98), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:22:54,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 113 transitions. [2022-07-19 14:22:54,859 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 113 transitions. Word has length 21 [2022-07-19 14:22:54,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:54,859 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 113 transitions. [2022-07-19 14:22:54,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:22:54,860 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 113 transitions. [2022-07-19 14:22:54,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-19 14:22:54,860 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:54,861 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:22:54,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 14:22:54,861 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:54,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:54,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1668834300, now seen corresponding path program 1 times [2022-07-19 14:22:54,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:22:54,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273180729] [2022-07-19 14:22:54,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:54,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:22:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:54,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 14:22:54,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:22:54,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273180729] [2022-07-19 14:22:54,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273180729] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:54,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:54,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 14:22:54,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198877853] [2022-07-19 14:22:54,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:54,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 14:22:54,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:22:54,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 14:22:54,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:22:54,915 INFO L87 Difference]: Start difference. First operand 91 states and 113 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:22:55,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:55,010 INFO L93 Difference]: Finished difference Result 118 states and 146 transitions. [2022-07-19 14:22:55,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 14:22:55,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-19 14:22:55,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:55,011 INFO L225 Difference]: With dead ends: 118 [2022-07-19 14:22:55,011 INFO L226 Difference]: Without dead ends: 115 [2022-07-19 14:22:55,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:22:55,012 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 38 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:55,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 284 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:22:55,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-19 14:22:55,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 90. [2022-07-19 14:22:55,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 76 states have (on average 1.2763157894736843) internal successors, (97), 87 states have internal predecessors, (97), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:22:55,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 111 transitions. [2022-07-19 14:22:55,019 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 111 transitions. Word has length 21 [2022-07-19 14:22:55,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:55,020 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 111 transitions. [2022-07-19 14:22:55,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:22:55,020 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 111 transitions. [2022-07-19 14:22:55,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-19 14:22:55,020 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:55,021 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:22:55,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 14:22:55,021 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:55,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:55,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1088949266, now seen corresponding path program 1 times [2022-07-19 14:22:55,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:22:55,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556548844] [2022-07-19 14:22:55,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:55,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:22:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:55,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:22:55,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:22:55,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556548844] [2022-07-19 14:22:55,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556548844] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:55,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:55,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 14:22:55,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552545739] [2022-07-19 14:22:55,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:55,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 14:22:55,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:22:55,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 14:22:55,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:22:55,094 INFO L87 Difference]: Start difference. First operand 90 states and 111 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:22:55,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:55,261 INFO L93 Difference]: Finished difference Result 195 states and 240 transitions. [2022-07-19 14:22:55,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 14:22:55,261 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-19 14:22:55,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:55,262 INFO L225 Difference]: With dead ends: 195 [2022-07-19 14:22:55,262 INFO L226 Difference]: Without dead ends: 192 [2022-07-19 14:22:55,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-19 14:22:55,263 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 348 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:55,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 283 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:22:55,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-07-19 14:22:55,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 96. [2022-07-19 14:22:55,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 93 states have internal predecessors, (103), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:22:55,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 117 transitions. [2022-07-19 14:22:55,271 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 117 transitions. Word has length 24 [2022-07-19 14:22:55,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:55,272 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 117 transitions. [2022-07-19 14:22:55,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:22:55,272 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 117 transitions. [2022-07-19 14:22:55,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-19 14:22:55,273 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:55,273 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:22:55,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 14:22:55,273 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:55,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:55,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1875885747, now seen corresponding path program 1 times [2022-07-19 14:22:55,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:22:55,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165287953] [2022-07-19 14:22:55,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:55,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:22:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:55,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:22:55,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:22:55,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165287953] [2022-07-19 14:22:55,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165287953] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:55,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:55,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 14:22:55,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681433711] [2022-07-19 14:22:55,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:55,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 14:22:55,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:22:55,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 14:22:55,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:22:55,319 INFO L87 Difference]: Start difference. First operand 96 states and 117 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:22:55,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:55,474 INFO L93 Difference]: Finished difference Result 194 states and 238 transitions. [2022-07-19 14:22:55,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 14:22:55,474 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-19 14:22:55,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:55,475 INFO L225 Difference]: With dead ends: 194 [2022-07-19 14:22:55,475 INFO L226 Difference]: Without dead ends: 191 [2022-07-19 14:22:55,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-19 14:22:55,476 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 345 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:55,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 283 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:22:55,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-07-19 14:22:55,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 102. [2022-07-19 14:22:55,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 88 states have (on average 1.2386363636363635) internal successors, (109), 99 states have internal predecessors, (109), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:22:55,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 123 transitions. [2022-07-19 14:22:55,483 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 123 transitions. Word has length 24 [2022-07-19 14:22:55,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:55,484 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 123 transitions. [2022-07-19 14:22:55,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:22:55,484 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 123 transitions. [2022-07-19 14:22:55,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-19 14:22:55,485 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:55,485 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:22:55,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 14:22:55,485 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:55,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:55,485 INFO L85 PathProgramCache]: Analyzing trace with hash 833312563, now seen corresponding path program 1 times [2022-07-19 14:22:55,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:22:55,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656042033] [2022-07-19 14:22:55,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:55,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:22:55,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:55,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:22:55,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:22:55,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656042033] [2022-07-19 14:22:55,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656042033] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:55,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:55,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 14:22:55,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5133300] [2022-07-19 14:22:55,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:55,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 14:22:55,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:22:55,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 14:22:55,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 14:22:55,559 INFO L87 Difference]: Start difference. First operand 102 states and 123 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:22:55,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:55,856 INFO L93 Difference]: Finished difference Result 264 states and 335 transitions. [2022-07-19 14:22:55,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 14:22:55,856 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-19 14:22:55,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:55,857 INFO L225 Difference]: With dead ends: 264 [2022-07-19 14:22:55,857 INFO L226 Difference]: Without dead ends: 261 [2022-07-19 14:22:55,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-07-19 14:22:55,858 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 527 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:55,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 331 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 14:22:55,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-07-19 14:22:55,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 105. [2022-07-19 14:22:55,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.2307692307692308) internal successors, (112), 102 states have internal predecessors, (112), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:22:55,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 126 transitions. [2022-07-19 14:22:55,866 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 126 transitions. Word has length 27 [2022-07-19 14:22:55,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:55,867 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 126 transitions. [2022-07-19 14:22:55,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:22:55,867 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2022-07-19 14:22:55,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-19 14:22:55,867 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:55,868 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:22:55,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 14:22:55,868 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:55,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:55,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1708085367, now seen corresponding path program 1 times [2022-07-19 14:22:55,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:22:55,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503459387] [2022-07-19 14:22:55,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:55,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:22:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:55,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:22:55,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:22:55,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503459387] [2022-07-19 14:22:55,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503459387] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:55,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:55,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 14:22:55,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974698861] [2022-07-19 14:22:55,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:55,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 14:22:55,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:22:55,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 14:22:55,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 14:22:55,945 INFO L87 Difference]: Start difference. First operand 105 states and 126 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:22:56,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:56,227 INFO L93 Difference]: Finished difference Result 263 states and 333 transitions. [2022-07-19 14:22:56,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 14:22:56,228 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-19 14:22:56,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:56,229 INFO L225 Difference]: With dead ends: 263 [2022-07-19 14:22:56,229 INFO L226 Difference]: Without dead ends: 260 [2022-07-19 14:22:56,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-07-19 14:22:56,230 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 523 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:56,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 331 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 14:22:56,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-07-19 14:22:56,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 108. [2022-07-19 14:22:56,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.2234042553191489) internal successors, (115), 105 states have internal predecessors, (115), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:22:56,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 129 transitions. [2022-07-19 14:22:56,237 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 129 transitions. Word has length 27 [2022-07-19 14:22:56,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:56,238 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 129 transitions. [2022-07-19 14:22:56,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:22:56,238 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 129 transitions. [2022-07-19 14:22:56,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-19 14:22:56,238 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:56,239 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:22:56,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 14:22:56,239 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:56,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:56,239 INFO L85 PathProgramCache]: Analyzing trace with hash -399551200, now seen corresponding path program 1 times [2022-07-19 14:22:56,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:22:56,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826960501] [2022-07-19 14:22:56,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:56,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:22:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:56,298 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 14:22:56,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:22:56,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826960501] [2022-07-19 14:22:56,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826960501] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:22:56,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711204550] [2022-07-19 14:22:56,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:56,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:22:56,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:22:56,300 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:22:56,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 14:22:56,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:56,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-19 14:22:56,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:22:56,451 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 31 treesize of output 19 [2022-07-19 14:22:56,453 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 25 treesize of output 13 [2022-07-19 14:22:56,463 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 14:22:56,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:22:56,539 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 14:22:56,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711204550] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:22:56,540 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:22:56,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-07-19 14:22:56,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450153675] [2022-07-19 14:22:56,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:22:56,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 14:22:56,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:22:56,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 14:22:56,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:22:56,541 INFO L87 Difference]: Start difference. First operand 108 states and 129 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:22:56,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:56,706 INFO L93 Difference]: Finished difference Result 110 states and 130 transitions. [2022-07-19 14:22:56,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 14:22:56,706 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-19 14:22:56,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:56,707 INFO L225 Difference]: With dead ends: 110 [2022-07-19 14:22:56,707 INFO L226 Difference]: Without dead ends: 106 [2022-07-19 14:22:56,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-19 14:22:56,707 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 84 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:56,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 280 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:22:56,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-19 14:22:56,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-07-19 14:22:56,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 94 states have (on average 1.202127659574468) internal successors, (113), 103 states have internal predecessors, (113), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:22:56,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 125 transitions. [2022-07-19 14:22:56,713 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 125 transitions. Word has length 32 [2022-07-19 14:22:56,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:56,713 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 125 transitions. [2022-07-19 14:22:56,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:22:56,713 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 125 transitions. [2022-07-19 14:22:56,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-19 14:22:56,714 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:56,714 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:22:56,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 14:22:56,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-19 14:22:56,931 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:56,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:56,931 INFO L85 PathProgramCache]: Analyzing trace with hash 2096511860, now seen corresponding path program 1 times [2022-07-19 14:22:56,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:22:56,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889687304] [2022-07-19 14:22:56,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:56,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:22:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:56,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:22:56,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:22:56,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889687304] [2022-07-19 14:22:56,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889687304] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:56,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:56,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 14:22:56,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730948618] [2022-07-19 14:22:56,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:56,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 14:22:56,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:22:56,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 14:22:56,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:22:56,967 INFO L87 Difference]: Start difference. First operand 106 states and 125 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:22:57,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:57,016 INFO L93 Difference]: Finished difference Result 146 states and 178 transitions. [2022-07-19 14:22:57,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 14:22:57,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-19 14:22:57,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:57,017 INFO L225 Difference]: With dead ends: 146 [2022-07-19 14:22:57,017 INFO L226 Difference]: Without dead ends: 143 [2022-07-19 14:22:57,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-19 14:22:57,017 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 271 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:57,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 325 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:22:57,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-19 14:22:57,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 110. [2022-07-19 14:22:57,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 107 states have internal predecessors, (118), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:22:57,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 130 transitions. [2022-07-19 14:22:57,024 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 130 transitions. Word has length 33 [2022-07-19 14:22:57,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:57,024 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 130 transitions. [2022-07-19 14:22:57,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:22:57,024 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 130 transitions. [2022-07-19 14:22:57,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-19 14:22:57,024 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:57,024 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:22:57,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 14:22:57,025 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:57,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:57,025 INFO L85 PathProgramCache]: Analyzing trace with hash -236025208, now seen corresponding path program 1 times [2022-07-19 14:22:57,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:22:57,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275753472] [2022-07-19 14:22:57,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:57,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:22:57,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:57,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:22:57,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:22:57,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275753472] [2022-07-19 14:22:57,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275753472] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:22:57,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655205998] [2022-07-19 14:22:57,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:57,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:22:57,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:22:57,144 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:22:57,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 14:22:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:57,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-19 14:22:57,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:22:57,398 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-19 14:22:57,402 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-19 14:22:57,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:22:57,405 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:22:57,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655205998] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:57,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 14:22:57,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 12 [2022-07-19 14:22:57,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417776690] [2022-07-19 14:22:57,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:57,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 14:22:57,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:22:57,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 14:22:57,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-19 14:22:57,406 INFO L87 Difference]: Start difference. First operand 110 states and 130 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:22:57,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:57,710 INFO L93 Difference]: Finished difference Result 199 states and 252 transitions. [2022-07-19 14:22:57,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 14:22:57,710 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-19 14:22:57,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:57,712 INFO L225 Difference]: With dead ends: 199 [2022-07-19 14:22:57,712 INFO L226 Difference]: Without dead ends: 196 [2022-07-19 14:22:57,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2022-07-19 14:22:57,712 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 344 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:57,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 521 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 14:22:57,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-07-19 14:22:57,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 119. [2022-07-19 14:22:57,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 107 states have (on average 1.1962616822429906) internal successors, (128), 116 states have internal predecessors, (128), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:22:57,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 140 transitions. [2022-07-19 14:22:57,722 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 140 transitions. Word has length 36 [2022-07-19 14:22:57,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:57,723 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 140 transitions. [2022-07-19 14:22:57,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:22:57,723 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 140 transitions. [2022-07-19 14:22:57,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-19 14:22:57,725 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:57,725 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:22:57,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 14:22:57,942 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,SelfDestructingSolverStorable11 [2022-07-19 14:22:57,943 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:57,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:57,943 INFO L85 PathProgramCache]: Analyzing trace with hash -73182163, now seen corresponding path program 1 times [2022-07-19 14:22:57,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:22:57,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299864422] [2022-07-19 14:22:57,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:57,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:22:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:58,067 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 14:22:58,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:22:58,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299864422] [2022-07-19 14:22:58,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299864422] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:22:58,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346404155] [2022-07-19 14:22:58,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:58,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:22:58,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:22:58,084 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:22:58,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 14:22:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:58,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-19 14:22:58,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:22:58,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:22:58,196 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 16 treesize of output 17 [2022-07-19 14:22:58,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:22:58,201 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 16 treesize of output 17 [2022-07-19 14:22:58,235 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-19 14:22:58,247 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 14:22:58,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:22:58,300 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 14:22:58,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346404155] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:22:58,300 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:22:58,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 13 [2022-07-19 14:22:58,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826267332] [2022-07-19 14:22:58,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:22:58,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-19 14:22:58,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:22:58,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-19 14:22:58,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-07-19 14:22:58,301 INFO L87 Difference]: Start difference. First operand 119 states and 140 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:22:58,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:58,546 INFO L93 Difference]: Finished difference Result 299 states and 366 transitions. [2022-07-19 14:22:58,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 14:22:58,547 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-19 14:22:58,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:58,548 INFO L225 Difference]: With dead ends: 299 [2022-07-19 14:22:58,548 INFO L226 Difference]: Without dead ends: 214 [2022-07-19 14:22:58,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-07-19 14:22:58,549 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 234 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:58,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 546 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 14:22:58,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-07-19 14:22:58,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 130. [2022-07-19 14:22:58,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 118 states have (on average 1.1864406779661016) internal successors, (140), 127 states have internal predecessors, (140), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:22:58,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 152 transitions. [2022-07-19 14:22:58,559 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 152 transitions. Word has length 38 [2022-07-19 14:22:58,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:58,559 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 152 transitions. [2022-07-19 14:22:58,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:22:58,559 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 152 transitions. [2022-07-19 14:22:58,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-19 14:22:58,560 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:58,560 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:22:58,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 14:22:58,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:22:58,778 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:58,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:58,779 INFO L85 PathProgramCache]: Analyzing trace with hash 490774160, now seen corresponding path program 1 times [2022-07-19 14:22:58,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:22:58,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231714681] [2022-07-19 14:22:58,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:58,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:22:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:58,816 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:22:58,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:22:58,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231714681] [2022-07-19 14:22:58,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231714681] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:58,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:58,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 14:22:58,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872635111] [2022-07-19 14:22:58,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:58,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 14:22:58,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:22:58,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 14:22:58,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:22:58,818 INFO L87 Difference]: Start difference. First operand 130 states and 152 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:22:58,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:58,895 INFO L93 Difference]: Finished difference Result 238 states and 298 transitions. [2022-07-19 14:22:58,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 14:22:58,896 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-19 14:22:58,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:58,897 INFO L225 Difference]: With dead ends: 238 [2022-07-19 14:22:58,897 INFO L226 Difference]: Without dead ends: 197 [2022-07-19 14:22:58,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-07-19 14:22:58,898 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 347 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:58,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 380 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:22:58,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-07-19 14:22:58,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 131. [2022-07-19 14:22:58,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 119 states have (on average 1.184873949579832) internal successors, (141), 128 states have internal predecessors, (141), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:22:58,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 153 transitions. [2022-07-19 14:22:58,910 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 153 transitions. Word has length 38 [2022-07-19 14:22:58,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:58,911 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 153 transitions. [2022-07-19 14:22:58,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:22:58,911 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 153 transitions. [2022-07-19 14:22:58,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-19 14:22:58,911 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:58,912 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:22:58,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-19 14:22:58,912 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:58,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:58,912 INFO L85 PathProgramCache]: Analyzing trace with hash -557560351, now seen corresponding path program 1 times [2022-07-19 14:22:58,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:22:58,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779177943] [2022-07-19 14:22:58,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:58,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:22:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:58,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:22:58,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:22:58,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779177943] [2022-07-19 14:22:58,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779177943] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:58,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:58,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 14:22:58,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535998840] [2022-07-19 14:22:58,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:58,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 14:22:58,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:22:58,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 14:22:58,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 14:22:58,957 INFO L87 Difference]: Start difference. First operand 131 states and 153 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:22:59,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:59,132 INFO L93 Difference]: Finished difference Result 165 states and 193 transitions. [2022-07-19 14:22:59,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 14:22:59,133 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-19 14:22:59,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:59,133 INFO L225 Difference]: With dead ends: 165 [2022-07-19 14:22:59,133 INFO L226 Difference]: Without dead ends: 162 [2022-07-19 14:22:59,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-07-19 14:22:59,134 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 239 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:59,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 331 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:22:59,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-19 14:22:59,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 137. [2022-07-19 14:22:59,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 125 states have (on average 1.184) internal successors, (148), 134 states have internal predecessors, (148), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:22:59,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 160 transitions. [2022-07-19 14:22:59,144 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 160 transitions. Word has length 39 [2022-07-19 14:22:59,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:59,144 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 160 transitions. [2022-07-19 14:22:59,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:22:59,144 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 160 transitions. [2022-07-19 14:22:59,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-19 14:22:59,145 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:59,145 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:22:59,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-19 14:22:59,145 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:59,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:59,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1187191262, now seen corresponding path program 1 times [2022-07-19 14:22:59,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:22:59,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346805482] [2022-07-19 14:22:59,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:59,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:22:59,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:59,192 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 14:22:59,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:22:59,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346805482] [2022-07-19 14:22:59,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346805482] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:59,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:59,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 14:22:59,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139706110] [2022-07-19 14:22:59,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:59,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 14:22:59,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:22:59,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 14:22:59,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-19 14:22:59,194 INFO L87 Difference]: Start difference. First operand 137 states and 160 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:22:59,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:59,439 INFO L93 Difference]: Finished difference Result 316 states and 415 transitions. [2022-07-19 14:22:59,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-19 14:22:59,439 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-19 14:22:59,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:59,441 INFO L225 Difference]: With dead ends: 316 [2022-07-19 14:22:59,441 INFO L226 Difference]: Without dead ends: 275 [2022-07-19 14:22:59,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2022-07-19 14:22:59,442 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 715 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:59,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 744 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:22:59,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-07-19 14:22:59,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 156. [2022-07-19 14:22:59,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 142 states have (on average 1.2183098591549295) internal successors, (173), 153 states have internal predecessors, (173), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-19 14:22:59,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 189 transitions. [2022-07-19 14:22:59,467 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 189 transitions. Word has length 39 [2022-07-19 14:22:59,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:59,467 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 189 transitions. [2022-07-19 14:22:59,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:22:59,467 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 189 transitions. [2022-07-19 14:22:59,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-19 14:22:59,468 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:59,468 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:22:59,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-19 14:22:59,468 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:59,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:59,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1447224354, now seen corresponding path program 1 times [2022-07-19 14:22:59,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:22:59,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809911357] [2022-07-19 14:22:59,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:59,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:22:59,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:59,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:22:59,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:22:59,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809911357] [2022-07-19 14:22:59,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809911357] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:22:59,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637529934] [2022-07-19 14:22:59,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:59,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:22:59,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:22:59,552 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:22:59,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 14:22:59,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:59,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-19 14:22:59,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:22:59,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:22:59,679 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 16 treesize of output 17 [2022-07-19 14:22:59,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:22:59,683 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 16 treesize of output 17 [2022-07-19 14:22:59,752 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-19 14:22:59,754 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-19 14:22:59,762 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:22:59,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:22:59,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:22:59,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637529934] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:22:59,831 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:22:59,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 10 [2022-07-19 14:22:59,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328918268] [2022-07-19 14:22:59,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:22:59,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 14:22:59,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:22:59,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 14:22:59,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-07-19 14:22:59,832 INFO L87 Difference]: Start difference. First operand 156 states and 189 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:22:59,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:59,922 INFO L93 Difference]: Finished difference Result 249 states and 306 transitions. [2022-07-19 14:22:59,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 14:22:59,922 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-19 14:22:59,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:59,923 INFO L225 Difference]: With dead ends: 249 [2022-07-19 14:22:59,923 INFO L226 Difference]: Without dead ends: 188 [2022-07-19 14:22:59,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-19 14:22:59,924 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 40 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:59,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 317 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:22:59,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-07-19 14:22:59,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 170. [2022-07-19 14:22:59,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 156 states have (on average 1.1987179487179487) internal successors, (187), 167 states have internal predecessors, (187), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-19 14:22:59,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 203 transitions. [2022-07-19 14:22:59,935 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 203 transitions. Word has length 42 [2022-07-19 14:22:59,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:59,935 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 203 transitions. [2022-07-19 14:22:59,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:22:59,935 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 203 transitions. [2022-07-19 14:22:59,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-19 14:22:59,936 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:59,936 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:22:59,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-19 14:23:00,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-19 14:23:00,154 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:23:00,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:23:00,154 INFO L85 PathProgramCache]: Analyzing trace with hash -600772010, now seen corresponding path program 2 times [2022-07-19 14:23:00,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:23:00,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827318224] [2022-07-19 14:23:00,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:23:00,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:23:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:00,383 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:23:00,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:23:00,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827318224] [2022-07-19 14:23:00,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827318224] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:23:00,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412685983] [2022-07-19 14:23:00,384 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 14:23:00,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:23:00,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:23:00,385 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:23:00,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 14:23:00,486 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 14:23:00,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:23:00,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-19 14:23:00,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:23:00,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-07-19 14:23:00,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:23:00,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-07-19 14:23:00,549 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 14:23:00,549 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-19 14:23:00,583 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 15 treesize of output 17 [2022-07-19 14:23:00,594 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-19 14:23:00,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-19 14:23:00,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:23:00,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-07-19 14:23:00,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:23:00,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2022-07-19 14:23:00,849 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-19 14:23:00,943 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 14:23:00,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 23 [2022-07-19 14:23:00,946 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:23:00,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:23:01,033 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.base_10| Int) (v_ArrVal_588 (Array Int Int))) (or (not (= 0 (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_588))) (store .cse0 |v_ULTIMATE.start_main_~item~0#1.base_10| (store (store (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_10|) 0 |c_ULTIMATE.start_main_~node~1#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_10|) 0)))) is different from false [2022-07-19 14:23:01,048 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.base_10| Int) (|v_ULTIMATE.start_main_~node~1#1.base_11| Int) (v_ArrVal_588 (Array Int Int))) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~node~1#1.base_11| 1) |v_ULTIMATE.start_main_~item~0#1.base_10|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~node~1#1.base_11|) 0)) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~1#1.base_11| v_ArrVal_588))) (store .cse0 |v_ULTIMATE.start_main_~item~0#1.base_10| (store (store (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_10|) 0 |v_ULTIMATE.start_main_~node~1#1.base_11|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) 0)))) is different from false [2022-07-19 14:23:01,091 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-19 14:23:01,092 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 2 case distinctions, treesize of input 51 treesize of output 44 [2022-07-19 14:23:01,095 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:23:01,100 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:23:01,100 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 163 treesize of output 157 [2022-07-19 14:23:01,104 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 142 treesize of output 138 [2022-07-19 14:23:01,133 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-19 14:23:01,137 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 134 treesize of output 126 [2022-07-19 14:23:01,283 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-19 14:23:01,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412685983] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:23:01,283 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:23:01,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 26 [2022-07-19 14:23:01,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691204789] [2022-07-19 14:23:01,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:23:01,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-19 14:23:01,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:23:01,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-19 14:23:01,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=485, Unknown=2, NotChecked=90, Total=650 [2022-07-19 14:23:01,285 INFO L87 Difference]: Start difference. First operand 170 states and 203 transitions. Second operand has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:23:02,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:23:02,402 INFO L93 Difference]: Finished difference Result 351 states and 437 transitions. [2022-07-19 14:23:02,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-19 14:23:02,403 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-07-19 14:23:02,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:23:02,404 INFO L225 Difference]: With dead ends: 351 [2022-07-19 14:23:02,404 INFO L226 Difference]: Without dead ends: 348 [2022-07-19 14:23:02,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=287, Invalid=977, Unknown=4, NotChecked=138, Total=1406 [2022-07-19 14:23:02,405 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 997 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 1368 SdHoareTripleChecker+Invalid, 1410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 665 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 14:23:02,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 1368 Invalid, 1410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 688 Invalid, 0 Unknown, 665 Unchecked, 0.4s Time] [2022-07-19 14:23:02,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-07-19 14:23:02,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 181. [2022-07-19 14:23:02,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 167 states have (on average 1.1916167664670658) internal successors, (199), 178 states have internal predecessors, (199), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-19 14:23:02,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 215 transitions. [2022-07-19 14:23:02,421 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 215 transitions. Word has length 44 [2022-07-19 14:23:02,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:23:02,421 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 215 transitions. [2022-07-19 14:23:02,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:23:02,421 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 215 transitions. [2022-07-19 14:23:02,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-19 14:23:02,421 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:23:02,421 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:23:02,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-19 14:23:02,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-19 14:23:02,641 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:23:02,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:23:02,647 INFO L85 PathProgramCache]: Analyzing trace with hash 186164471, now seen corresponding path program 1 times [2022-07-19 14:23:02,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:23:02,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204034064] [2022-07-19 14:23:02,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:23:02,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:23:02,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:02,882 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:23:02,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:23:02,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204034064] [2022-07-19 14:23:02,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204034064] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:23:02,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701405886] [2022-07-19 14:23:02,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:23:02,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:23:02,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:23:02,893 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:23:02,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-19 14:23:02,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:02,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-19 14:23:02,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:23:03,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-07-19 14:23:03,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:23:03,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-07-19 14:23:03,056 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:23:03,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-19 14:23:03,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-07-19 14:23:03,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:23:03,120 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-19 14:23:03,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 32 [2022-07-19 14:23:03,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:23:03,134 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 16 treesize of output 17 [2022-07-19 14:23:03,345 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-19 14:23:03,431 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:23:03,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 27 [2022-07-19 14:23:03,437 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:23:03,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:23:04,391 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~item~0#1.base| Int)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~node~1#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) |c_ULTIMATE.start_main_~data~0#1.base|)) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) 0))) is different from false [2022-07-19 14:23:04,404 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~item~0#1.base| Int) (v_ArrVal_695 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_695))) (store .cse0 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse0 |ULTIMATE.start_main_~item~0#1.base|) 0 |c_ULTIMATE.start_main_~node~1#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) 0))) is different from false [2022-07-19 14:23:04,455 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-19 14:23:04,456 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 2 case distinctions, treesize of input 51 treesize of output 44 [2022-07-19 14:23:04,465 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:23:04,465 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 319 treesize of output 309 [2022-07-19 14:23:04,491 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 670 treesize of output 646 [2022-07-19 14:23:04,569 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 123 treesize of output 115 [2022-07-19 14:23:04,642 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-19 14:23:04,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701405886] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:23:04,642 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:23:04,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 25 [2022-07-19 14:23:04,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997123798] [2022-07-19 14:23:04,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:23:04,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-19 14:23:04,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:23:04,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-19 14:23:04,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=440, Unknown=2, NotChecked=86, Total=600 [2022-07-19 14:23:04,645 INFO L87 Difference]: Start difference. First operand 181 states and 215 transitions. Second operand has 25 states, 25 states have (on average 4.24) internal successors, (106), 25 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:23:04,725 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~node~1#1.offset| 0) (not (= |c_ULTIMATE.start_main_~node~1#1.base| |c_ULTIMATE.start_main_~data~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1.offset| 0) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base|) 0) 0)) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~item~0#1.base| Int) (v_ArrVal_695 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_695))) (store .cse0 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse0 |ULTIMATE.start_main_~item~0#1.base|) 0 |c_ULTIMATE.start_main_~node~1#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_main_~data~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~node~1#1.base| 0))) is different from false [2022-07-19 14:23:04,742 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~node~1#1.offset| 0) (not (= |c_ULTIMATE.start_main_~node~1#1.base| |c_ULTIMATE.start_main_~data~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1.offset| 0) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base|) 0) 0)) (forall ((|ULTIMATE.start_main_~item~0#1.base| Int) (v_ArrVal_695 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_695))) (store .cse0 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse0 |ULTIMATE.start_main_~item~0#1.base|) 0 |c_ULTIMATE.start_main_~node~1#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) 0))) (not (= |c_ULTIMATE.start_main_~node~1#1.base| 0))) is different from false [2022-07-19 14:23:05,618 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~node~1#1.offset| 0) (not (= |c_ULTIMATE.start_main_~node~1#1.base| |c_ULTIMATE.start_main_~data~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1.offset| 0) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base|) 0) 0)) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base|) 1) (forall ((|ULTIMATE.start_main_~item~0#1.base| Int)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~node~1#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) |c_ULTIMATE.start_main_~data~0#1.base|)) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) 0))) (not (= |c_ULTIMATE.start_main_~node~1#1.base| 0))) is different from false [2022-07-19 14:23:05,655 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (let ((.cse4 (select .cse1 .cse3)) (.cse0 (select .cse1 |c_ULTIMATE.start_main_~data~0#1.offset|))) (and (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~node~1#1.offset| 0) (not (= |c_ULTIMATE.start_main_~node~1#1.base| |c_ULTIMATE.start_main_~data~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1.offset| 0) (not (= (select .cse1 0) 0)) (forall ((|ULTIMATE.start_main_~item~0#1.base| Int) (v_ArrVal_695 (Array Int Int))) (not (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_695))) (store .cse2 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse2 |ULTIMATE.start_main_~item~0#1.base|) 0 |c_ULTIMATE.start_main_~node~1#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) 0))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~data~0#1.base|) .cse3) 0) (not (= (select (select |c_#memory_$Pointer$.base| .cse4) 0) 0)) (= (select |c_#valid| |c_ULTIMATE.start_main_~data~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~node~1#1.base| 0)) (not (= .cse4 .cse0))))) is different from false [2022-07-19 14:23:06,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:23:06,171 INFO L93 Difference]: Finished difference Result 231 states and 275 transitions. [2022-07-19 14:23:06,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-19 14:23:06,172 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.24) internal successors, (106), 25 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-07-19 14:23:06,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:23:06,173 INFO L225 Difference]: With dead ends: 231 [2022-07-19 14:23:06,173 INFO L226 Difference]: Without dead ends: 228 [2022-07-19 14:23:06,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=176, Invalid=772, Unknown=6, NotChecked=378, Total=1332 [2022-07-19 14:23:06,174 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 372 mSDsluCounter, 1213 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 480 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 14:23:06,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 1306 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 613 Invalid, 0 Unknown, 480 Unchecked, 0.4s Time] [2022-07-19 14:23:06,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-07-19 14:23:06,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 188. [2022-07-19 14:23:06,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 174 states have (on average 1.1839080459770115) internal successors, (206), 185 states have internal predecessors, (206), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-19 14:23:06,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 222 transitions. [2022-07-19 14:23:06,196 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 222 transitions. Word has length 44 [2022-07-19 14:23:06,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:23:06,197 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 222 transitions. [2022-07-19 14:23:06,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.24) internal successors, (106), 25 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:23:06,197 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 222 transitions. [2022-07-19 14:23:06,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-19 14:23:06,198 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:23:06,198 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:23:06,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-19 14:23:06,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:23:06,415 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:23:06,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:23:06,416 INFO L85 PathProgramCache]: Analyzing trace with hash -498608819, now seen corresponding path program 1 times [2022-07-19 14:23:06,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:23:06,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361324124] [2022-07-19 14:23:06,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:23:06,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:23:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:06,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 14:23:06,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:23:06,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361324124] [2022-07-19 14:23:06,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361324124] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:23:06,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:23:06,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 14:23:06,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704731279] [2022-07-19 14:23:06,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:23:06,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 14:23:06,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:23:06,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 14:23:06,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:23:06,466 INFO L87 Difference]: Start difference. First operand 188 states and 222 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:23:06,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:23:06,539 INFO L93 Difference]: Finished difference Result 190 states and 223 transitions. [2022-07-19 14:23:06,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 14:23:06,541 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-07-19 14:23:06,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:23:06,542 INFO L225 Difference]: With dead ends: 190 [2022-07-19 14:23:06,542 INFO L226 Difference]: Without dead ends: 153 [2022-07-19 14:23:06,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:23:06,542 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 1 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:23:06,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 325 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:23:06,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-19 14:23:06,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2022-07-19 14:23:06,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 140 states have (on average 1.1928571428571428) internal successors, (167), 150 states have internal predecessors, (167), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-19 14:23:06,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 182 transitions. [2022-07-19 14:23:06,553 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 182 transitions. Word has length 45 [2022-07-19 14:23:06,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:23:06,553 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 182 transitions. [2022-07-19 14:23:06,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:23:06,554 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 182 transitions. [2022-07-19 14:23:06,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-19 14:23:06,554 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:23:06,554 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:23:06,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-19 14:23:06,554 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:23:06,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:23:06,555 INFO L85 PathProgramCache]: Analyzing trace with hash -636511633, now seen corresponding path program 1 times [2022-07-19 14:23:06,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:23:06,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9792510] [2022-07-19 14:23:06,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:23:06,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:23:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:06,970 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:23:06,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:23:06,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9792510] [2022-07-19 14:23:06,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9792510] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:23:06,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413832991] [2022-07-19 14:23:06,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:23:06,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:23:06,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:23:06,972 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:23:06,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-19 14:23:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:23:07,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 93 conjunts are in the unsatisfiable core [2022-07-19 14:23:07,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:23:07,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-07-19 14:23:07,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:23:07,153 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 16 treesize of output 17 [2022-07-19 14:23:07,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:23:07,158 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 16 treesize of output 17 [2022-07-19 14:23:07,199 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:23:07,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-19 14:23:07,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-19 14:23:07,245 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 16 treesize of output 18 [2022-07-19 14:23:07,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:23:07,289 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:23:07,296 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-19 14:23:07,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 31 [2022-07-19 14:23:07,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:23:07,309 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:23:07,317 INFO L356 Elim1Store]: treesize reduction 68, result has 28.4 percent of original size [2022-07-19 14:23:07,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 49 [2022-07-19 14:23:08,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:23:08,227 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:23:08,243 INFO L356 Elim1Store]: treesize reduction 93, result has 13.1 percent of original size [2022-07-19 14:23:08,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 14 case distinctions, treesize of input 129 treesize of output 80 [2022-07-19 14:23:08,257 INFO L356 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2022-07-19 14:23:08,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 28 [2022-07-19 14:23:08,261 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:23:08,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:23:10,786 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~item~0#1.base| Int) (v_ArrVal_833 Int)) (let ((.cse7 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| v_ArrVal_833) .cse7 |c_ULTIMATE.start_main_~data~0#1.base|))) (.cse3 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~node~1#1.offset|) .cse7 |c_ULTIMATE.start_main_~data~0#1.offset|)))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~data~0#1.base|)) (.cse0 (select .cse6 |c_ULTIMATE.start_main_~data~0#1.base|))) (or (let ((.cse1 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (and (= (select .cse0 .cse1) 0) (= (select .cse2 .cse1) 0))) (not (= (select (select .cse3 v_ArrVal_833) |c_ULTIMATE.start_main_~node~1#1.offset|) 0)) (let ((.cse4 (select .cse0 |c_ULTIMATE.start_main_~data~0#1.offset|)) (.cse5 (select .cse2 |c_ULTIMATE.start_main_~data~0#1.offset|))) (and (= (select (select .cse3 .cse4) .cse5) 0) (= (select (select .cse6 .cse4) .cse5) 0))) (not (= (select (select .cse6 v_ArrVal_833) |c_ULTIMATE.start_main_~node~1#1.offset|) 0))))))) is different from false [2022-07-19 14:23:11,238 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~item~0#1.base| Int) (v_ArrVal_829 (Array Int Int)) (v_ArrVal_833 Int) (v_ArrVal_830 (Array Int Int))) (let ((.cse0 (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_830))) (store .cse8 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse8 |ULTIMATE.start_main_~item~0#1.base|) 0 v_ArrVal_833) 4 |c_ULTIMATE.start_main_~data~0#1.base|)))) (.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_829))) (store .cse7 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse7 |ULTIMATE.start_main_~item~0#1.base|) 0 |c_ULTIMATE.start_main_~node~1#1.offset|) 4 |c_ULTIMATE.start_main_~data~0#1.offset|))))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~data~0#1.base|)) (.cse1 (select .cse0 |c_ULTIMATE.start_main_~data~0#1.base|))) (or (not (= (select (select .cse0 v_ArrVal_833) |c_ULTIMATE.start_main_~node~1#1.offset|) 0)) (let ((.cse2 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (and (= (select .cse1 .cse2) 0) (= (select .cse3 .cse2) 0))) (let ((.cse4 (select .cse1 |c_ULTIMATE.start_main_~data~0#1.offset|)) (.cse5 (select .cse3 |c_ULTIMATE.start_main_~data~0#1.offset|))) (and (= (select (select .cse0 .cse4) .cse5) 0) (= (select (select .cse6 .cse4) .cse5) 0))) (not (= (select (select .cse6 v_ArrVal_833) |c_ULTIMATE.start_main_~node~1#1.offset|) 0)))))) is different from false [2022-07-19 14:23:15,436 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:23:15,442 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:23:15,443 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 446 treesize of output 334 [2022-07-19 14:23:15,465 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:23:15,471 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:23:15,472 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 342 treesize of output 230 [2022-07-19 14:23:15,693 INFO L356 Elim1Store]: treesize reduction 48, result has 79.0 percent of original size [2022-07-19 14:23:15,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 4287 treesize of output 4195 [2022-07-19 14:23:16,003 INFO L356 Elim1Store]: treesize reduction 84, result has 70.9 percent of original size [2022-07-19 14:23:16,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 62803 treesize of output 58407 [2022-07-19 14:23:16,937 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:23:17,125 INFO L356 Elim1Store]: treesize reduction 8, result has 95.3 percent of original size [2022-07-19 14:23:17,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 98545 treesize of output 91483 [2022-07-19 14:23:20,078 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:23:20,301 INFO L356 Elim1Store]: treesize reduction 8, result has 95.3 percent of original size [2022-07-19 14:23:20,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 99238 treesize of output 94816 [2022-07-19 14:23:43,657 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-19 14:27:19,005 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-19 14:27:23,220 WARN L234 Elim1Store]: Array PQE input equivalent to true