./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 35987657 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-?-3598765 [2022-07-21 01:58:32,537 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 01:58:32,539 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 01:58:32,564 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 01:58:32,564 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 01:58:32,565 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 01:58:32,566 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 01:58:32,567 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 01:58:32,575 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 01:58:32,576 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 01:58:32,576 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 01:58:32,577 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 01:58:32,577 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 01:58:32,578 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 01:58:32,579 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 01:58:32,579 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 01:58:32,580 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 01:58:32,580 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 01:58:32,581 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 01:58:32,583 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 01:58:32,583 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 01:58:32,584 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 01:58:32,585 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 01:58:32,585 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 01:58:32,586 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 01:58:32,588 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 01:58:32,588 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 01:58:32,588 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 01:58:32,589 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 01:58:32,589 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 01:58:32,590 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 01:58:32,590 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 01:58:32,590 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 01:58:32,591 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 01:58:32,591 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 01:58:32,592 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 01:58:32,592 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 01:58:32,593 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 01:58:32,593 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 01:58:32,593 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 01:58:32,594 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 01:58:32,594 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 01:58:32,595 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 01:58:32,609 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 01:58:32,609 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 01:58:32,610 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 01:58:32,610 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 01:58:32,610 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 01:58:32,611 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 01:58:32,611 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 01:58:32,611 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 01:58:32,612 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 01:58:32,612 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 01:58:32,612 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 01:58:32,612 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 01:58:32,612 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 01:58:32,613 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 01:58:32,613 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 01:58:32,613 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 01:58:32,613 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 01:58:32,613 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 01:58:32,613 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 01:58:32,614 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 01:58:32,614 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 01:58:32,614 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 01:58:32,614 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 01:58:32,614 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 01:58:32,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:58:32,615 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 01:58:32,615 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 01:58:32,615 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 01:58:32,615 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 01:58:32,615 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 01:58:32,615 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 01:58:32,616 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 01:58:32,616 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 01:58:32,616 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-21 01:58:32,892 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 01:58:32,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 01:58:32,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 01:58:32,920 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 01:58:32,920 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 01:58:32,922 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-21 01:58:32,964 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/191da7887/45f27588413149cfad69860aa1b3f4cd/FLAG92ed58eeb [2022-07-21 01:58:33,401 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 01:58:33,402 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-2.i [2022-07-21 01:58:33,415 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/191da7887/45f27588413149cfad69860aa1b3f4cd/FLAG92ed58eeb [2022-07-21 01:58:33,430 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/191da7887/45f27588413149cfad69860aa1b3f4cd [2022-07-21 01:58:33,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 01:58:33,435 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 01:58:33,437 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 01:58:33,437 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 01:58:33,440 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 01:58:33,440 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:58:33" (1/1) ... [2022-07-21 01:58:33,441 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1825f48e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:33, skipping insertion in model container [2022-07-21 01:58:33,441 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:58:33" (1/1) ... [2022-07-21 01:58:33,446 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 01:58:33,483 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 01:58:33,726 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-21 01:58:33,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:58:33,774 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 01:58:33,810 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-21 01:58:33,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:58:33,847 INFO L208 MainTranslator]: Completed translation [2022-07-21 01:58:33,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:33 WrapperNode [2022-07-21 01:58:33,847 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 01:58:33,848 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 01:58:33,848 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 01:58:33,848 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 01:58:33,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:33" (1/1) ... [2022-07-21 01:58:33,862 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:33" (1/1) ... [2022-07-21 01:58:33,885 INFO L137 Inliner]: procedures = 125, calls = 83, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 285 [2022-07-21 01:58:33,885 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 01:58:33,885 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 01:58:33,885 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 01:58:33,885 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 01:58:33,895 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:33" (1/1) ... [2022-07-21 01:58:33,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:33" (1/1) ... [2022-07-21 01:58:33,910 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:33" (1/1) ... [2022-07-21 01:58:33,910 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:33" (1/1) ... [2022-07-21 01:58:33,918 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:33" (1/1) ... [2022-07-21 01:58:33,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:33" (1/1) ... [2022-07-21 01:58:33,937 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:33" (1/1) ... [2022-07-21 01:58:33,940 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 01:58:33,941 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 01:58:33,941 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 01:58:33,941 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 01:58:33,942 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:33" (1/1) ... [2022-07-21 01:58:33,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:58:33,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:58:33,974 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-21 01:58:33,997 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-21 01:58:34,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 01:58:34,014 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2022-07-21 01:58:34,014 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2022-07-21 01:58:34,015 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2022-07-21 01:58:34,015 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2022-07-21 01:58:34,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 01:58:34,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 01:58:34,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 01:58:34,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 01:58:34,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 01:58:34,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 01:58:34,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 01:58:34,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 01:58:34,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 01:58:34,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 01:58:34,117 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 01:58:34,118 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 01:58:34,458 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 01:58:34,469 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 01:58:34,472 INFO L299 CfgBuilder]: Removed 33 assume(true) statements. [2022-07-21 01:58:34,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:58:34 BoogieIcfgContainer [2022-07-21 01:58:34,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 01:58:34,475 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 01:58:34,476 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 01:58:34,478 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 01:58:34,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 01:58:33" (1/3) ... [2022-07-21 01:58:34,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f0bfb67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:58:34, skipping insertion in model container [2022-07-21 01:58:34,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:33" (2/3) ... [2022-07-21 01:58:34,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f0bfb67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:58:34, skipping insertion in model container [2022-07-21 01:58:34,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:58:34" (3/3) ... [2022-07-21 01:58:34,481 INFO L111 eAbstractionObserver]: Analyzing ICFG merge_sort-2.i [2022-07-21 01:58:34,492 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 01:58:34,493 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 01:58:34,541 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 01:58:34,548 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@595dcc67, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@15f03ed1 [2022-07-21 01:58:34,548 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 01:58:34,552 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-21 01:58:34,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-21 01:58:34,557 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:34,557 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:58:34,558 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:34,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:34,562 INFO L85 PathProgramCache]: Analyzing trace with hash 2117458630, now seen corresponding path program 1 times [2022-07-21 01:58:34,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:34,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638033959] [2022-07-21 01:58:34,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:34,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:34,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:34,654 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-21 01:58:34,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:34,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638033959] [2022-07-21 01:58:34,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638033959] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:58:34,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:58:34,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 01:58:34,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27894615] [2022-07-21 01:58:34,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:58:34,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 01:58:34,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:34,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 01:58:34,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 01:58:34,700 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-21 01:58:34,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:34,721 INFO L93 Difference]: Finished difference Result 188 states and 335 transitions. [2022-07-21 01:58:34,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 01:58:34,723 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-21 01:58:34,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:34,730 INFO L225 Difference]: With dead ends: 188 [2022-07-21 01:58:34,730 INFO L226 Difference]: Without dead ends: 87 [2022-07-21 01:58:34,733 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-21 01:58:34,736 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-21 01:58:34,736 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-21 01:58:34,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-21 01:58:34,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-07-21 01:58:34,762 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-21 01:58:34,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 110 transitions. [2022-07-21 01:58:34,764 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 110 transitions. Word has length 7 [2022-07-21 01:58:34,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:34,764 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 110 transitions. [2022-07-21 01:58:34,765 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-21 01:58:34,765 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2022-07-21 01:58:34,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-21 01:58:34,765 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:34,765 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:58:34,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 01:58:34,766 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:34,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:34,766 INFO L85 PathProgramCache]: Analyzing trace with hash 592840654, now seen corresponding path program 1 times [2022-07-21 01:58:34,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:34,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960849128] [2022-07-21 01:58:34,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:34,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:34,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:34,799 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-21 01:58:34,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:34,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960849128] [2022-07-21 01:58:34,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960849128] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:58:34,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:58:34,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 01:58:34,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165395469] [2022-07-21 01:58:34,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:58:34,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 01:58:34,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:34,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 01:58:34,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 01:58:34,802 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-21 01:58:34,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:34,838 INFO L93 Difference]: Finished difference Result 172 states and 218 transitions. [2022-07-21 01:58:34,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 01:58:34,839 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-21 01:58:34,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:34,840 INFO L225 Difference]: With dead ends: 172 [2022-07-21 01:58:34,840 INFO L226 Difference]: Without dead ends: 93 [2022-07-21 01:58:34,841 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-21 01:58:34,842 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-21 01:58:34,843 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-21 01:58:34,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-21 01:58:34,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2022-07-21 01:58:34,848 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-21 01:58:34,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 112 transitions. [2022-07-21 01:58:34,850 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 112 transitions. Word has length 8 [2022-07-21 01:58:34,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:34,850 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 112 transitions. [2022-07-21 01:58:34,850 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-21 01:58:34,850 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 112 transitions. [2022-07-21 01:58:34,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-21 01:58:34,851 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:34,851 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:58:34,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 01:58:34,851 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:34,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:34,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1362713673, now seen corresponding path program 1 times [2022-07-21 01:58:34,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:34,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648790141] [2022-07-21 01:58:34,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:34,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:34,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:34,945 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-21 01:58:34,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:34,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648790141] [2022-07-21 01:58:34,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648790141] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:58:34,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:58:34,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 01:58:34,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78175612] [2022-07-21 01:58:34,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:58:34,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 01:58:34,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:34,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 01:58:34,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 01:58:34,946 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-21 01:58:35,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:35,074 INFO L93 Difference]: Finished difference Result 235 states and 308 transitions. [2022-07-21 01:58:35,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 01:58:35,075 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-21 01:58:35,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:35,077 INFO L225 Difference]: With dead ends: 235 [2022-07-21 01:58:35,077 INFO L226 Difference]: Without dead ends: 230 [2022-07-21 01:58:35,077 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-21 01:58:35,078 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 516 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-21 01:58:35,079 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-21 01:58:35,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-07-21 01:58:35,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 92. [2022-07-21 01:58:35,089 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-21 01:58:35,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 115 transitions. [2022-07-21 01:58:35,090 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 115 transitions. Word has length 14 [2022-07-21 01:58:35,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:35,090 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 115 transitions. [2022-07-21 01:58:35,091 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-21 01:58:35,091 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 115 transitions. [2022-07-21 01:58:35,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-21 01:58:35,091 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:35,091 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-21 01:58:35,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 01:58:35,092 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:35,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:35,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1343418310, now seen corresponding path program 1 times [2022-07-21 01:58:35,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:35,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746898408] [2022-07-21 01:58:35,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:35,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:35,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:35,172 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-21 01:58:35,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:35,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746898408] [2022-07-21 01:58:35,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746898408] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:58:35,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:58:35,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 01:58:35,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571722396] [2022-07-21 01:58:35,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:58:35,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 01:58:35,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:35,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 01:58:35,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 01:58:35,175 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-21 01:58:35,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:35,267 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2022-07-21 01:58:35,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 01:58:35,269 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-21 01:58:35,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:35,271 INFO L225 Difference]: With dead ends: 94 [2022-07-21 01:58:35,271 INFO L226 Difference]: Without dead ends: 91 [2022-07-21 01:58:35,271 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-21 01:58:35,272 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-21 01:58:35,272 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-21 01:58:35,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-21 01:58:35,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-07-21 01:58:35,278 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-21 01:58:35,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 113 transitions. [2022-07-21 01:58:35,279 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 113 transitions. Word has length 21 [2022-07-21 01:58:35,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:35,279 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 113 transitions. [2022-07-21 01:58:35,279 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-21 01:58:35,280 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 113 transitions. [2022-07-21 01:58:35,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-21 01:58:35,280 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:35,280 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-21 01:58:35,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 01:58:35,281 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:35,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:35,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1668834300, now seen corresponding path program 1 times [2022-07-21 01:58:35,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:35,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738588082] [2022-07-21 01:58:35,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:35,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:35,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:35,347 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-21 01:58:35,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:35,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738588082] [2022-07-21 01:58:35,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738588082] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:58:35,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:58:35,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 01:58:35,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000474148] [2022-07-21 01:58:35,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:58:35,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 01:58:35,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:35,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 01:58:35,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 01:58:35,349 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-21 01:58:35,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:35,455 INFO L93 Difference]: Finished difference Result 118 states and 146 transitions. [2022-07-21 01:58:35,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 01:58:35,455 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-21 01:58:35,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:35,457 INFO L225 Difference]: With dead ends: 118 [2022-07-21 01:58:35,457 INFO L226 Difference]: Without dead ends: 115 [2022-07-21 01:58:35,460 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-21 01:58:35,466 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-21 01:58:35,467 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-21 01:58:35,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-21 01:58:35,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 90. [2022-07-21 01:58:35,477 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-21 01:58:35,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 111 transitions. [2022-07-21 01:58:35,478 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 111 transitions. Word has length 21 [2022-07-21 01:58:35,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:35,478 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 111 transitions. [2022-07-21 01:58:35,478 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-21 01:58:35,478 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 111 transitions. [2022-07-21 01:58:35,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 01:58:35,479 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:35,479 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-21 01:58:35,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 01:58:35,479 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:35,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:35,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1088949266, now seen corresponding path program 1 times [2022-07-21 01:58:35,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:35,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714363284] [2022-07-21 01:58:35,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:35,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:35,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:35,573 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-21 01:58:35,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:35,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714363284] [2022-07-21 01:58:35,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714363284] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:58:35,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:58:35,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 01:58:35,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836057792] [2022-07-21 01:58:35,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:58:35,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 01:58:35,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:35,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 01:58:35,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 01:58:35,581 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-21 01:58:35,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:35,771 INFO L93 Difference]: Finished difference Result 195 states and 240 transitions. [2022-07-21 01:58:35,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 01:58:35,772 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-21 01:58:35,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:35,773 INFO L225 Difference]: With dead ends: 195 [2022-07-21 01:58:35,773 INFO L226 Difference]: Without dead ends: 192 [2022-07-21 01:58:35,774 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-21 01:58:35,776 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-21 01:58:35,778 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-21 01:58:35,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-07-21 01:58:35,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 96. [2022-07-21 01:58:35,790 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-21 01:58:35,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 117 transitions. [2022-07-21 01:58:35,791 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 117 transitions. Word has length 24 [2022-07-21 01:58:35,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:35,792 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 117 transitions. [2022-07-21 01:58:35,792 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-21 01:58:35,792 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 117 transitions. [2022-07-21 01:58:35,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 01:58:35,792 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:35,793 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-21 01:58:35,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 01:58:35,793 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:35,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:35,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1875885747, now seen corresponding path program 1 times [2022-07-21 01:58:35,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:35,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293433474] [2022-07-21 01:58:35,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:35,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:35,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:35,890 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-21 01:58:35,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:35,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293433474] [2022-07-21 01:58:35,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293433474] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:58:35,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:58:35,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 01:58:35,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372613974] [2022-07-21 01:58:35,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:58:35,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 01:58:35,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:35,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 01:58:35,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 01:58:35,894 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-21 01:58:36,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:36,045 INFO L93 Difference]: Finished difference Result 194 states and 238 transitions. [2022-07-21 01:58:36,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 01:58:36,046 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-21 01:58:36,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:36,047 INFO L225 Difference]: With dead ends: 194 [2022-07-21 01:58:36,047 INFO L226 Difference]: Without dead ends: 191 [2022-07-21 01:58:36,048 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-21 01:58:36,049 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-21 01:58:36,049 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-21 01:58:36,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-07-21 01:58:36,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 102. [2022-07-21 01:58:36,067 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-21 01:58:36,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 123 transitions. [2022-07-21 01:58:36,068 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 123 transitions. Word has length 24 [2022-07-21 01:58:36,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:36,069 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 123 transitions. [2022-07-21 01:58:36,069 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-21 01:58:36,069 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 123 transitions. [2022-07-21 01:58:36,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-21 01:58:36,070 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:36,070 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-21 01:58:36,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 01:58:36,071 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:36,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:36,071 INFO L85 PathProgramCache]: Analyzing trace with hash 833312563, now seen corresponding path program 1 times [2022-07-21 01:58:36,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:36,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997867503] [2022-07-21 01:58:36,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:36,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:36,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:36,202 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-21 01:58:36,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:36,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997867503] [2022-07-21 01:58:36,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997867503] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:58:36,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:58:36,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 01:58:36,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104778063] [2022-07-21 01:58:36,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:58:36,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 01:58:36,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:36,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 01:58:36,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 01:58:36,204 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-21 01:58:36,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:36,484 INFO L93 Difference]: Finished difference Result 264 states and 335 transitions. [2022-07-21 01:58:36,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 01:58:36,486 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-21 01:58:36,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:36,488 INFO L225 Difference]: With dead ends: 264 [2022-07-21 01:58:36,488 INFO L226 Difference]: Without dead ends: 261 [2022-07-21 01:58:36,488 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-21 01:58:36,489 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-21 01:58:36,490 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-21 01:58:36,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-07-21 01:58:36,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 105. [2022-07-21 01:58:36,503 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-21 01:58:36,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 126 transitions. [2022-07-21 01:58:36,504 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 126 transitions. Word has length 27 [2022-07-21 01:58:36,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:36,505 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 126 transitions. [2022-07-21 01:58:36,505 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-21 01:58:36,505 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2022-07-21 01:58:36,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-21 01:58:36,510 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:36,510 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-21 01:58:36,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 01:58:36,510 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:36,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:36,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1708085367, now seen corresponding path program 1 times [2022-07-21 01:58:36,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:36,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512283267] [2022-07-21 01:58:36,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:36,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:36,609 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-21 01:58:36,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:36,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512283267] [2022-07-21 01:58:36,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512283267] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:58:36,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:58:36,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 01:58:36,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513479583] [2022-07-21 01:58:36,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:58:36,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 01:58:36,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:36,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 01:58:36,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 01:58:36,611 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-21 01:58:36,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:36,914 INFO L93 Difference]: Finished difference Result 263 states and 333 transitions. [2022-07-21 01:58:36,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 01:58:36,915 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-21 01:58:36,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:36,916 INFO L225 Difference]: With dead ends: 263 [2022-07-21 01:58:36,916 INFO L226 Difference]: Without dead ends: 260 [2022-07-21 01:58:36,916 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-21 01:58:36,917 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-21 01:58:36,917 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-21 01:58:36,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-07-21 01:58:36,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 108. [2022-07-21 01:58:36,926 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-21 01:58:36,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 129 transitions. [2022-07-21 01:58:36,927 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 129 transitions. Word has length 27 [2022-07-21 01:58:36,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:36,927 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 129 transitions. [2022-07-21 01:58:36,927 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-21 01:58:36,927 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 129 transitions. [2022-07-21 01:58:36,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-21 01:58:36,927 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:36,927 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-21 01:58:36,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 01:58:36,928 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:36,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:36,928 INFO L85 PathProgramCache]: Analyzing trace with hash -399551200, now seen corresponding path program 1 times [2022-07-21 01:58:36,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:36,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108928756] [2022-07-21 01:58:36,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:36,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:36,971 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-21 01:58:36,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:36,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108928756] [2022-07-21 01:58:36,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108928756] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 01:58:36,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375382113] [2022-07-21 01:58:36,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:36,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:58:36,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:58:36,973 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-21 01:58:36,974 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-21 01:58:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:37,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-21 01:58:37,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:58:37,188 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-21 01:58:37,191 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-21 01:58:37,203 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-21 01:58:37,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:58:37,286 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-21 01:58:37,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375382113] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:58:37,286 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 01:58:37,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-07-21 01:58:37,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284501867] [2022-07-21 01:58:37,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 01:58:37,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 01:58:37,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:37,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 01:58:37,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 01:58:37,288 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-21 01:58:37,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:37,406 INFO L93 Difference]: Finished difference Result 110 states and 130 transitions. [2022-07-21 01:58:37,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 01:58:37,407 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-21 01:58:37,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:37,407 INFO L225 Difference]: With dead ends: 110 [2022-07-21 01:58:37,407 INFO L226 Difference]: Without dead ends: 106 [2022-07-21 01:58:37,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-21 01:58:37,408 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-21 01:58:37,408 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-21 01:58:37,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-21 01:58:37,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-07-21 01:58:37,415 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-21 01:58:37,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 125 transitions. [2022-07-21 01:58:37,415 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 125 transitions. Word has length 32 [2022-07-21 01:58:37,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:37,416 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 125 transitions. [2022-07-21 01:58:37,416 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-21 01:58:37,416 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 125 transitions. [2022-07-21 01:58:37,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-21 01:58:37,416 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:37,416 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-21 01:58:37,437 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-21 01:58:37,616 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-21 01:58:37,617 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:37,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:37,617 INFO L85 PathProgramCache]: Analyzing trace with hash 2096511860, now seen corresponding path program 1 times [2022-07-21 01:58:37,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:37,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431521868] [2022-07-21 01:58:37,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:37,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:37,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:37,671 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-21 01:58:37,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:37,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431521868] [2022-07-21 01:58:37,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431521868] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:58:37,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:58:37,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 01:58:37,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518576593] [2022-07-21 01:58:37,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:58:37,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 01:58:37,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:37,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 01:58:37,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 01:58:37,674 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-21 01:58:37,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:37,719 INFO L93 Difference]: Finished difference Result 146 states and 178 transitions. [2022-07-21 01:58:37,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 01:58:37,720 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-21 01:58:37,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:37,722 INFO L225 Difference]: With dead ends: 146 [2022-07-21 01:58:37,722 INFO L226 Difference]: Without dead ends: 143 [2022-07-21 01:58:37,722 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-21 01:58:37,722 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-21 01:58:37,723 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-21 01:58:37,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-21 01:58:37,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 110. [2022-07-21 01:58:37,730 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-21 01:58:37,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 130 transitions. [2022-07-21 01:58:37,730 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 130 transitions. Word has length 33 [2022-07-21 01:58:37,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:37,731 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 130 transitions. [2022-07-21 01:58:37,731 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-21 01:58:37,731 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 130 transitions. [2022-07-21 01:58:37,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-21 01:58:37,732 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:37,732 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-21 01:58:37,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 01:58:37,733 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:37,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:37,733 INFO L85 PathProgramCache]: Analyzing trace with hash -236025208, now seen corresponding path program 1 times [2022-07-21 01:58:37,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:37,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295678969] [2022-07-21 01:58:37,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:37,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:37,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:37,875 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-21 01:58:37,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:37,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295678969] [2022-07-21 01:58:37,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295678969] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 01:58:37,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934920053] [2022-07-21 01:58:37,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:37,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:58:37,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:58:37,877 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-21 01:58:37,878 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-21 01:58:37,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:37,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-21 01:58:37,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:58:38,142 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-21 01:58:38,145 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-21 01:58:38,148 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-21 01:58:38,149 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:58:38,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934920053] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:58:38,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 01:58:38,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 12 [2022-07-21 01:58:38,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166608234] [2022-07-21 01:58:38,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:58:38,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 01:58:38,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:38,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 01:58:38,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-21 01:58:38,150 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-21 01:58:38,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:38,389 INFO L93 Difference]: Finished difference Result 199 states and 252 transitions. [2022-07-21 01:58:38,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 01:58:38,389 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-21 01:58:38,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:38,390 INFO L225 Difference]: With dead ends: 199 [2022-07-21 01:58:38,390 INFO L226 Difference]: Without dead ends: 196 [2022-07-21 01:58:38,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2022-07-21 01:58:38,391 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-21 01:58:38,391 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-21 01:58:38,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-07-21 01:58:38,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 119. [2022-07-21 01:58:38,400 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-21 01:58:38,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 140 transitions. [2022-07-21 01:58:38,401 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 140 transitions. Word has length 36 [2022-07-21 01:58:38,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:38,401 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 140 transitions. [2022-07-21 01:58:38,401 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-21 01:58:38,401 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 140 transitions. [2022-07-21 01:58:38,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-21 01:58:38,402 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:38,402 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-21 01:58:38,422 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-21 01:58:38,614 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-21 01:58:38,615 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:38,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:38,615 INFO L85 PathProgramCache]: Analyzing trace with hash -73182163, now seen corresponding path program 1 times [2022-07-21 01:58:38,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:38,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11875004] [2022-07-21 01:58:38,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:38,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:38,697 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-21 01:58:38,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:38,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11875004] [2022-07-21 01:58:38,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11875004] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 01:58:38,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208001201] [2022-07-21 01:58:38,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:38,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:58:38,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:58:38,699 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-21 01:58:38,700 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-21 01:58:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:38,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-21 01:58:38,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:58:38,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:38,823 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-21 01:58:38,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:38,829 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-21 01:58:38,881 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-21 01:58:38,894 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-21 01:58:38,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:58:38,990 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-21 01:58:38,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208001201] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:58:38,990 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 01:58:38,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 13 [2022-07-21 01:58:38,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555018163] [2022-07-21 01:58:38,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 01:58:38,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 01:58:38,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:38,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 01:58:38,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-07-21 01:58:38,991 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-21 01:58:39,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:39,261 INFO L93 Difference]: Finished difference Result 299 states and 366 transitions. [2022-07-21 01:58:39,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 01:58:39,262 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-21 01:58:39,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:39,263 INFO L225 Difference]: With dead ends: 299 [2022-07-21 01:58:39,263 INFO L226 Difference]: Without dead ends: 214 [2022-07-21 01:58:39,265 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-21 01:58:39,266 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-21 01:58:39,267 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-21 01:58:39,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-07-21 01:58:39,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 130. [2022-07-21 01:58:39,277 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-21 01:58:39,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 152 transitions. [2022-07-21 01:58:39,278 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 152 transitions. Word has length 38 [2022-07-21 01:58:39,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:39,278 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 152 transitions. [2022-07-21 01:58:39,279 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-21 01:58:39,279 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 152 transitions. [2022-07-21 01:58:39,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-21 01:58:39,279 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:39,279 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-21 01:58:39,298 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-21 01:58:39,497 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-21 01:58:39,497 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:39,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:39,498 INFO L85 PathProgramCache]: Analyzing trace with hash 490774160, now seen corresponding path program 1 times [2022-07-21 01:58:39,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:39,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588343847] [2022-07-21 01:58:39,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:39,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:39,538 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-21 01:58:39,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:39,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588343847] [2022-07-21 01:58:39,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588343847] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:58:39,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:58:39,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 01:58:39,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609457747] [2022-07-21 01:58:39,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:58:39,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 01:58:39,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:39,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 01:58:39,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 01:58:39,540 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-21 01:58:39,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:39,610 INFO L93 Difference]: Finished difference Result 238 states and 298 transitions. [2022-07-21 01:58:39,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 01:58:39,610 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-21 01:58:39,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:39,611 INFO L225 Difference]: With dead ends: 238 [2022-07-21 01:58:39,611 INFO L226 Difference]: Without dead ends: 197 [2022-07-21 01:58:39,612 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-21 01:58:39,612 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-21 01:58:39,612 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-21 01:58:39,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-07-21 01:58:39,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 131. [2022-07-21 01:58:39,624 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-21 01:58:39,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 153 transitions. [2022-07-21 01:58:39,625 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 153 transitions. Word has length 38 [2022-07-21 01:58:39,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:39,625 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 153 transitions. [2022-07-21 01:58:39,625 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-21 01:58:39,626 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 153 transitions. [2022-07-21 01:58:39,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-21 01:58:39,626 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:39,626 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-21 01:58:39,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 01:58:39,626 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:39,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:39,627 INFO L85 PathProgramCache]: Analyzing trace with hash -557560351, now seen corresponding path program 1 times [2022-07-21 01:58:39,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:39,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15962512] [2022-07-21 01:58:39,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:39,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:39,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:39,704 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-21 01:58:39,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:39,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15962512] [2022-07-21 01:58:39,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15962512] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:58:39,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:58:39,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 01:58:39,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102050226] [2022-07-21 01:58:39,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:58:39,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 01:58:39,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:39,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 01:58:39,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 01:58:39,706 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-21 01:58:39,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:39,884 INFO L93 Difference]: Finished difference Result 165 states and 193 transitions. [2022-07-21 01:58:39,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 01:58:39,884 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-21 01:58:39,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:39,885 INFO L225 Difference]: With dead ends: 165 [2022-07-21 01:58:39,885 INFO L226 Difference]: Without dead ends: 162 [2022-07-21 01:58:39,886 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-21 01:58:39,886 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-21 01:58:39,886 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-21 01:58:39,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-21 01:58:39,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 137. [2022-07-21 01:58:39,894 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-21 01:58:39,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 160 transitions. [2022-07-21 01:58:39,894 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 160 transitions. Word has length 39 [2022-07-21 01:58:39,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:39,894 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 160 transitions. [2022-07-21 01:58:39,895 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-21 01:58:39,895 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 160 transitions. [2022-07-21 01:58:39,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-21 01:58:39,895 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:39,895 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-21 01:58:39,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 01:58:39,895 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:39,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:39,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1187191262, now seen corresponding path program 1 times [2022-07-21 01:58:39,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:39,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655491566] [2022-07-21 01:58:39,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:39,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:39,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:39,943 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-21 01:58:39,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:39,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655491566] [2022-07-21 01:58:39,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655491566] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:58:39,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:58:39,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 01:58:39,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206922078] [2022-07-21 01:58:39,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:58:39,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 01:58:39,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:39,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 01:58:39,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-21 01:58:39,945 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-21 01:58:40,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:40,188 INFO L93 Difference]: Finished difference Result 316 states and 415 transitions. [2022-07-21 01:58:40,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-21 01:58:40,189 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-21 01:58:40,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:40,190 INFO L225 Difference]: With dead ends: 316 [2022-07-21 01:58:40,190 INFO L226 Difference]: Without dead ends: 275 [2022-07-21 01:58:40,190 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-21 01:58:40,191 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-21 01:58:40,191 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-21 01:58:40,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-07-21 01:58:40,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 156. [2022-07-21 01:58:40,220 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-21 01:58:40,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 189 transitions. [2022-07-21 01:58:40,221 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 189 transitions. Word has length 39 [2022-07-21 01:58:40,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:40,221 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 189 transitions. [2022-07-21 01:58:40,222 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-21 01:58:40,222 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 189 transitions. [2022-07-21 01:58:40,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-21 01:58:40,222 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:40,222 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-21 01:58:40,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 01:58:40,223 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:40,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:40,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1447224354, now seen corresponding path program 1 times [2022-07-21 01:58:40,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:40,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22975938] [2022-07-21 01:58:40,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:40,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:40,306 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-21 01:58:40,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:40,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22975938] [2022-07-21 01:58:40,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22975938] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 01:58:40,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510026238] [2022-07-21 01:58:40,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:40,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:58:40,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:58:40,309 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-21 01:58:40,310 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-21 01:58:40,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:40,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-21 01:58:40,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:58:40,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:40,431 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-21 01:58:40,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:40,436 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-21 01:58:40,507 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-21 01:58:40,511 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-21 01:58:40,518 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-21 01:58:40,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:58:40,578 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-21 01:58:40,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510026238] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:58:40,579 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 01:58:40,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 10 [2022-07-21 01:58:40,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60830422] [2022-07-21 01:58:40,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 01:58:40,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 01:58:40,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:40,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 01:58:40,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-07-21 01:58:40,580 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-21 01:58:40,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:40,660 INFO L93 Difference]: Finished difference Result 249 states and 306 transitions. [2022-07-21 01:58:40,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 01:58:40,661 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-21 01:58:40,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:40,661 INFO L225 Difference]: With dead ends: 249 [2022-07-21 01:58:40,661 INFO L226 Difference]: Without dead ends: 188 [2022-07-21 01:58:40,662 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-21 01:58:40,662 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 40 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-21 01:58:40,662 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-21 01:58:40,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-07-21 01:58:40,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 170. [2022-07-21 01:58:40,673 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-21 01:58:40,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 203 transitions. [2022-07-21 01:58:40,674 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 203 transitions. Word has length 42 [2022-07-21 01:58:40,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:40,674 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 203 transitions. [2022-07-21 01:58:40,674 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-21 01:58:40,675 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 203 transitions. [2022-07-21 01:58:40,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-21 01:58:40,675 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:40,675 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-21 01:58:40,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-21 01:58:40,891 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-21 01:58:40,891 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:40,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:40,892 INFO L85 PathProgramCache]: Analyzing trace with hash -600772010, now seen corresponding path program 2 times [2022-07-21 01:58:40,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:40,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268621207] [2022-07-21 01:58:40,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:40,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:41,098 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-21 01:58:41,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:41,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268621207] [2022-07-21 01:58:41,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268621207] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 01:58:41,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807637685] [2022-07-21 01:58:41,099 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 01:58:41,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:58:41,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:58:41,100 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-21 01:58:41,101 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-21 01:58:41,195 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 01:58:41,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 01:58:41,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-21 01:58:41,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:58:41,213 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-21 01:58:41,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:41,235 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-21 01:58:41,253 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 01:58:41,253 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-21 01:58:41,281 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-21 01:58:41,292 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-21 01:58:41,292 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-21 01:58:41,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:41,334 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-21 01:58:41,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:41,354 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-21 01:58:41,579 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-21 01:58:41,685 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 01:58:41,686 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-21 01:58:41,690 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-21 01:58:41,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:58:41,778 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-21 01:58:41,792 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-21 01:58:41,816 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-21 01:58:41,817 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-21 01:58:41,820 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:58:41,825 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 01:58:41,826 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-21 01:58:41,831 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-21 01:58:41,949 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-21 01:58:42,234 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 01:58:42,235 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 22 treesize of output 18 [2022-07-21 01:58:42,243 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-21 01:58:42,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807637685] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:58:42,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 01:58:42,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 26 [2022-07-21 01:58:42,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163889187] [2022-07-21 01:58:42,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 01:58:42,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-21 01:58:42,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:42,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-21 01:58:42,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=485, Unknown=2, NotChecked=90, Total=650 [2022-07-21 01:58:42,245 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-21 01:58:43,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:43,359 INFO L93 Difference]: Finished difference Result 351 states and 437 transitions. [2022-07-21 01:58:43,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-21 01:58:43,359 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-21 01:58:43,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:43,361 INFO L225 Difference]: With dead ends: 351 [2022-07-21 01:58:43,361 INFO L226 Difference]: Without dead ends: 348 [2022-07-21 01:58:43,361 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-21 01:58:43,362 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-21 01:58:43,362 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-21 01:58:43,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-07-21 01:58:43,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 181. [2022-07-21 01:58:43,375 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-21 01:58:43,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 215 transitions. [2022-07-21 01:58:43,376 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 215 transitions. Word has length 44 [2022-07-21 01:58:43,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:43,376 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 215 transitions. [2022-07-21 01:58:43,376 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-21 01:58:43,377 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 215 transitions. [2022-07-21 01:58:43,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-21 01:58:43,377 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:43,377 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-21 01:58:43,403 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-21 01:58:43,596 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-21 01:58:43,597 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:43,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:43,597 INFO L85 PathProgramCache]: Analyzing trace with hash 186164471, now seen corresponding path program 1 times [2022-07-21 01:58:43,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:43,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262579511] [2022-07-21 01:58:43,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:43,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:43,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:43,786 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-21 01:58:43,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:43,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262579511] [2022-07-21 01:58:43,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262579511] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 01:58:43,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872734598] [2022-07-21 01:58:43,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:43,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:58:43,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:58:43,788 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-21 01:58:43,789 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-21 01:58:43,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:43,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-21 01:58:43,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:58:43,918 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-21 01:58:43,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:43,941 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-21 01:58:43,957 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 01:58:43,957 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-21 01:58:43,968 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-21 01:58:43,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:44,004 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-21 01:58:44,005 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-21 01:58:44,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:44,016 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-21 01:58:44,174 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-21 01:58:44,254 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 01:58:44,255 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-21 01:58:44,260 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-21 01:58:44,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:58:45,329 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-21 01:58:45,343 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-21 01:58:45,394 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-21 01:58:45,395 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-21 01:58:45,401 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 01:58:45,401 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-21 01:58:45,408 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-21 01:58:45,500 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-21 01:58:45,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 10 treesize of output 8 [2022-07-21 01:58:45,573 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-21 01:58:45,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872734598] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:58:45,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 01:58:45,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 25 [2022-07-21 01:58:45,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30930716] [2022-07-21 01:58:45,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 01:58:45,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-21 01:58:45,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:45,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-21 01:58:45,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=440, Unknown=2, NotChecked=86, Total=600 [2022-07-21 01:58:45,575 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-21 01:58:45,636 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-21 01:58:45,644 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-21 01:58:46,521 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-21 01:58:46,568 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-21 01:58:47,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:47,111 INFO L93 Difference]: Finished difference Result 231 states and 275 transitions. [2022-07-21 01:58:47,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-21 01:58:47,112 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-21 01:58:47,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:47,113 INFO L225 Difference]: With dead ends: 231 [2022-07-21 01:58:47,113 INFO L226 Difference]: Without dead ends: 228 [2022-07-21 01:58:47,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=176, Invalid=772, Unknown=6, NotChecked=378, Total=1332 [2022-07-21 01:58:47,114 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-21 01:58:47,114 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-21 01:58:47,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-07-21 01:58:47,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 188. [2022-07-21 01:58:47,126 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-21 01:58:47,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 222 transitions. [2022-07-21 01:58:47,127 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 222 transitions. Word has length 44 [2022-07-21 01:58:47,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:47,127 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 222 transitions. [2022-07-21 01:58:47,127 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-21 01:58:47,127 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 222 transitions. [2022-07-21 01:58:47,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-21 01:58:47,128 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:47,128 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-21 01:58:47,161 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-21 01:58:47,343 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-21 01:58:47,343 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:47,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:47,344 INFO L85 PathProgramCache]: Analyzing trace with hash -498608819, now seen corresponding path program 1 times [2022-07-21 01:58:47,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:47,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280935388] [2022-07-21 01:58:47,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:47,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:47,375 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-21 01:58:47,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:47,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280935388] [2022-07-21 01:58:47,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280935388] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:58:47,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:58:47,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 01:58:47,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417332433] [2022-07-21 01:58:47,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:58:47,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 01:58:47,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:47,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 01:58:47,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 01:58:47,376 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-21 01:58:47,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:47,467 INFO L93 Difference]: Finished difference Result 190 states and 223 transitions. [2022-07-21 01:58:47,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 01:58:47,482 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-21 01:58:47,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:47,482 INFO L225 Difference]: With dead ends: 190 [2022-07-21 01:58:47,483 INFO L226 Difference]: Without dead ends: 153 [2022-07-21 01:58:47,483 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-21 01:58:47,483 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 1 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-21 01:58:47,483 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-21 01:58:47,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-21 01:58:47,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2022-07-21 01:58:47,493 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-21 01:58:47,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 182 transitions. [2022-07-21 01:58:47,494 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 182 transitions. Word has length 45 [2022-07-21 01:58:47,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:47,494 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 182 transitions. [2022-07-21 01:58:47,494 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-21 01:58:47,494 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 182 transitions. [2022-07-21 01:58:47,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-21 01:58:47,494 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:47,494 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-21 01:58:47,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-21 01:58:47,494 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:47,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:47,495 INFO L85 PathProgramCache]: Analyzing trace with hash -636511633, now seen corresponding path program 1 times [2022-07-21 01:58:47,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:47,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981207232] [2022-07-21 01:58:47,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:47,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:47,928 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-21 01:58:47,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:47,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981207232] [2022-07-21 01:58:47,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981207232] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 01:58:47,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748969678] [2022-07-21 01:58:47,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:47,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:58:47,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:58:47,930 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-21 01:58:47,930 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-21 01:58:48,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:48,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 93 conjunts are in the unsatisfiable core [2022-07-21 01:58:48,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:58:48,080 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-21 01:58:48,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:48,127 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-21 01:58:48,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:48,132 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-21 01:58:48,182 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 01:58:48,183 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-21 01:58:48,222 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-21 01:58:48,226 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-21 01:58:48,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:48,271 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:58:48,278 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-21 01:58:48,278 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-21 01:58:48,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:48,283 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:58:48,292 INFO L356 Elim1Store]: treesize reduction 68, result has 28.4 percent of original size [2022-07-21 01:58:48,293 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-21 01:58:49,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:49,347 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:58:49,365 INFO L356 Elim1Store]: treesize reduction 93, result has 13.1 percent of original size [2022-07-21 01:58:49,365 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-21 01:58:49,376 INFO L356 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2022-07-21 01:58:49,376 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-21 01:58:49,381 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-21 01:58:49,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:58:51,913 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-21 01:58:52,404 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-21 01:58:56,239 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:58:56,246 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 01:58:56,246 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-21 01:58:56,251 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:58:56,256 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 01:58:56,256 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-21 01:58:56,446 INFO L356 Elim1Store]: treesize reduction 48, result has 79.0 percent of original size [2022-07-21 01:58:56,446 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-21 01:58:56,768 INFO L356 Elim1Store]: treesize reduction 58, result has 79.9 percent of original size [2022-07-21 01:58:56,770 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 60131 treesize of output 55841 [2022-07-21 01:58:57,279 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:58:57,479 INFO L356 Elim1Store]: treesize reduction 8, result has 95.3 percent of original size [2022-07-21 01:58:57,480 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 92049 treesize of output 85959 [2022-07-21 01:59:00,119 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:59:00,295 INFO L356 Elim1Store]: treesize reduction 8, result has 95.3 percent of original size [2022-07-21 01:59:00,296 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 95769 treesize of output 91631 [2022-07-21 01:59:01,642 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-21 01:59:01,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-21 01:59:01,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:59:01,856 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:545) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:528) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:348) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-21 01:59:01,858 INFO L158 Benchmark]: Toolchain (without parser) took 28424.13ms. Allocated memory was 69.2MB in the beginning and 520.1MB in the end (delta: 450.9MB). Free memory was 49.5MB in the beginning and 390.3MB in the end (delta: -340.8MB). Peak memory consumption was 318.6MB. Max. memory is 16.1GB. [2022-07-21 01:59:01,859 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 69.2MB. Free memory was 52.6MB in the beginning and 52.5MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 01:59:01,859 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.85ms. Allocated memory is still 69.2MB. Free memory was 49.3MB in the beginning and 44.4MB in the end (delta: 4.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-21 01:59:01,859 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.84ms. Allocated memory is still 69.2MB. Free memory was 44.4MB in the beginning and 41.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 01:59:01,859 INFO L158 Benchmark]: Boogie Preprocessor took 55.22ms. Allocated memory is still 69.2MB. Free memory was 41.6MB in the beginning and 39.2MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-21 01:59:01,859 INFO L158 Benchmark]: RCFGBuilder took 532.95ms. Allocated memory was 69.2MB in the beginning and 102.8MB in the end (delta: 33.6MB). Free memory was 39.2MB in the beginning and 67.3MB in the end (delta: -28.1MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. [2022-07-21 01:59:01,859 INFO L158 Benchmark]: TraceAbstraction took 27382.76ms. Allocated memory was 102.8MB in the beginning and 520.1MB in the end (delta: 417.3MB). Free memory was 66.8MB in the beginning and 390.3MB in the end (delta: -323.5MB). Peak memory consumption was 302.2MB. Max. memory is 16.1GB. [2022-07-21 01:59:01,860 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.41ms. Allocated memory is still 69.2MB. Free memory was 52.6MB in the beginning and 52.5MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 410.85ms. Allocated memory is still 69.2MB. Free memory was 49.3MB in the beginning and 44.4MB in the end (delta: 4.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.84ms. Allocated memory is still 69.2MB. Free memory was 44.4MB in the beginning and 41.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.22ms. Allocated memory is still 69.2MB. Free memory was 41.6MB in the beginning and 39.2MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 532.95ms. Allocated memory was 69.2MB in the beginning and 102.8MB in the end (delta: 33.6MB). Free memory was 39.2MB in the beginning and 67.3MB in the end (delta: -28.1MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. * TraceAbstraction took 27382.76ms. Allocated memory was 102.8MB in the beginning and 520.1MB in the end (delta: 417.3MB). Free memory was 66.8MB in the beginning and 390.3MB in the end (delta: -323.5MB). Peak memory consumption was 302.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-21 01:59:01,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_Bitvector.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-?-3598765 [2022-07-21 01:59:03,472 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 01:59:03,474 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 01:59:03,504 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 01:59:03,504 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 01:59:03,505 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 01:59:03,506 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 01:59:03,509 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 01:59:03,512 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 01:59:03,515 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 01:59:03,516 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 01:59:03,518 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 01:59:03,518 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 01:59:03,519 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 01:59:03,522 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 01:59:03,525 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 01:59:03,525 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 01:59:03,526 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 01:59:03,528 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 01:59:03,533 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 01:59:03,534 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 01:59:03,535 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 01:59:03,536 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 01:59:03,536 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 01:59:03,537 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 01:59:03,542 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 01:59:03,542 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 01:59:03,542 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 01:59:03,543 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 01:59:03,545 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 01:59:03,545 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 01:59:03,545 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 01:59:03,546 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 01:59:03,547 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 01:59:03,548 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 01:59:03,548 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 01:59:03,548 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 01:59:03,549 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 01:59:03,549 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 01:59:03,549 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 01:59:03,549 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 01:59:03,553 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 01:59:03,554 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-21 01:59:03,578 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 01:59:03,578 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 01:59:03,578 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 01:59:03,579 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 01:59:03,579 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 01:59:03,579 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 01:59:03,580 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 01:59:03,580 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 01:59:03,580 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 01:59:03,581 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 01:59:03,581 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 01:59:03,581 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 01:59:03,581 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 01:59:03,581 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 01:59:03,581 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 01:59:03,581 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 01:59:03,581 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 01:59:03,581 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-21 01:59:03,582 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-21 01:59:03,582 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 01:59:03,582 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 01:59:03,582 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 01:59:03,582 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 01:59:03,582 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 01:59:03,582 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 01:59:03,582 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 01:59:03,582 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:59:03,582 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 01:59:03,582 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 01:59:03,582 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 01:59:03,583 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-21 01:59:03,583 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-21 01:59:03,583 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 01:59:03,583 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 01:59:03,583 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 01:59:03,583 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-21 01:59:03,583 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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-21 01:59:03,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 01:59:03,857 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 01:59:03,859 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 01:59:03,860 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 01:59:03,860 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 01:59:03,861 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-21 01:59:03,910 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/299cb1a3c/946f4ee6ec694c6caaa1e26118d87c65/FLAG300f98b57 [2022-07-21 01:59:04,310 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 01:59:04,310 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-2.i [2022-07-21 01:59:04,318 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/299cb1a3c/946f4ee6ec694c6caaa1e26118d87c65/FLAG300f98b57 [2022-07-21 01:59:04,326 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/299cb1a3c/946f4ee6ec694c6caaa1e26118d87c65 [2022-07-21 01:59:04,327 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 01:59:04,328 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 01:59:04,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 01:59:04,329 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 01:59:04,332 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 01:59:04,332 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:59:04" (1/1) ... [2022-07-21 01:59:04,333 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@410a2104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:59:04, skipping insertion in model container [2022-07-21 01:59:04,333 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:59:04" (1/1) ... [2022-07-21 01:59:04,338 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 01:59:04,357 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 01:59:04,537 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-21 01:59:04,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:59:04,592 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 01:59:04,614 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-21 01:59:04,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:59:04,643 INFO L208 MainTranslator]: Completed translation [2022-07-21 01:59:04,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:59:04 WrapperNode [2022-07-21 01:59:04,643 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 01:59:04,644 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 01:59:04,644 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 01:59:04,644 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 01:59:04,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:59:04" (1/1) ... [2022-07-21 01:59:04,664 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:59:04" (1/1) ... [2022-07-21 01:59:04,691 INFO L137 Inliner]: procedures = 128, calls = 83, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 284 [2022-07-21 01:59:04,691 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 01:59:04,692 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 01:59:04,692 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 01:59:04,692 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 01:59:04,699 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:59:04" (1/1) ... [2022-07-21 01:59:04,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:59:04" (1/1) ... [2022-07-21 01:59:04,719 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:59:04" (1/1) ... [2022-07-21 01:59:04,719 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:59:04" (1/1) ... [2022-07-21 01:59:04,728 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:59:04" (1/1) ... [2022-07-21 01:59:04,743 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:59:04" (1/1) ... [2022-07-21 01:59:04,744 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:59:04" (1/1) ... [2022-07-21 01:59:04,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 01:59:04,748 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 01:59:04,748 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 01:59:04,748 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 01:59:04,749 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:59:04" (1/1) ... [2022-07-21 01:59:04,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:59:04,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:59:04,782 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-21 01:59:04,784 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-21 01:59:04,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-21 01:59:04,827 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2022-07-21 01:59:04,827 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2022-07-21 01:59:04,827 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2022-07-21 01:59:04,828 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2022-07-21 01:59:04,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 01:59:04,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 01:59:04,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 01:59:04,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 01:59:04,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 01:59:04,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-21 01:59:04,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 01:59:04,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-21 01:59:04,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 01:59:04,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 01:59:04,977 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 01:59:04,978 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 01:59:05,433 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 01:59:05,437 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 01:59:05,437 INFO L299 CfgBuilder]: Removed 33 assume(true) statements. [2022-07-21 01:59:05,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:59:05 BoogieIcfgContainer [2022-07-21 01:59:05,438 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 01:59:05,440 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 01:59:05,440 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 01:59:05,441 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 01:59:05,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 01:59:04" (1/3) ... [2022-07-21 01:59:05,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53429a5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:59:05, skipping insertion in model container [2022-07-21 01:59:05,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:59:04" (2/3) ... [2022-07-21 01:59:05,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53429a5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:59:05, skipping insertion in model container [2022-07-21 01:59:05,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:59:05" (3/3) ... [2022-07-21 01:59:05,443 INFO L111 eAbstractionObserver]: Analyzing ICFG merge_sort-2.i [2022-07-21 01:59:05,458 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 01:59:05,458 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 01:59:05,490 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 01:59:05,494 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@37305b69, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@227c914f [2022-07-21 01:59:05,494 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 01:59:05,497 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 76 states have (on average 1.8157894736842106) internal successors, (138), 92 states have internal predecessors, (138), 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-21 01:59:05,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-21 01:59:05,502 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:59:05,502 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:59:05,502 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:59:05,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:59:05,506 INFO L85 PathProgramCache]: Analyzing trace with hash 2116504326, now seen corresponding path program 1 times [2022-07-21 01:59:05,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:59:05,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [482323111] [2022-07-21 01:59:05,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:05,529 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:59:05,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:59:05,541 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:59:05,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-21 01:59:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:05,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-21 01:59:05,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:59:05,632 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-21 01:59:05,632 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:59:05,632 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:59:05,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [482323111] [2022-07-21 01:59:05,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [482323111] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:59:05,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:59:05,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 01:59:05,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587076558] [2022-07-21 01:59:05,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:59:05,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 01:59:05,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:59:05,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 01:59:05,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 01:59:05,656 INFO L87 Difference]: Start difference. First operand has 95 states, 76 states have (on average 1.8157894736842106) internal successors, (138), 92 states have internal predecessors, (138), 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-21 01:59:05,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:59:05,684 INFO L93 Difference]: Finished difference Result 186 states and 333 transitions. [2022-07-21 01:59:05,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 01:59:05,686 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-21 01:59:05,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:59:05,698 INFO L225 Difference]: With dead ends: 186 [2022-07-21 01:59:05,698 INFO L226 Difference]: Without dead ends: 86 [2022-07-21 01:59:05,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 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-21 01:59:05,705 INFO L413 NwaCegarLoop]: 118 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, 118 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-21 01:59:05,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 01:59:05,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-21 01:59:05,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-07-21 01:59:05,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 83 states have internal predecessors, (92), 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-21 01:59:05,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 109 transitions. [2022-07-21 01:59:05,735 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 109 transitions. Word has length 7 [2022-07-21 01:59:05,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:59:05,736 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 109 transitions. [2022-07-21 01:59:05,736 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-21 01:59:05,736 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 109 transitions. [2022-07-21 01:59:05,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-21 01:59:05,736 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:59:05,736 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:59:05,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-21 01:59:05,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:59:05,943 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:59:05,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:59:05,944 INFO L85 PathProgramCache]: Analyzing trace with hash 2099880948, now seen corresponding path program 1 times [2022-07-21 01:59:05,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:59:05,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1874591859] [2022-07-21 01:59:05,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:05,944 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:59:05,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:59:05,946 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:59:05,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-21 01:59:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:06,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 01:59:06,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:59:06,055 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-21 01:59:06,055 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:59:06,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:59:06,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1874591859] [2022-07-21 01:59:06,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1874591859] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:59:06,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:59:06,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 01:59:06,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055279998] [2022-07-21 01:59:06,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:59:06,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 01:59:06,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:59:06,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 01:59:06,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 01:59:06,066 INFO L87 Difference]: Start difference. First operand 86 states and 109 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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-21 01:59:06,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:59:06,104 INFO L93 Difference]: Finished difference Result 170 states and 216 transitions. [2022-07-21 01:59:06,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 01:59:06,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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-21 01:59:06,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:59:06,105 INFO L225 Difference]: With dead ends: 170 [2022-07-21 01:59:06,105 INFO L226 Difference]: Without dead ends: 91 [2022-07-21 01:59:06,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-21 01:59:06,106 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 4 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 210 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-21 01:59:06,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 210 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 01:59:06,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-21 01:59:06,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2022-07-21 01:59:06,122 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-21 01:59:06,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 110 transitions. [2022-07-21 01:59:06,123 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 110 transitions. Word has length 7 [2022-07-21 01:59:06,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:59:06,123 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 110 transitions. [2022-07-21 01:59:06,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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-21 01:59:06,124 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2022-07-21 01:59:06,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-21 01:59:06,124 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:59:06,124 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:59:06,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-21 01:59:06,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:59:06,325 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:59:06,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:59:06,325 INFO L85 PathProgramCache]: Analyzing trace with hash -404579866, now seen corresponding path program 1 times [2022-07-21 01:59:06,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:59:06,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [492743958] [2022-07-21 01:59:06,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:06,326 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:59:06,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:59:06,327 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:59:06,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-21 01:59:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:06,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 01:59:06,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:59:06,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:59:06,437 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:59:06,437 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:59:06,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [492743958] [2022-07-21 01:59:06,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [492743958] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:59:06,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:59:06,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 01:59:06,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214361330] [2022-07-21 01:59:06,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:59:06,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 01:59:06,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:59:06,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 01:59:06,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 01:59:06,439 INFO L87 Difference]: Start difference. First operand 87 states and 110 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-21 01:59:06,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:59:06,622 INFO L93 Difference]: Finished difference Result 235 states and 308 transitions. [2022-07-21 01:59:06,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 01:59:06,623 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 12 [2022-07-21 01:59:06,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:59:06,628 INFO L225 Difference]: With dead ends: 235 [2022-07-21 01:59:06,628 INFO L226 Difference]: Without dead ends: 230 [2022-07-21 01:59:06,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 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-21 01:59:06,630 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 516 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 01:59:06,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 274 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 01:59:06,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-07-21 01:59:06,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 90. [2022-07-21 01:59:06,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 74 states have (on average 1.3108108108108107) internal successors, (97), 87 states have internal predecessors, (97), 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-21 01:59:06,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 113 transitions. [2022-07-21 01:59:06,665 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 113 transitions. Word has length 12 [2022-07-21 01:59:06,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:59:06,665 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 113 transitions. [2022-07-21 01:59:06,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-21 01:59:06,666 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2022-07-21 01:59:06,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-21 01:59:06,667 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:59:06,667 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:59:06,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-21 01:59:06,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:59:06,875 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:59:06,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:59:06,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1696064914, now seen corresponding path program 1 times [2022-07-21 01:59:06,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:59:06,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1120262575] [2022-07-21 01:59:06,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:06,876 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:59:06,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:59:06,877 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:59:06,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-21 01:59:06,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:06,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-21 01:59:06,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:59:07,036 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 14 treesize of output 15 [2022-07-21 01:59:07,043 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 14 treesize of output 15 [2022-07-21 01:59:07,119 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-21 01:59:07,123 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-21 01:59:07,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:59:07,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:59:07,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:59:07,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:59:07,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1120262575] [2022-07-21 01:59:07,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1120262575] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:59:07,242 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 01:59:07,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2022-07-21 01:59:07,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216512567] [2022-07-21 01:59:07,243 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 01:59:07,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 01:59:07,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:59:07,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 01:59:07,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-21 01:59:07,244 INFO L87 Difference]: Start difference. First operand 90 states and 113 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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-21 01:59:08,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:59:08,465 INFO L93 Difference]: Finished difference Result 276 states and 357 transitions. [2022-07-21 01:59:08,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 01:59:08,465 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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 19 [2022-07-21 01:59:08,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:59:08,467 INFO L225 Difference]: With dead ends: 276 [2022-07-21 01:59:08,467 INFO L226 Difference]: Without dead ends: 273 [2022-07-21 01:59:08,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-21 01:59:08,468 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 500 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-21 01:59:08,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 441 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-21 01:59:08,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-07-21 01:59:08,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 104. [2022-07-21 01:59:08,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 101 states have internal predecessors, (113), 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-21 01:59:08,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 129 transitions. [2022-07-21 01:59:08,477 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 129 transitions. Word has length 19 [2022-07-21 01:59:08,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:59:08,478 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 129 transitions. [2022-07-21 01:59:08,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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-21 01:59:08,478 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 129 transitions. [2022-07-21 01:59:08,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-21 01:59:08,478 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:59:08,479 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:59:08,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-21 01:59:08,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:59:08,683 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:59:08,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:59:08,684 INFO L85 PathProgramCache]: Analyzing trace with hash -2021480904, now seen corresponding path program 1 times [2022-07-21 01:59:08,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:59:08,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [325924136] [2022-07-21 01:59:08,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:08,684 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:59:08,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:59:08,686 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:59:08,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-21 01:59:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:08,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-21 01:59:08,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:59:08,814 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 14 treesize of output 15 [2022-07-21 01:59:08,819 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 14 treesize of output 15 [2022-07-21 01:59:08,873 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-21 01:59:08,878 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-21 01:59:08,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:59:08,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:59:08,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:59:08,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:59:08,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [325924136] [2022-07-21 01:59:08,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [325924136] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:59:08,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 01:59:08,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2022-07-21 01:59:08,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582794190] [2022-07-21 01:59:08,973 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 01:59:08,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 01:59:08,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:59:08,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 01:59:08,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-21 01:59:08,974 INFO L87 Difference]: Start difference. First operand 104 states and 129 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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-21 01:59:10,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:59:10,618 INFO L93 Difference]: Finished difference Result 264 states and 340 transitions. [2022-07-21 01:59:10,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 01:59:10,619 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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 19 [2022-07-21 01:59:10,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:59:10,620 INFO L225 Difference]: With dead ends: 264 [2022-07-21 01:59:10,620 INFO L226 Difference]: Without dead ends: 188 [2022-07-21 01:59:10,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-21 01:59:10,621 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 151 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-21 01:59:10,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 566 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-21 01:59:10,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-07-21 01:59:10,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 104. [2022-07-21 01:59:10,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 101 states have internal predecessors, (112), 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-21 01:59:10,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 128 transitions. [2022-07-21 01:59:10,627 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 128 transitions. Word has length 19 [2022-07-21 01:59:10,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:59:10,627 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 128 transitions. [2022-07-21 01:59:10,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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-21 01:59:10,628 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 128 transitions. [2022-07-21 01:59:10,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-21 01:59:10,628 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:59:10,628 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:59:10,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-21 01:59:10,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:59:10,837 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:59:10,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:59:10,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1594907966, now seen corresponding path program 1 times [2022-07-21 01:59:10,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:59:10,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1487697134] [2022-07-21 01:59:10,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:10,837 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:59:10,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:59:10,838 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:59:10,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-21 01:59:10,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:10,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 01:59:10,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:59:10,944 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-21 01:59:10,944 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 1 case distinctions, treesize of input 16 treesize of output 17 [2022-07-21 01:59:10,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-21 01:59:10,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:59:10,979 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:59:10,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:59:10,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1487697134] [2022-07-21 01:59:10,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1487697134] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:59:10,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:59:10,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 01:59:10,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060167283] [2022-07-21 01:59:10,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:59:10,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 01:59:10,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:59:10,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 01:59:10,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 01:59:10,981 INFO L87 Difference]: Start difference. First operand 104 states and 128 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-21 01:59:11,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:59:11,661 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2022-07-21 01:59:11,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 01:59:11,662 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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 22 [2022-07-21 01:59:11,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:59:11,663 INFO L225 Difference]: With dead ends: 209 [2022-07-21 01:59:11,663 INFO L226 Difference]: Without dead ends: 206 [2022-07-21 01:59:11,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 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-21 01:59:11,664 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 357 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 01:59:11,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 287 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 01:59:11,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-07-21 01:59:11,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 110. [2022-07-21 01:59:11,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 107 states have internal predecessors, (119), 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-21 01:59:11,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 135 transitions. [2022-07-21 01:59:11,670 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 135 transitions. Word has length 22 [2022-07-21 01:59:11,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:59:11,671 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 135 transitions. [2022-07-21 01:59:11,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-21 01:59:11,671 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 135 transitions. [2022-07-21 01:59:11,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 01:59:11,671 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:59:11,671 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:59:11,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-07-21 01:59:11,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:59:11,879 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:59:11,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:59:11,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1900694176, now seen corresponding path program 2 times [2022-07-21 01:59:11,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:59:11,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1378679572] [2022-07-21 01:59:11,880 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 01:59:11,880 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:59:11,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:59:11,881 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:59:11,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-21 01:59:11,936 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-21 01:59:11,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 01:59:11,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 01:59:11,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:59:11,994 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-21 01:59:11,998 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-21 01:59:12,009 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-21 01:59:12,010 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:59:12,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:59:12,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1378679572] [2022-07-21 01:59:12,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1378679572] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:59:12,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:59:12,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 01:59:12,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229587329] [2022-07-21 01:59:12,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:59:12,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 01:59:12,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:59:12,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 01:59:12,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 01:59:12,012 INFO L87 Difference]: Start difference. First operand 110 states and 135 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-21 01:59:12,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:59:12,630 INFO L93 Difference]: Finished difference Result 137 states and 168 transitions. [2022-07-21 01:59:12,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 01:59:12,630 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-21 01:59:12,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:59:12,631 INFO L225 Difference]: With dead ends: 137 [2022-07-21 01:59:12,631 INFO L226 Difference]: Without dead ends: 134 [2022-07-21 01:59:12,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 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-21 01:59:12,632 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 38 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 288 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.6s IncrementalHoareTripleChecker+Time [2022-07-21 01:59:12,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 288 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 01:59:12,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-21 01:59:12,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 105. [2022-07-21 01:59:12,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 90 states have (on average 1.2555555555555555) internal successors, (113), 102 states have internal predecessors, (113), 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-21 01:59:12,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2022-07-21 01:59:12,638 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 24 [2022-07-21 01:59:12,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:59:12,638 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2022-07-21 01:59:12,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-21 01:59:12,638 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2022-07-21 01:59:12,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 01:59:12,638 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:59:12,639 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:59:12,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-21 01:59:12,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:59:12,846 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:59:12,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:59:12,846 INFO L85 PathProgramCache]: Analyzing trace with hash 2068857130, now seen corresponding path program 2 times [2022-07-21 01:59:12,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:59:12,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1295958956] [2022-07-21 01:59:12,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 01:59:12,847 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:59:12,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:59:12,848 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:59:12,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-21 01:59:12,900 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-21 01:59:12,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 01:59:12,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 01:59:12,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:59:12,949 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-21 01:59:12,959 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-21 01:59:12,969 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-21 01:59:12,969 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:59:12,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:59:12,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1295958956] [2022-07-21 01:59:12,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1295958956] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:59:12,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:59:12,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 01:59:12,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439909894] [2022-07-21 01:59:12,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:59:12,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 01:59:12,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:59:12,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 01:59:12,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 01:59:12,971 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-21 01:59:13,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:59:13,423 INFO L93 Difference]: Finished difference Result 107 states and 129 transitions. [2022-07-21 01:59:13,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 01:59:13,424 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-21 01:59:13,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:59:13,427 INFO L225 Difference]: With dead ends: 107 [2022-07-21 01:59:13,427 INFO L226 Difference]: Without dead ends: 104 [2022-07-21 01:59:13,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 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-21 01:59:13,428 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 11 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 307 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.4s IncrementalHoareTripleChecker+Time [2022-07-21 01:59:13,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 307 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 01:59:13,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-21 01:59:13,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-07-21 01:59:13,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 101 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-21 01:59:13,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 126 transitions. [2022-07-21 01:59:13,434 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 126 transitions. Word has length 24 [2022-07-21 01:59:13,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:59:13,434 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 126 transitions. [2022-07-21 01:59:13,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-21 01:59:13,434 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 126 transitions. [2022-07-21 01:59:13,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-21 01:59:13,435 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:59:13,435 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:59:13,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-21 01:59:13,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:59:13,643 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:59:13,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:59:13,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1214031067, now seen corresponding path program 1 times [2022-07-21 01:59:13,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:59:13,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [213848665] [2022-07-21 01:59:13,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:13,644 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:59:13,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:59:13,645 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:59:13,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-21 01:59:13,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:13,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-21 01:59:13,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:59:13,769 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-21 01:59:13,788 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 01:59:13,789 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-21 01:59:13,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:13,795 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-21 01:59:13,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:13,804 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-21 01:59:13,841 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 22 treesize of output 25 [2022-07-21 01:59:13,846 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 26 treesize of output 29 [2022-07-21 01:59:14,046 INFO L356 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-07-21 01:59:14,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 35 [2022-07-21 01:59:14,055 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 01:59:14,056 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 1 case distinctions, treesize of input 26 treesize of output 16 [2022-07-21 01:59:14,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:59:14,069 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:59:14,069 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:59:14,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [213848665] [2022-07-21 01:59:14,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [213848665] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:59:14,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:59:14,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 01:59:14,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872315360] [2022-07-21 01:59:14,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:59:14,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 01:59:14,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:59:14,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 01:59:14,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 01:59:14,072 INFO L87 Difference]: Start difference. First operand 104 states and 126 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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-21 01:59:15,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:59:15,506 INFO L93 Difference]: Finished difference Result 271 states and 344 transitions. [2022-07-21 01:59:15,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 01:59:15,506 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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 25 [2022-07-21 01:59:15,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:59:15,507 INFO L225 Difference]: With dead ends: 271 [2022-07-21 01:59:15,507 INFO L226 Difference]: Without dead ends: 268 [2022-07-21 01:59:15,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-07-21 01:59:15,509 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 529 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-21 01:59:15,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 322 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-21 01:59:15,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-07-21 01:59:15,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 107. [2022-07-21 01:59:15,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 93 states have (on average 1.2365591397849462) internal successors, (115), 104 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-21 01:59:15,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 129 transitions. [2022-07-21 01:59:15,517 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 129 transitions. Word has length 25 [2022-07-21 01:59:15,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:59:15,517 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 129 transitions. [2022-07-21 01:59:15,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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-21 01:59:15,517 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 129 transitions. [2022-07-21 01:59:15,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-21 01:59:15,518 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:59:15,518 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:59:15,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-21 01:59:15,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:59:15,726 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:59:15,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:59:15,726 INFO L85 PathProgramCache]: Analyzing trace with hash 361371631, now seen corresponding path program 1 times [2022-07-21 01:59:15,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:59:15,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [670335441] [2022-07-21 01:59:15,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:15,727 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:59:15,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:59:15,728 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:59:15,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-21 01:59:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:15,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 01:59:15,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:59:15,872 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-21 01:59:15,872 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 1 case distinctions, treesize of input 16 treesize of output 17 [2022-07-21 01:59:15,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-21 01:59:15,907 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 01:59:15,908 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:59:15,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:59:15,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [670335441] [2022-07-21 01:59:15,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [670335441] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:59:15,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:59:15,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 01:59:15,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635875604] [2022-07-21 01:59:15,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:59:15,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 01:59:15,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:59:15,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 01:59:15,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 01:59:15,910 INFO L87 Difference]: Start difference. First operand 107 states and 129 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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-21 01:59:16,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:59:16,549 INFO L93 Difference]: Finished difference Result 199 states and 243 transitions. [2022-07-21 01:59:16,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 01:59:16,550 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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-21 01:59:16,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:59:16,550 INFO L225 Difference]: With dead ends: 199 [2022-07-21 01:59:16,550 INFO L226 Difference]: Without dead ends: 196 [2022-07-21 01:59:16,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 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-21 01:59:16,551 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 341 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 275 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.6s IncrementalHoareTripleChecker+Time [2022-07-21 01:59:16,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 275 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 01:59:16,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-07-21 01:59:16,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 113. [2022-07-21 01:59:16,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 99 states have (on average 1.2222222222222223) internal successors, (121), 110 states have internal predecessors, (121), 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-21 01:59:16,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 135 transitions. [2022-07-21 01:59:16,559 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 135 transitions. Word has length 27 [2022-07-21 01:59:16,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:59:16,560 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 135 transitions. [2022-07-21 01:59:16,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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-21 01:59:16,560 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 135 transitions. [2022-07-21 01:59:16,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-21 01:59:16,560 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:59:16,561 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:59:16,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-21 01:59:16,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:59:16,761 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:59:16,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:59:16,761 INFO L85 PathProgramCache]: Analyzing trace with hash -2027066889, now seen corresponding path program 1 times [2022-07-21 01:59:16,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:59:16,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [330039608] [2022-07-21 01:59:16,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:16,762 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:59:16,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:59:16,763 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:59:16,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-21 01:59:16,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:16,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-21 01:59:16,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:59:16,929 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-21 01:59:16,949 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 01:59:16,949 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-21 01:59:16,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:16,968 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-21 01:59:16,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:16,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-21 01:59:17,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:17,014 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 24 treesize of output 27 [2022-07-21 01:59:17,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:17,020 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 28 treesize of output 31 [2022-07-21 01:59:17,177 INFO L356 Elim1Store]: treesize reduction 29, result has 9.4 percent of original size [2022-07-21 01:59:17,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 35 [2022-07-21 01:59:17,185 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 01:59:17,185 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 1 case distinctions, treesize of input 26 treesize of output 16 [2022-07-21 01:59:17,198 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 01:59:17,199 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:59:17,199 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:59:17,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [330039608] [2022-07-21 01:59:17,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [330039608] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:59:17,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:59:17,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 01:59:17,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260150506] [2022-07-21 01:59:17,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:59:17,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 01:59:17,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:59:17,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 01:59:17,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 01:59:17,201 INFO L87 Difference]: Start difference. First operand 113 states and 135 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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-21 01:59:18,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:59:18,617 INFO L93 Difference]: Finished difference Result 269 states and 340 transitions. [2022-07-21 01:59:18,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 01:59:18,617 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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 30 [2022-07-21 01:59:18,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:59:18,618 INFO L225 Difference]: With dead ends: 269 [2022-07-21 01:59:18,618 INFO L226 Difference]: Without dead ends: 266 [2022-07-21 01:59:18,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-07-21 01:59:18,619 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 521 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-21 01:59:18,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 322 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-21 01:59:18,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-07-21 01:59:18,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 116. [2022-07-21 01:59:18,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 102 states have (on average 1.2156862745098038) internal successors, (124), 113 states have internal predecessors, (124), 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-21 01:59:18,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 138 transitions. [2022-07-21 01:59:18,628 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 138 transitions. Word has length 30 [2022-07-21 01:59:18,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:59:18,628 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 138 transitions. [2022-07-21 01:59:18,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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-21 01:59:18,628 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 138 transitions. [2022-07-21 01:59:18,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-21 01:59:18,629 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:59:18,629 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:59:18,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-21 01:59:18,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:59:18,829 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:59:18,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:59:18,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1330919514, now seen corresponding path program 1 times [2022-07-21 01:59:18,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:59:18,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [457903073] [2022-07-21 01:59:18,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:18,830 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:59:18,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:59:18,831 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:59:18,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-21 01:59:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:18,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 01:59:18,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:59:18,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:59:18,953 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:59:18,953 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:59:18,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [457903073] [2022-07-21 01:59:18,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [457903073] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:59:18,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:59:18,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 01:59:18,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900163740] [2022-07-21 01:59:18,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:59:18,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 01:59:18,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:59:18,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 01:59:18,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 01:59:18,954 INFO L87 Difference]: Start difference. First operand 116 states and 138 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-21 01:59:19,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:59:19,042 INFO L93 Difference]: Finished difference Result 154 states and 189 transitions. [2022-07-21 01:59:19,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 01:59:19,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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 31 [2022-07-21 01:59:19,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:59:19,043 INFO L225 Difference]: With dead ends: 154 [2022-07-21 01:59:19,044 INFO L226 Difference]: Without dead ends: 151 [2022-07-21 01:59:19,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-21 01:59:19,044 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 201 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 01:59:19,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 272 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 01:59:19,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-21 01:59:19,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 120. [2022-07-21 01:59:19,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 106 states have (on average 1.2169811320754718) internal successors, (129), 117 states have internal predecessors, (129), 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-21 01:59:19,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 143 transitions. [2022-07-21 01:59:19,054 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 143 transitions. Word has length 31 [2022-07-21 01:59:19,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:59:19,054 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 143 transitions. [2022-07-21 01:59:19,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-21 01:59:19,055 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 143 transitions. [2022-07-21 01:59:19,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-21 01:59:19,055 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:59:19,055 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:59:19,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-07-21 01:59:19,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:59:19,263 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:59:19,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:59:19,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1708376279, now seen corresponding path program 1 times [2022-07-21 01:59:19,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:59:19,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [514377645] [2022-07-21 01:59:19,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:19,264 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:59:19,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:59:19,266 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:59:19,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-21 01:59:19,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:19,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-21 01:59:19,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:59:19,387 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 14 treesize of output 15 [2022-07-21 01:59:19,392 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 14 treesize of output 15 [2022-07-21 01:59:19,518 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-21 01:59:19,522 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-21 01:59:19,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:59:19,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:59:19,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:59:19,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:59:19,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [514377645] [2022-07-21 01:59:19,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [514377645] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:59:19,669 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 01:59:19,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2022-07-21 01:59:19,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17161270] [2022-07-21 01:59:19,669 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 01:59:19,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 01:59:19,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:59:19,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 01:59:19,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-21 01:59:19,670 INFO L87 Difference]: Start difference. First operand 120 states and 143 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 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-21 01:59:20,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:59:20,714 INFO L93 Difference]: Finished difference Result 171 states and 206 transitions. [2022-07-21 01:59:20,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 01:59:20,714 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 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 34 [2022-07-21 01:59:20,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:59:20,715 INFO L225 Difference]: With dead ends: 171 [2022-07-21 01:59:20,715 INFO L226 Difference]: Without dead ends: 168 [2022-07-21 01:59:20,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-21 01:59:20,716 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 83 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-21 01:59:20,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 441 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-21 01:59:20,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-21 01:59:20,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 139. [2022-07-21 01:59:20,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 125 states have (on average 1.192) internal successors, (149), 136 states have internal predecessors, (149), 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-21 01:59:20,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 163 transitions. [2022-07-21 01:59:20,726 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 163 transitions. Word has length 34 [2022-07-21 01:59:20,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:59:20,726 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 163 transitions. [2022-07-21 01:59:20,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 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-21 01:59:20,726 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 163 transitions. [2022-07-21 01:59:20,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-21 01:59:20,727 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:59:20,727 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:59:20,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-21 01:59:20,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:59:20,931 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:59:20,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:59:20,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1210378434, now seen corresponding path program 1 times [2022-07-21 01:59:20,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:59:20,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [556490208] [2022-07-21 01:59:20,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:20,932 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:59:20,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:59:20,933 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:59:20,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-21 01:59:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:21,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-21 01:59:21,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:59:21,052 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 14 treesize of output 15 [2022-07-21 01:59:21,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-21 01:59:21,130 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:59:21,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:59:21,205 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:59:21,206 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:59:21,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [556490208] [2022-07-21 01:59:21,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [556490208] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:59:21,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 01:59:21,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2022-07-21 01:59:21,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337960131] [2022-07-21 01:59:21,206 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 01:59:21,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 01:59:21,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:59:21,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 01:59:21,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-21 01:59:21,207 INFO L87 Difference]: Start difference. First operand 139 states and 163 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-21 01:59:23,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:59:23,124 INFO L93 Difference]: Finished difference Result 409 states and 534 transitions. [2022-07-21 01:59:23,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 01:59:23,125 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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 35 [2022-07-21 01:59:23,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:59:23,126 INFO L225 Difference]: With dead ends: 409 [2022-07-21 01:59:23,126 INFO L226 Difference]: Without dead ends: 405 [2022-07-21 01:59:23,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-07-21 01:59:23,127 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 1157 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1159 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-21 01:59:23,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1159 Valid, 755 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-21 01:59:23,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2022-07-21 01:59:23,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 145. [2022-07-21 01:59:23,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 131 states have (on average 1.1908396946564885) internal successors, (156), 142 states have internal predecessors, (156), 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-21 01:59:23,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 170 transitions. [2022-07-21 01:59:23,140 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 170 transitions. Word has length 35 [2022-07-21 01:59:23,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:59:23,140 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 170 transitions. [2022-07-21 01:59:23,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-21 01:59:23,140 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 170 transitions. [2022-07-21 01:59:23,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-21 01:59:23,141 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:59:23,141 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-21 01:59:23,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-07-21 01:59:23,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:59:23,349 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:59:23,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:59:23,349 INFO L85 PathProgramCache]: Analyzing trace with hash 749828415, now seen corresponding path program 1 times [2022-07-21 01:59:23,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:59:23,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [725476957] [2022-07-21 01:59:23,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:23,350 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:59:23,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:59:23,351 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:59:23,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-21 01:59:23,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:23,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-21 01:59:23,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:59:23,485 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 14 treesize of output 15 [2022-07-21 01:59:23,496 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 14 treesize of output 15 [2022-07-21 01:59:23,593 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-21 01:59:23,595 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-21 01:59:23,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:59:23,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:59:23,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:59:23,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:59:23,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [725476957] [2022-07-21 01:59:23,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [725476957] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:59:23,701 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 01:59:23,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2022-07-21 01:59:23,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617136652] [2022-07-21 01:59:23,701 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 01:59:23,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 01:59:23,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:59:23,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 01:59:23,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-21 01:59:23,702 INFO L87 Difference]: Start difference. First operand 145 states and 170 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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-21 01:59:24,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:59:24,039 INFO L93 Difference]: Finished difference Result 200 states and 239 transitions. [2022-07-21 01:59:24,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 01:59:24,039 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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-21 01:59:24,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:59:24,040 INFO L225 Difference]: With dead ends: 200 [2022-07-21 01:59:24,040 INFO L226 Difference]: Without dead ends: 159 [2022-07-21 01:59:24,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-21 01:59:24,041 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 40 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 01:59:24,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 330 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 01:59:24,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-07-21 01:59:24,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 145. [2022-07-21 01:59:24,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 131 states have (on average 1.183206106870229) internal successors, (155), 142 states have internal predecessors, (155), 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-21 01:59:24,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 169 transitions. [2022-07-21 01:59:24,056 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 169 transitions. Word has length 36 [2022-07-21 01:59:24,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:59:24,056 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 169 transitions. [2022-07-21 01:59:24,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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-21 01:59:24,056 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 169 transitions. [2022-07-21 01:59:24,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-21 01:59:24,057 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:59:24,057 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:59:24,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-21 01:59:24,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:59:24,257 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:59:24,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:59:24,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1116813069, now seen corresponding path program 1 times [2022-07-21 01:59:24,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:59:24,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [707019128] [2022-07-21 01:59:24,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:24,258 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:59:24,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:59:24,259 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:59:24,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-21 01:59:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:24,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-21 01:59:24,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:59:24,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 17 [2022-07-21 01:59:24,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-07-21 01:59:24,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 01:59:24,467 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:59:24,467 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:59:24,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [707019128] [2022-07-21 01:59:24,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [707019128] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:59:24,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:59:24,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 01:59:24,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193792438] [2022-07-21 01:59:24,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:59:24,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 01:59:24,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:59:24,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 01:59:24,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 01:59:24,469 INFO L87 Difference]: Start difference. First operand 145 states and 169 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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-21 01:59:25,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:59:25,722 INFO L93 Difference]: Finished difference Result 188 states and 226 transitions. [2022-07-21 01:59:25,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 01:59:25,722 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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 37 [2022-07-21 01:59:25,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:59:25,723 INFO L225 Difference]: With dead ends: 188 [2022-07-21 01:59:25,723 INFO L226 Difference]: Without dead ends: 185 [2022-07-21 01:59:25,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-21 01:59:25,724 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 89 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-21 01:59:25,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 436 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-21 01:59:25,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-21 01:59:25,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 157. [2022-07-21 01:59:25,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 143 states have (on average 1.1818181818181819) internal successors, (169), 154 states have internal predecessors, (169), 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-21 01:59:25,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 183 transitions. [2022-07-21 01:59:25,736 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 183 transitions. Word has length 37 [2022-07-21 01:59:25,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:59:25,736 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 183 transitions. [2022-07-21 01:59:25,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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-21 01:59:25,736 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 183 transitions. [2022-07-21 01:59:25,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-21 01:59:25,736 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:59:25,737 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:59:25,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-21 01:59:25,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:59:25,941 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:59:25,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:59:25,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1178426459, now seen corresponding path program 2 times [2022-07-21 01:59:25,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:59:25,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1542915008] [2022-07-21 01:59:25,942 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 01:59:25,942 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:59:25,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:59:25,943 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:59:25,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-21 01:59:26,014 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-21 01:59:26,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 01:59:26,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-21 01:59:26,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:59:26,141 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-21 01:59:26,149 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-21 01:59:26,164 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-21 01:59:26,165 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:59:26,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:59:26,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1542915008] [2022-07-21 01:59:26,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1542915008] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:59:26,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:59:26,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 01:59:26,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922930338] [2022-07-21 01:59:26,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:59:26,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 01:59:26,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:59:26,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 01:59:26,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 01:59:26,166 INFO L87 Difference]: Start difference. First operand 157 states and 183 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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-21 01:59:26,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:59:26,985 INFO L93 Difference]: Finished difference Result 187 states and 224 transitions. [2022-07-21 01:59:26,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 01:59:26,986 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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-21 01:59:26,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:59:26,986 INFO L225 Difference]: With dead ends: 187 [2022-07-21 01:59:26,986 INFO L226 Difference]: Without dead ends: 184 [2022-07-21 01:59:26,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-21 01:59:26,987 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 95 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 01:59:26,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 436 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-21 01:59:26,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-07-21 01:59:26,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 152. [2022-07-21 01:59:26,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 138 states have (on average 1.181159420289855) internal successors, (163), 149 states have internal predecessors, (163), 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-21 01:59:26,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 177 transitions. [2022-07-21 01:59:26,999 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 177 transitions. Word has length 39 [2022-07-21 01:59:27,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:59:27,000 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 177 transitions. [2022-07-21 01:59:27,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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-21 01:59:27,001 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 177 transitions. [2022-07-21 01:59:27,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-21 01:59:27,001 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:59:27,001 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:59:27,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2022-07-21 01:59:27,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:59:27,209 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:59:27,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:59:27,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1081270413, now seen corresponding path program 2 times [2022-07-21 01:59:27,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:59:27,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [399408022] [2022-07-21 01:59:27,210 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 01:59:27,210 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:59:27,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:59:27,211 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:59:27,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-21 01:59:27,320 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 01:59:27,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 01:59:27,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-21 01:59:27,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:59:27,357 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 14 treesize of output 15 [2022-07-21 01:59:27,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-21 01:59:27,395 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 01:59:27,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:59:27,444 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 01:59:27,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:59:27,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [399408022] [2022-07-21 01:59:27,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [399408022] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:59:27,444 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 01:59:27,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-07-21 01:59:27,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377782393] [2022-07-21 01:59:27,445 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 01:59:27,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 01:59:27,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:59:27,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 01:59:27,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-21 01:59:27,446 INFO L87 Difference]: Start difference. First operand 152 states and 177 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 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-21 01:59:29,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:59:29,138 INFO L93 Difference]: Finished difference Result 257 states and 316 transitions. [2022-07-21 01:59:29,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 01:59:29,138 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 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 41 [2022-07-21 01:59:29,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:59:29,139 INFO L225 Difference]: With dead ends: 257 [2022-07-21 01:59:29,139 INFO L226 Difference]: Without dead ends: 194 [2022-07-21 01:59:29,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2022-07-21 01:59:29,140 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 375 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-21 01:59:29,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 772 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-21 01:59:29,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-07-21 01:59:29,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 138. [2022-07-21 01:59:29,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 124 states have (on average 1.185483870967742) internal successors, (147), 135 states have internal predecessors, (147), 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-21 01:59:29,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 161 transitions. [2022-07-21 01:59:29,155 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 161 transitions. Word has length 41 [2022-07-21 01:59:29,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:59:29,155 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 161 transitions. [2022-07-21 01:59:29,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 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-21 01:59:29,155 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 161 transitions. [2022-07-21 01:59:29,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-21 01:59:29,155 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:59:29,156 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:59:29,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-21 01:59:29,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:59:29,364 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:59:29,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:59:29,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1304250571, now seen corresponding path program 1 times [2022-07-21 01:59:29,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:59:29,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2098967471] [2022-07-21 01:59:29,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:29,365 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:59:29,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:59:29,366 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:59:29,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-21 01:59:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:29,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-21 01:59:29,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:59:29,520 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-21 01:59:29,539 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 14 treesize of output 15 [2022-07-21 01:59:29,566 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 01:59:29,566 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 12 treesize of output 12 [2022-07-21 01:59:29,598 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-21 01:59:29,641 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-21 01:59:29,641 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 23 treesize of output 30 [2022-07-21 01:59:29,661 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 14 treesize of output 15 [2022-07-21 01:59:29,861 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-21 01:59:29,976 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 01:59:29,976 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-21 01:59:29,993 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:59:29,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:59:32,104 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (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|) (bvadd |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv4 32)) |c_ULTIMATE.start_main_~data~0#1.base|)) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-21 01:59:32,252 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_667))) (store .cse0 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse0 |ULTIMATE.start_main_~item~0#1.base|) (_ bv0 32) |c_ULTIMATE.start_main_~node~1#1.base|) (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-21 01:59:32,651 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-21 01:59:32,651 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-21 01:59:32,663 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 01:59:32,663 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 159 treesize of output 157 [2022-07-21 01:59:32,674 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 214 treesize of output 206 [2022-07-21 01:59:32,856 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-21 01:59:32,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 9 [2022-07-21 01:59:32,971 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-21 01:59:32,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:59:32,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2098967471] [2022-07-21 01:59:32,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2098967471] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:59:32,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 01:59:32,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2022-07-21 01:59:32,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968504811] [2022-07-21 01:59:32,972 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 01:59:32,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-21 01:59:32,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:59:32,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-21 01:59:32,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=198, Unknown=7, NotChecked=58, Total=306 [2022-07-21 01:59:32,973 INFO L87 Difference]: Start difference. First operand 138 states and 161 transitions. Second operand has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 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-21 01:59:33,230 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~node~1#1.base| (_ bv0 32))) (forall ((v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_667))) (store .cse0 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse0 |ULTIMATE.start_main_~item~0#1.base|) (_ bv0 32) |c_ULTIMATE.start_main_~node~1#1.base|) (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) (_ bv0 32)))) (= |c_ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)) (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~data~0#1.base| |c_ULTIMATE.start_main_~node~1#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))) is different from false [2022-07-21 01:59:33,298 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~node~1#1.base| (_ bv0 32))) (forall ((v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_667))) (store .cse0 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse0 |ULTIMATE.start_main_~item~0#1.base|) (_ bv0 32) |c_ULTIMATE.start_main_~node~1#1.base|) (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) (_ bv0 32)))) (= |c_ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)) (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~data~0#1.base| |c_ULTIMATE.start_main_~node~1#1.base|))) is different from false [2022-07-21 01:59:35,338 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (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|) (bvadd |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv4 32)) |c_ULTIMATE.start_main_~data~0#1.base|)) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) (_ bv0 32)))) (= |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~node~1#1.base| (_ bv0 32))) (= |c_ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)) (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~data~0#1.base| |c_ULTIMATE.start_main_~node~1#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))) is different from false [2022-07-21 01:59:35,571 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse1 (select .cse3 (_ bv0 32))) (.cse2 (select .cse3 (_ bv4 32)))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~node~1#1.base| (_ bv0 32))) (forall ((v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_667))) (store .cse0 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse0 |ULTIMATE.start_main_~item~0#1.base|) (_ bv0 32) |c_ULTIMATE.start_main_~node~1#1.base|) (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) (_ bv0 32)))) (not (= .cse1 .cse2)) (= |c_ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (not (= .cse1 (_ bv0 32))) (not (= (_ bv0 32) (select (select |c_#memory_$Pointer$.base| .cse2) (_ bv0 32)))) (not (= |c_ULTIMATE.start_main_~data~0#1.base| |c_ULTIMATE.start_main_~node~1#1.base|))))) is different from false [2022-07-21 01:59:37,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:59:37,170 INFO L93 Difference]: Finished difference Result 156 states and 180 transitions. [2022-07-21 01:59:37,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 01:59:37,170 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 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 41 [2022-07-21 01:59:37,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:59:37,171 INFO L225 Difference]: With dead ends: 156 [2022-07-21 01:59:37,171 INFO L226 Difference]: Without dead ends: 153 [2022-07-21 01:59:37,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=108, Invalid=410, Unknown=12, NotChecked=282, Total=812 [2022-07-21 01:59:37,172 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 205 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 308 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-21 01:59:37,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 923 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 280 Invalid, 0 Unknown, 308 Unchecked, 1.6s Time] [2022-07-21 01:59:37,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-21 01:59:37,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 144. [2022-07-21 01:59:37,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 130 states have (on average 1.176923076923077) internal successors, (153), 141 states have internal predecessors, (153), 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-21 01:59:37,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 167 transitions. [2022-07-21 01:59:37,183 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 167 transitions. Word has length 41 [2022-07-21 01:59:37,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:59:37,183 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 167 transitions. [2022-07-21 01:59:37,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 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-21 01:59:37,183 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 167 transitions. [2022-07-21 01:59:37,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-21 01:59:37,183 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:59:37,183 INFO L195 NwaCegarLoop]: trace histogram [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-21 01:59:37,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-21 01:59:37,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:59:37,392 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:59:37,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:59:37,392 INFO L85 PathProgramCache]: Analyzing trace with hash 517314090, now seen corresponding path program 1 times [2022-07-21 01:59:37,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:59:37,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [127790422] [2022-07-21 01:59:37,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:37,392 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:59:37,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:59:37,395 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:59:37,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-21 01:59:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:37,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-21 01:59:37,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:59:37,575 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-21 01:59:37,594 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 14 treesize of output 15 [2022-07-21 01:59:37,598 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 14 treesize of output 15 [2022-07-21 01:59:37,632 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 01:59:37,632 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 12 treesize of output 12 [2022-07-21 01:59:37,674 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 14 treesize of output 16 [2022-07-21 01:59:37,684 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 14 treesize of output 16 [2022-07-21 01:59:37,762 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-21 01:59:37,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 29 [2022-07-21 01:59:37,775 INFO L356 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-07-21 01:59:37,775 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 26 treesize of output 29 [2022-07-21 01:59:38,242 INFO L356 Elim1Store]: treesize reduction 34, result has 8.1 percent of original size [2022-07-21 01:59:38,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 16 [2022-07-21 01:59:38,465 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-07-21 01:59:38,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 28 [2022-07-21 01:59:38,486 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:59:38,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:59:40,937 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (let ((.cse0 (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|) (bvadd |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv4 32)) |c_ULTIMATE.start_main_~data~0#1.base|)) |c_ULTIMATE.start_main_~data~0#1.base|))) (or (not (= (select .cse0 |c_ULTIMATE.start_main_~data~0#1.offset|) (_ bv0 32))) (and (forall ((v_ArrVal_731 (_ BitVec 32))) (= (select (select (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| v_ArrVal_731) (bvadd |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv4 32)) |c_ULTIMATE.start_main_~data~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.offset|)) (_ bv0 32))) (= (select .cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.offset|)) (_ bv0 32)))))) is different from false [2022-07-21 01:59:41,039 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_729 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (let ((.cse0 (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_730))) (store .cse2 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse2 |ULTIMATE.start_main_~item~0#1.base|) (_ bv0 32) |c_ULTIMATE.start_main_~node~1#1.base|) (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|))) (or (not (= (select .cse0 |c_ULTIMATE.start_main_~data~0#1.offset|) (_ bv0 32))) (and (forall ((v_ArrVal_731 (_ BitVec 32))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_729))) (store .cse1 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse1 |ULTIMATE.start_main_~item~0#1.base|) (_ bv0 32) v_ArrVal_731) (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.offset|)) (_ bv0 32))) (= (select .cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.offset|)) (_ bv0 32)))))) is different from false [2022-07-21 01:59:41,527 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:59:41,576 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 01:59:41,576 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 52 treesize of output 45 [2022-07-21 01:59:41,628 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 01:59:41,629 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 250 treesize of output 246 [2022-07-21 01:59:41,647 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 698 treesize of output 654 [2022-07-21 01:59:42,440 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 87 treesize of output 75 [2022-07-21 01:59:42,497 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-21 01:59:42,497 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 112 treesize of output 78 [2022-07-21 01:59:42,519 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 01:59:42,519 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 327 treesize of output 317 [2022-07-21 01:59:42,537 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:59:42,538 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 0 case distinctions, treesize of input 463 treesize of output 439 [2022-07-21 01:59:42,978 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-21 01:59:42,978 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 201 treesize of output 183 [2022-07-21 01:59:43,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 9 [2022-07-21 01:59:43,138 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-21 01:59:43,138 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:59:43,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [127790422] [2022-07-21 01:59:43,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [127790422] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:59:43,138 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 01:59:43,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2022-07-21 01:59:43,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095600039] [2022-07-21 01:59:43,138 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 01:59:43,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-21 01:59:43,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:59:43,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-21 01:59:43,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=326, Unknown=5, NotChecked=74, Total=462 [2022-07-21 01:59:43,139 INFO L87 Difference]: Start difference. First operand 144 states and 167 transitions. Second operand has 22 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 22 states have internal predecessors, (74), 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-21 01:59:43,283 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~node~1#1.base| (_ bv0 32))) (= |c_ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~data~0#1.base| |c_ULTIMATE.start_main_~node~1#1.base|)) (forall ((v_ArrVal_730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_729 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (let ((.cse0 (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_730))) (store .cse2 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse2 |ULTIMATE.start_main_~item~0#1.base|) (_ bv0 32) |c_ULTIMATE.start_main_~node~1#1.base|) (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|))) (or (not (= (select .cse0 |c_ULTIMATE.start_main_~data~0#1.offset|) (_ bv0 32))) (and (forall ((v_ArrVal_731 (_ BitVec 32))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_729))) (store .cse1 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse1 |ULTIMATE.start_main_~item~0#1.base|) (_ bv0 32) v_ArrVal_731) (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.offset|)) (_ bv0 32))) (= (select .cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.offset|)) (_ bv0 32)))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) (_ bv0 32)) (= (select |c_#valid| |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv1 1))) is different from false [2022-07-21 01:59:43,293 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~node~1#1.base| (_ bv0 32))) (= |c_ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~data~0#1.base| |c_ULTIMATE.start_main_~node~1#1.base|)) (forall ((v_ArrVal_730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_729 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (let ((.cse0 (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_730))) (store .cse2 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse2 |ULTIMATE.start_main_~item~0#1.base|) (_ bv0 32) |c_ULTIMATE.start_main_~node~1#1.base|) (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|))) (or (not (= (select .cse0 |c_ULTIMATE.start_main_~data~0#1.offset|) (_ bv0 32))) (and (forall ((v_ArrVal_731 (_ BitVec 32))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_729))) (store .cse1 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse1 |ULTIMATE.start_main_~item~0#1.base|) (_ bv0 32) v_ArrVal_731) (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.offset|)) (_ bv0 32))) (= (select .cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.offset|)) (_ bv0 32)))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) (_ bv0 32))) is different from false [2022-07-21 01:59:45,347 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) (_ bv0 32)) (= |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~node~1#1.base| (_ bv0 32))) (forall ((|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (let ((.cse0 (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|) (bvadd |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv4 32)) |c_ULTIMATE.start_main_~data~0#1.base|)) |c_ULTIMATE.start_main_~data~0#1.base|))) (or (not (= (select .cse0 |c_ULTIMATE.start_main_~data~0#1.offset|) (_ bv0 32))) (and (forall ((v_ArrVal_731 (_ BitVec 32))) (= (select (select (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| v_ArrVal_731) (bvadd |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv4 32)) |c_ULTIMATE.start_main_~data~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.offset|)) (_ bv0 32))) (= (select .cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.offset|)) (_ bv0 32)))))) (= |c_ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~data~0#1.base| |c_ULTIMATE.start_main_~node~1#1.base|)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) (_ bv0 32))) is different from false [2022-07-21 01:59:48,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:59:48,962 INFO L93 Difference]: Finished difference Result 188 states and 214 transitions. [2022-07-21 01:59:48,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 01:59:48,963 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 22 states have internal predecessors, (74), 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 41 [2022-07-21 01:59:48,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:59:48,964 INFO L225 Difference]: With dead ends: 188 [2022-07-21 01:59:48,964 INFO L226 Difference]: Without dead ends: 185 [2022-07-21 01:59:48,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=117, Invalid=597, Unknown=8, NotChecked=270, Total=992 [2022-07-21 01:59:48,964 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 122 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 397 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-21 01:59:48,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 1145 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 414 Invalid, 0 Unknown, 397 Unchecked, 3.3s Time] [2022-07-21 01:59:48,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-21 01:59:48,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 175. [2022-07-21 01:59:48,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 161 states have (on average 1.15527950310559) internal successors, (186), 172 states have internal predecessors, (186), 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-21 01:59:48,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 200 transitions. [2022-07-21 01:59:48,979 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 200 transitions. Word has length 41 [2022-07-21 01:59:48,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:59:48,979 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 200 transitions. [2022-07-21 01:59:48,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 22 states have internal predecessors, (74), 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-21 01:59:48,979 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 200 transitions. [2022-07-21 01:59:48,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-21 01:59:48,980 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:59:48,980 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:59:48,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-21 01:59:49,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:59:49,189 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:59:49,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:59:49,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1183803585, now seen corresponding path program 1 times [2022-07-21 01:59:49,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:59:49,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [157856915] [2022-07-21 01:59:49,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:49,190 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:59:49,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:59:49,191 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:59:49,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-21 01:59:49,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:49,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-21 01:59:49,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:59:49,484 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 01:59:49,484 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 48 [2022-07-21 01:59:49,497 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 01:59:49,497 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 34 [2022-07-21 01:59:49,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 01:59:49,521 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:59:49,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:59:49,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [157856915] [2022-07-21 01:59:49,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [157856915] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:59:49,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:59:49,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 01:59:49,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561382710] [2022-07-21 01:59:49,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:59:49,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 01:59:49,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:59:49,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 01:59:49,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 01:59:49,523 INFO L87 Difference]: Start difference. First operand 175 states and 200 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 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-21 01:59:50,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:59:50,414 INFO L93 Difference]: Finished difference Result 185 states and 210 transitions. [2022-07-21 01:59:50,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 01:59:50,415 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 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 43 [2022-07-21 01:59:50,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:59:50,416 INFO L225 Difference]: With dead ends: 185 [2022-07-21 01:59:50,416 INFO L226 Difference]: Without dead ends: 180 [2022-07-21 01:59:50,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-07-21 01:59:50,417 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 39 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 01:59:50,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 514 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 35 Unchecked, 0.8s Time] [2022-07-21 01:59:50,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-07-21 01:59:50,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2022-07-21 01:59:50,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 165 states have (on average 1.1515151515151516) internal successors, (190), 176 states have internal predecessors, (190), 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-21 01:59:50,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 204 transitions. [2022-07-21 01:59:50,430 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 204 transitions. Word has length 43 [2022-07-21 01:59:50,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:59:50,430 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 204 transitions. [2022-07-21 01:59:50,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 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-21 01:59:50,430 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 204 transitions. [2022-07-21 01:59:50,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-21 01:59:50,431 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:59:50,431 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:59:50,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-21 01:59:50,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:59:50,639 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:59:50,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:59:50,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1746315726, now seen corresponding path program 1 times [2022-07-21 01:59:50,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:59:50,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1242312548] [2022-07-21 01:59:50,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:50,640 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:59:50,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:59:50,641 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:59:50,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-21 01:59:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:50,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-21 01:59:50,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:59:50,836 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-21 01:59:50,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:50,853 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-21 01:59:50,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:50,861 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-21 01:59:50,879 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 01:59:50,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-21 01:59:50,937 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 0 case distinctions, treesize of input 22 treesize of output 25 [2022-07-21 01:59:50,944 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 0 case distinctions, treesize of input 26 treesize of output 29 [2022-07-21 01:59:50,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:51,006 INFO L356 Elim1Store]: treesize reduction 42, result has 44.0 percent of original size [2022-07-21 01:59:51,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 50 [2022-07-21 01:59:51,110 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 01:59:51,110 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 50 [2022-07-21 01:59:51,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:51,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-07-21 01:59:51,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:51,140 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-21 01:59:51,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2022-07-21 01:59:51,261 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-21 01:59:51,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 50 [2022-07-21 01:59:51,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:51,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 47 [2022-07-21 01:59:52,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:52,522 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:59:52,565 INFO L356 Elim1Store]: treesize reduction 119, result has 11.2 percent of original size [2022-07-21 01:59:52,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 169 treesize of output 89 [2022-07-21 01:59:52,586 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-07-21 01:59:52,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 25 [2022-07-21 01:59:52,615 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:59:52,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:59:53,336 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_824 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_825 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~item~0#1.base_25| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_25|) (_ bv0 1))) (and (forall ((v_ArrVal_827 (_ BitVec 32))) (= (_ bv0 32) (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_824))) (store .cse2 |v_ULTIMATE.start_main_~item~0#1.base_25| (store (store (select .cse2 |v_ULTIMATE.start_main_~item~0#1.base_25|) (_ bv0 32) v_ArrVal_827) (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.offset|))))) (select (select .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_825))) (store .cse1 |v_ULTIMATE.start_main_~item~0#1.base_25| (store (store (select .cse1 |v_ULTIMATE.start_main_~item~0#1.base_25|) (_ bv0 32) |c_ULTIMATE.start_main_~node~1#1.base|) (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|))))) (forall ((v_ArrVal_827 (_ BitVec 32))) (= (select (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_825))) (store .cse4 |v_ULTIMATE.start_main_~item~0#1.base_25| (store (store (select .cse4 |v_ULTIMATE.start_main_~item~0#1.base_25|) (_ bv0 32) |c_ULTIMATE.start_main_~node~1#1.base|) (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.base|))))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|))) (select (select (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_824))) (store .cse5 |v_ULTIMATE.start_main_~item~0#1.base_25| (store (store (select .cse5 |v_ULTIMATE.start_main_~item~0#1.base_25|) (_ bv0 32) v_ArrVal_827) (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|)) (_ bv0 32)))) (not (= (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_825))) (store .cse6 |v_ULTIMATE.start_main_~item~0#1.base_25| (store (store (select .cse6 |v_ULTIMATE.start_main_~item~0#1.base_25|) (_ bv0 32) |c_ULTIMATE.start_main_~node~1#1.base|) (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.offset|)) (_ bv0 32))))) is different from false [2022-07-21 01:59:53,766 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_825 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_823 (_ BitVec 1)) (|v_ULTIMATE.start_main_~node~1#1.base_22| (_ BitVec 32)) (|v_ULTIMATE.start_main_~item~0#1.base_25| (_ BitVec 32))) (or (and (forall ((v_ArrVal_827 (_ BitVec 32)) (v_ArrVal_824 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~1#1.base_22| v_ArrVal_825))) (store .cse1 |v_ULTIMATE.start_main_~item~0#1.base_25| (store (store (select .cse1 |v_ULTIMATE.start_main_~item~0#1.base_25|) (_ bv0 32) |v_ULTIMATE.start_main_~node~1#1.base_22|) (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.base|))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|))) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~node~1#1.base_22| v_ArrVal_824))) (store .cse2 |v_ULTIMATE.start_main_~item~0#1.base_25| (store (store (select .cse2 |v_ULTIMATE.start_main_~item~0#1.base_25|) (_ bv0 32) v_ArrVal_827) (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|)))) (forall ((v_ArrVal_827 (_ BitVec 32)) (v_ArrVal_824 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse3 (let ((.cse5 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~node~1#1.base_22| v_ArrVal_824))) (store .cse5 |v_ULTIMATE.start_main_~item~0#1.base_25| (store (store (select .cse5 |v_ULTIMATE.start_main_~item~0#1.base_25|) (_ bv0 32) v_ArrVal_827) (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.offset|))))) (select (select .cse3 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~1#1.base_22| v_ArrVal_825))) (store .cse4 |v_ULTIMATE.start_main_~item~0#1.base_25| (store (store (select .cse4 |v_ULTIMATE.start_main_~item~0#1.base_25|) (_ bv0 32) |v_ULTIMATE.start_main_~node~1#1.base_22|) (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|)) (select (select .cse3 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|))) (_ bv0 32)))) (not (= (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~1#1.base_22| v_ArrVal_825))) (store .cse6 |v_ULTIMATE.start_main_~item~0#1.base_25| (store (store (select .cse6 |v_ULTIMATE.start_main_~item~0#1.base_25|) (_ bv0 32) |v_ULTIMATE.start_main_~node~1#1.base_22|) (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.offset|)) (_ bv0 32))) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~node~1#1.base_22| v_ArrVal_823) |v_ULTIMATE.start_main_~item~0#1.base_25|) (_ bv0 1))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~node~1#1.base_22|)))))) is different from false [2022-07-21 01:59:55,523 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_820 (_ BitVec 32)) (v_ArrVal_825 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_818 (_ BitVec 32)) (v_ArrVal_823 (_ BitVec 1)) (|v_ULTIMATE.start_main_~node~1#1.base_22| (_ BitVec 32)) (|v_ULTIMATE.start_main_~item~0#1.base_25| (_ BitVec 32))) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~node~1#1.base_22| v_ArrVal_823) |v_ULTIMATE.start_main_~item~0#1.base_25|) (_ bv0 1))) (not (= (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv4 32)))) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~node~1#1.base|) .cse1 v_ArrVal_818)) |v_ULTIMATE.start_main_~node~1#1.base_22| v_ArrVal_825))) (store .cse0 |v_ULTIMATE.start_main_~item~0#1.base_25| (store (store (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_25|) (_ bv0 32) |v_ULTIMATE.start_main_~node~1#1.base_22|) (_ bv4 32) |c_ULTIMATE.start_main_~item~0#1.base|))) |c_ULTIMATE.start_main_~item~0#1.base|) .cse1)) (_ bv0 32))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~node~1#1.base_22|)))) (and (forall ((v_ArrVal_827 (_ BitVec 32)) (v_ArrVal_824 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv4 32)))) (let ((.cse2 (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~node~1#1.offset|) .cse4 v_ArrVal_820)) |v_ULTIMATE.start_main_~node~1#1.base_22| v_ArrVal_824))) (store .cse5 |v_ULTIMATE.start_main_~item~0#1.base_25| (store (store (select .cse5 |v_ULTIMATE.start_main_~item~0#1.base_25|) (_ bv0 32) v_ArrVal_827) (_ bv4 32) |c_ULTIMATE.start_main_~item~0#1.offset|))))) (select (select .cse2 (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~node~1#1.base|) .cse4 v_ArrVal_818)) |v_ULTIMATE.start_main_~node~1#1.base_22| v_ArrVal_825))) (store .cse3 |v_ULTIMATE.start_main_~item~0#1.base_25| (store (store (select .cse3 |v_ULTIMATE.start_main_~item~0#1.base_25|) (_ bv0 32) |v_ULTIMATE.start_main_~node~1#1.base_22|) (_ bv4 32) |c_ULTIMATE.start_main_~item~0#1.base|))) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))))) (forall ((v_ArrVal_827 (_ BitVec 32)) (v_ArrVal_824 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse8 (bvadd |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv4 32)))) (select (let ((.cse6 (let ((.cse7 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~node~1#1.base|) .cse8 v_ArrVal_818)) |v_ULTIMATE.start_main_~node~1#1.base_22| v_ArrVal_825))) (store .cse7 |v_ULTIMATE.start_main_~item~0#1.base_25| (store (store (select .cse7 |v_ULTIMATE.start_main_~item~0#1.base_25|) (_ bv0 32) |v_ULTIMATE.start_main_~node~1#1.base_22|) (_ bv4 32) |c_ULTIMATE.start_main_~item~0#1.base|))))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (select (select (let ((.cse9 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~node~1#1.offset|) .cse8 v_ArrVal_820)) |v_ULTIMATE.start_main_~node~1#1.base_22| v_ArrVal_824))) (store .cse9 |v_ULTIMATE.start_main_~item~0#1.base_25| (store (store (select .cse9 |v_ULTIMATE.start_main_~item~0#1.base_25|) (_ bv0 32) v_ArrVal_827) (_ bv4 32) |c_ULTIMATE.start_main_~item~0#1.offset|))) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (_ bv0 32)))))) is different from false [2022-07-21 01:59:57,171 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:59:57,816 INFO L356 Elim1Store]: treesize reduction 125, result has 24.2 percent of original size [2022-07-21 01:59:57,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 288 treesize of output 254 [2022-07-21 01:59:57,829 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:59:57,829 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:59:57,839 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:59:57,864 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-21 01:59:57,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 435 treesize of output 413 [2022-07-21 01:59:57,886 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:59:58,687 INFO L356 Elim1Store]: treesize reduction 120, result has 27.3 percent of original size [2022-07-21 01:59:58,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 288 treesize of output 185 [2022-07-21 01:59:58,717 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:59:58,718 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:59:58,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:58,763 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:59:58,827 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 01:59:58,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1530 treesize of output 1518 [2022-07-21 01:59:58,858 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 1466 treesize of output 1442 [2022-07-21 01:59:59,946 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 6 treesize of output 4 [2022-07-21 01:59:59,991 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:59:59,998 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2022-07-21 02:00:00,115 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-07-21 02:00:00,242 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:00:00,243 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 229 treesize of output 233 [2022-07-21 02:00:00,468 INFO L356 Elim1Store]: treesize reduction 148, result has 27.1 percent of original size [2022-07-21 02:00:00,468 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 506 treesize of output 190 [2022-07-21 02:00:00,474 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:00:00,474 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:00:00,477 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:00:00,524 INFO L356 Elim1Store]: treesize reduction 20, result has 51.2 percent of original size [2022-07-21 02:00:00,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 447 treesize of output 393 [2022-07-21 02:00:00,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 436 treesize of output 422 [2022-07-21 02:00:01,353 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:00:01,357 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 24 treesize of output 20 [2022-07-21 02:00:01,389 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 6 treesize of output 4 [2022-07-21 02:00:01,406 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 6 treesize of output 4 [2022-07-21 02:00:01,671 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:00:01,671 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 185 treesize of output 183 [2022-07-21 02:00:02,090 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-07-21 02:00:02,090 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:00:02,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1242312548] [2022-07-21 02:00:02,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1242312548] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:00:02,090 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:00:02,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2022-07-21 02:00:02,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556615510] [2022-07-21 02:00:02,091 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:00:02,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-21 02:00:02,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:00:02,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-21 02:00:02,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=325, Unknown=3, NotChecked=114, Total=506 [2022-07-21 02:00:02,092 INFO L87 Difference]: Start difference. First operand 179 states and 204 transitions. Second operand has 23 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 23 states have internal predecessors, (82), 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-21 02:00:02,264 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~node~1#1.offset| (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~node~1#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (= |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~node~1#1.base|) |c_ULTIMATE.start_main_~node~1#1.offset|) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base|) |c_ULTIMATE.start_main_~node~1#1.offset|) (_ bv0 32)) (forall ((v_ArrVal_820 (_ BitVec 32)) (v_ArrVal_825 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_818 (_ BitVec 32)) (v_ArrVal_823 (_ BitVec 1)) (|v_ULTIMATE.start_main_~node~1#1.base_22| (_ BitVec 32)) (|v_ULTIMATE.start_main_~item~0#1.base_25| (_ BitVec 32))) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~node~1#1.base_22| v_ArrVal_823) |v_ULTIMATE.start_main_~item~0#1.base_25|) (_ bv0 1))) (not (= (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv4 32)))) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~node~1#1.base|) .cse1 v_ArrVal_818)) |v_ULTIMATE.start_main_~node~1#1.base_22| v_ArrVal_825))) (store .cse0 |v_ULTIMATE.start_main_~item~0#1.base_25| (store (store (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_25|) (_ bv0 32) |v_ULTIMATE.start_main_~node~1#1.base_22|) (_ bv4 32) |c_ULTIMATE.start_main_~item~0#1.base|))) |c_ULTIMATE.start_main_~item~0#1.base|) .cse1)) (_ bv0 32))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~node~1#1.base_22|)))) (and (forall ((v_ArrVal_827 (_ BitVec 32)) (v_ArrVal_824 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv4 32)))) (let ((.cse2 (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~node~1#1.offset|) .cse4 v_ArrVal_820)) |v_ULTIMATE.start_main_~node~1#1.base_22| v_ArrVal_824))) (store .cse5 |v_ULTIMATE.start_main_~item~0#1.base_25| (store (store (select .cse5 |v_ULTIMATE.start_main_~item~0#1.base_25|) (_ bv0 32) v_ArrVal_827) (_ bv4 32) |c_ULTIMATE.start_main_~item~0#1.offset|))))) (select (select .cse2 (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~node~1#1.base|) .cse4 v_ArrVal_818)) |v_ULTIMATE.start_main_~node~1#1.base_22| v_ArrVal_825))) (store .cse3 |v_ULTIMATE.start_main_~item~0#1.base_25| (store (store (select .cse3 |v_ULTIMATE.start_main_~item~0#1.base_25|) (_ bv0 32) |v_ULTIMATE.start_main_~node~1#1.base_22|) (_ bv4 32) |c_ULTIMATE.start_main_~item~0#1.base|))) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))))) (forall ((v_ArrVal_827 (_ BitVec 32)) (v_ArrVal_824 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse8 (bvadd |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv4 32)))) (select (let ((.cse6 (let ((.cse7 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~node~1#1.base|) .cse8 v_ArrVal_818)) |v_ULTIMATE.start_main_~node~1#1.base_22| v_ArrVal_825))) (store .cse7 |v_ULTIMATE.start_main_~item~0#1.base_25| (store (store (select .cse7 |v_ULTIMATE.start_main_~item~0#1.base_25|) (_ bv0 32) |v_ULTIMATE.start_main_~node~1#1.base_22|) (_ bv4 32) |c_ULTIMATE.start_main_~item~0#1.base|))))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (select (select (let ((.cse9 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~node~1#1.offset|) .cse8 v_ArrVal_820)) |v_ULTIMATE.start_main_~node~1#1.base_22| v_ArrVal_824))) (store .cse9 |v_ULTIMATE.start_main_~item~0#1.base_25| (store (store (select .cse9 |v_ULTIMATE.start_main_~item~0#1.base_25|) (_ bv0 32) v_ArrVal_827) (_ bv4 32) |c_ULTIMATE.start_main_~item~0#1.offset|))) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (_ bv0 32)))))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_main_~node~1#1.base|))) (= (select |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1)) (not (= (_ bv0 32) |c_ULTIMATE.start_main_~item~0#1.base|))) is different from false [2022-07-21 02:00:03,189 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)))) (and (= |c_ULTIMATE.start_main_~node~1#1.offset| (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~node~1#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse0 |c_ULTIMATE.start_main_~item~0#1.base|)) (= |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~node~1#1.base|) |c_ULTIMATE.start_main_~node~1#1.offset|) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base|) |c_ULTIMATE.start_main_~node~1#1.offset|) (_ bv0 32)) (forall ((v_ArrVal_820 (_ BitVec 32)) (v_ArrVal_825 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_818 (_ BitVec 32)) (v_ArrVal_823 (_ BitVec 1)) (|v_ULTIMATE.start_main_~node~1#1.base_22| (_ BitVec 32)) (|v_ULTIMATE.start_main_~item~0#1.base_25| (_ BitVec 32))) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~node~1#1.base_22| v_ArrVal_823) |v_ULTIMATE.start_main_~item~0#1.base_25|) (_ bv0 1))) (not (= (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv4 32)))) (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~node~1#1.base|) .cse2 v_ArrVal_818)) |v_ULTIMATE.start_main_~node~1#1.base_22| v_ArrVal_825))) (store .cse1 |v_ULTIMATE.start_main_~item~0#1.base_25| (store (store (select .cse1 |v_ULTIMATE.start_main_~item~0#1.base_25|) (_ bv0 32) |v_ULTIMATE.start_main_~node~1#1.base_22|) (_ bv4 32) |c_ULTIMATE.start_main_~item~0#1.base|))) |c_ULTIMATE.start_main_~item~0#1.base|) .cse2)) (_ bv0 32))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~node~1#1.base_22|)))) (and (forall ((v_ArrVal_827 (_ BitVec 32)) (v_ArrVal_824 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (let ((.cse5 (bvadd |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv4 32)))) (let ((.cse3 (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~node~1#1.offset|) .cse5 v_ArrVal_820)) |v_ULTIMATE.start_main_~node~1#1.base_22| v_ArrVal_824))) (store .cse6 |v_ULTIMATE.start_main_~item~0#1.base_25| (store (store (select .cse6 |v_ULTIMATE.start_main_~item~0#1.base_25|) (_ bv0 32) v_ArrVal_827) (_ bv4 32) |c_ULTIMATE.start_main_~item~0#1.offset|))))) (select (select .cse3 (select (select (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~node~1#1.base|) .cse5 v_ArrVal_818)) |v_ULTIMATE.start_main_~node~1#1.base_22| v_ArrVal_825))) (store .cse4 |v_ULTIMATE.start_main_~item~0#1.base_25| (store (store (select .cse4 |v_ULTIMATE.start_main_~item~0#1.base_25|) (_ bv0 32) |v_ULTIMATE.start_main_~node~1#1.base_22|) (_ bv4 32) |c_ULTIMATE.start_main_~item~0#1.base|))) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (select (select .cse3 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))))) (forall ((v_ArrVal_827 (_ BitVec 32)) (v_ArrVal_824 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse9 (bvadd |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv4 32)))) (select (let ((.cse7 (let ((.cse8 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~node~1#1.base|) .cse9 v_ArrVal_818)) |v_ULTIMATE.start_main_~node~1#1.base_22| v_ArrVal_825))) (store .cse8 |v_ULTIMATE.start_main_~item~0#1.base_25| (store (store (select .cse8 |v_ULTIMATE.start_main_~item~0#1.base_25|) (_ bv0 32) |v_ULTIMATE.start_main_~node~1#1.base_22|) (_ bv4 32) |c_ULTIMATE.start_main_~item~0#1.base|))))) (select .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (select (select (let ((.cse10 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~node~1#1.offset|) .cse9 v_ArrVal_820)) |v_ULTIMATE.start_main_~node~1#1.base_22| v_ArrVal_824))) (store .cse10 |v_ULTIMATE.start_main_~item~0#1.base_25| (store (store (select .cse10 |v_ULTIMATE.start_main_~item~0#1.base_25|) (_ bv0 32) v_ArrVal_827) (_ bv4 32) |c_ULTIMATE.start_main_~item~0#1.offset|))) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (_ bv0 32)))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~data~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select |c_#memory_$Pointer$.base| .cse0) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_main_~node~1#1.base|))) (= |c_ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (bvadd (_ bv1 1) (select |c_#valid| .cse0)) (_ bv0 1)) (not (= |c_ULTIMATE.start_main_~data~0#1.base| |c_ULTIMATE.start_main_~node~1#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| .cse0) (_ bv0 32)) (_ bv0 32)) (= (select |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1)) (not (= |c_ULTIMATE.start_main_~data~0#1.base| (_ bv0 32))) (= (bvneg (select |c_#valid| |c_ULTIMATE.start_main_~data~0#1.base|)) (_ bv1 1)) (not (= .cse0 |c_ULTIMATE.start_main_~node~1#1.base|)) (not (= (_ bv0 32) |c_ULTIMATE.start_main_~item~0#1.base|)))) is different from false [2022-07-21 02:00:03,330 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)))) (and (= |c_ULTIMATE.start_main_~node~1#1.offset| (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~node~1#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (not (= .cse0 |c_ULTIMATE.start_main_~item~0#1.base|)) (= |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~node~1#1.base|) |c_ULTIMATE.start_main_~node~1#1.offset|) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base|) |c_ULTIMATE.start_main_~node~1#1.offset|) (_ bv0 32)) (forall ((v_ArrVal_820 (_ BitVec 32)) (v_ArrVal_825 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_818 (_ BitVec 32)) (v_ArrVal_823 (_ BitVec 1)) (|v_ULTIMATE.start_main_~node~1#1.base_22| (_ BitVec 32)) (|v_ULTIMATE.start_main_~item~0#1.base_25| (_ BitVec 32))) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~node~1#1.base_22| v_ArrVal_823) |v_ULTIMATE.start_main_~item~0#1.base_25|) (_ bv0 1))) (not (= (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv4 32)))) (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~node~1#1.base|) .cse2 v_ArrVal_818)) |v_ULTIMATE.start_main_~node~1#1.base_22| v_ArrVal_825))) (store .cse1 |v_ULTIMATE.start_main_~item~0#1.base_25| (store (store (select .cse1 |v_ULTIMATE.start_main_~item~0#1.base_25|) (_ bv0 32) |v_ULTIMATE.start_main_~node~1#1.base_22|) (_ bv4 32) |c_ULTIMATE.start_main_~item~0#1.base|))) |c_ULTIMATE.start_main_~item~0#1.base|) .cse2)) (_ bv0 32))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~node~1#1.base_22|)))) (and (forall ((v_ArrVal_827 (_ BitVec 32)) (v_ArrVal_824 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (let ((.cse5 (bvadd |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv4 32)))) (let ((.cse3 (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~node~1#1.offset|) .cse5 v_ArrVal_820)) |v_ULTIMATE.start_main_~node~1#1.base_22| v_ArrVal_824))) (store .cse6 |v_ULTIMATE.start_main_~item~0#1.base_25| (store (store (select .cse6 |v_ULTIMATE.start_main_~item~0#1.base_25|) (_ bv0 32) v_ArrVal_827) (_ bv4 32) |c_ULTIMATE.start_main_~item~0#1.offset|))))) (select (select .cse3 (select (select (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~node~1#1.base|) .cse5 v_ArrVal_818)) |v_ULTIMATE.start_main_~node~1#1.base_22| v_ArrVal_825))) (store .cse4 |v_ULTIMATE.start_main_~item~0#1.base_25| (store (store (select .cse4 |v_ULTIMATE.start_main_~item~0#1.base_25|) (_ bv0 32) |v_ULTIMATE.start_main_~node~1#1.base_22|) (_ bv4 32) |c_ULTIMATE.start_main_~item~0#1.base|))) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (select (select .cse3 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))))) (forall ((v_ArrVal_827 (_ BitVec 32)) (v_ArrVal_824 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse9 (bvadd |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv4 32)))) (select (let ((.cse7 (let ((.cse8 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~node~1#1.base|) .cse9 v_ArrVal_818)) |v_ULTIMATE.start_main_~node~1#1.base_22| v_ArrVal_825))) (store .cse8 |v_ULTIMATE.start_main_~item~0#1.base_25| (store (store (select .cse8 |v_ULTIMATE.start_main_~item~0#1.base_25|) (_ bv0 32) |v_ULTIMATE.start_main_~node~1#1.base_22|) (_ bv4 32) |c_ULTIMATE.start_main_~item~0#1.base|))))) (select .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (select (select (let ((.cse10 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~node~1#1.offset|) .cse9 v_ArrVal_820)) |v_ULTIMATE.start_main_~node~1#1.base_22| v_ArrVal_824))) (store .cse10 |v_ULTIMATE.start_main_~item~0#1.base_25| (store (store (select .cse10 |v_ULTIMATE.start_main_~item~0#1.base_25|) (_ bv0 32) v_ArrVal_827) (_ bv4 32) |c_ULTIMATE.start_main_~item~0#1.offset|))) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (_ bv0 32)))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~data~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select |c_#memory_$Pointer$.base| .cse0) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_main_~node~1#1.base|))) (= |c_ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~data~0#1.base| |c_ULTIMATE.start_main_~node~1#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| .cse0) (_ bv0 32)) (_ bv0 32)) (= (select |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1)) (not (= |c_ULTIMATE.start_main_~data~0#1.base| (_ bv0 32))) (not (= .cse0 |c_ULTIMATE.start_main_~node~1#1.base|)) (not (= (_ bv0 32) |c_ULTIMATE.start_main_~item~0#1.base|)))) is different from false [2022-07-21 02:00:04,120 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse10 (select .cse15 (_ bv4 32)))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~data~0#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$.base| .cse10) (_ bv0 32))) (.cse1 (select .cse15 (_ bv0 32)))) (and (= (select .cse0 (_ bv4 32)) (_ bv0 32)) (= |c_ULTIMATE.start_main_~node~1#1.offset| (_ bv0 32)) (not (= .cse1 .cse2)) (= (select (select |c_#memory_$Pointer$.base| .cse2) (_ bv0 32)) (_ bv0 32)) (forall ((v_ArrVal_824 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_825 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~item~0#1.base_25| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_25|) (_ bv0 1))) (and (forall ((v_ArrVal_827 (_ BitVec 32))) (= (_ bv0 32) (let ((.cse3 (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_824))) (store .cse5 |v_ULTIMATE.start_main_~item~0#1.base_25| (store (store (select .cse5 |v_ULTIMATE.start_main_~item~0#1.base_25|) (_ bv0 32) v_ArrVal_827) (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.offset|))))) (select (select .cse3 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_825))) (store .cse4 |v_ULTIMATE.start_main_~item~0#1.base_25| (store (store (select .cse4 |v_ULTIMATE.start_main_~item~0#1.base_25|) (_ bv0 32) |c_ULTIMATE.start_main_~node~1#1.base|) (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|)) (select (select .cse3 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|))))) (forall ((v_ArrVal_827 (_ BitVec 32))) (= (select (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_825))) (store .cse7 |v_ULTIMATE.start_main_~item~0#1.base_25| (store (store (select .cse7 |v_ULTIMATE.start_main_~item~0#1.base_25|) (_ bv0 32) |c_ULTIMATE.start_main_~node~1#1.base|) (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.base|))))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|))) (select (select (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_824))) (store .cse8 |v_ULTIMATE.start_main_~item~0#1.base_25| (store (store (select .cse8 |v_ULTIMATE.start_main_~item~0#1.base_25|) (_ bv0 32) v_ArrVal_827) (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|)) (_ bv0 32)))) (not (= (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_825))) (store .cse9 |v_ULTIMATE.start_main_~item~0#1.base_25| (store (store (select .cse9 |v_ULTIMATE.start_main_~item~0#1.base_25|) (_ bv0 32) |c_ULTIMATE.start_main_~node~1#1.base|) (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.offset|)) (_ bv0 32))))) (= (select .cse0 (_ bv0 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| .cse1) (_ bv0 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| .cse10) (_ bv0 32)) (_ bv0 32)) (not (= .cse1 .cse10)) (= |c_ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_main_~node~1#1.base|)) (= (bvadd (_ bv1 1) (select |c_#valid| .cse1)) (_ bv0 1)) (not (= |c_ULTIMATE.start_main_~data~0#1.base| |c_ULTIMATE.start_main_~node~1#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) (_ bv0 32)) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~data~0#1.base| .cse2)) (not (= |c_ULTIMATE.start_main_~data~0#1.base| (_ bv0 32))) (not (= .cse10 (_ bv0 32))) (= (bvneg (select |c_#valid| |c_ULTIMATE.start_main_~data~0#1.base|)) (_ bv1 1)) (= (select (select |c_#memory_$Pointer$.offset| .cse2) (_ bv0 32)) (_ bv0 32)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~node~1#1.base|) (bvadd |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv4 32)) |c_ULTIMATE.start_main_~data~0#1.base|)) |c_ULTIMATE.start_main_~data~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.offset|)) (_ bv0 32))) (and (forall ((v_ArrVal_827 (_ BitVec 32))) (= (let ((.cse12 (bvadd |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv4 32)))) (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~node~1#1.base|) .cse12 |c_ULTIMATE.start_main_~data~0#1.base|)))) (select .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| v_ArrVal_827) .cse12 |c_ULTIMATE.start_main_~data~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|))) (_ bv0 32))) (forall ((v_ArrVal_827 (_ BitVec 32))) (= (let ((.cse14 (bvadd |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv4 32)))) (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| v_ArrVal_827) .cse14 |c_ULTIMATE.start_main_~data~0#1.offset|)))) (select (select .cse13 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~node~1#1.base|) .cse14 |c_ULTIMATE.start_main_~data~0#1.base|)) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|)) (select (select .cse13 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|)))) (_ bv0 32))))) (not (= .cse1 |c_ULTIMATE.start_main_~node~1#1.base|)))))) is different from false [2022-07-21 02:00:08,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:00:08,129 INFO L93 Difference]: Finished difference Result 246 states and 291 transitions. [2022-07-21 02:00:08,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-21 02:00:08,129 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 23 states have internal predecessors, (82), 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-21 02:00:08,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:00:08,130 INFO L225 Difference]: With dead ends: 246 [2022-07-21 02:00:08,130 INFO L226 Difference]: Without dead ends: 243 [2022-07-21 02:00:08,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=190, Invalid=820, Unknown=10, NotChecked=462, Total=1482 [2022-07-21 02:00:08,131 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 240 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 756 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:00:08,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 1060 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 457 Invalid, 0 Unknown, 756 Unchecked, 3.1s Time] [2022-07-21 02:00:08,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-07-21 02:00:08,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 182. [2022-07-21 02:00:08,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 168 states have (on average 1.1488095238095237) internal successors, (193), 179 states have internal predecessors, (193), 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-21 02:00:08,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 207 transitions. [2022-07-21 02:00:08,146 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 207 transitions. Word has length 44 [2022-07-21 02:00:08,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:00:08,146 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 207 transitions. [2022-07-21 02:00:08,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 23 states have internal predecessors, (82), 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-21 02:00:08,147 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 207 transitions. [2022-07-21 02:00:08,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-21 02:00:08,147 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:00:08,147 INFO L195 NwaCegarLoop]: trace histogram [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-21 02:00:08,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-21 02:00:08,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:00:08,348 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:00:08,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:00:08,348 INFO L85 PathProgramCache]: Analyzing trace with hash 795082204, now seen corresponding path program 1 times [2022-07-21 02:00:08,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:00:08,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1990821132] [2022-07-21 02:00:08,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:00:08,348 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:00:08,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:00:08,349 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 02:00:08,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-21 02:00:08,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:08,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-21 02:00:08,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:00:08,519 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-21 02:00:08,539 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 14 treesize of output 15 [2022-07-21 02:00:08,545 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 14 treesize of output 15 [2022-07-21 02:00:08,565 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 02:00:08,565 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 12 treesize of output 12 [2022-07-21 02:00:08,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 02:00:08,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 02:00:08,658 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-21 02:00:08,658 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 22 treesize of output 29 [2022-07-21 02:00:08,672 INFO L356 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-07-21 02:00:08,672 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 26 treesize of output 29 [2022-07-21 02:00:09,502 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:00:09,535 INFO L356 Elim1Store]: treesize reduction 155, result has 6.1 percent of original size [2022-07-21 02:00:09,535 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 130 treesize of output 73 [2022-07-21 02:00:09,553 INFO L356 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2022-07-21 02:00:09,553 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 34 treesize of output 25 [2022-07-21 02:00:09,576 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:00:09,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:00:12,622 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_891 (_ BitVec 32)) (|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (let ((.cse7 (bvadd |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv4 32)))) (let ((.cse3 (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|) .cse7 |c_ULTIMATE.start_main_~data~0#1.base|))) (.cse4 (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| v_ArrVal_891) .cse7 |c_ULTIMATE.start_main_~data~0#1.offset|)))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_main_~data~0#1.base|)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~data~0#1.base|))) (or (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.offset|))) (and (= (select .cse0 .cse1) (_ bv0 32)) (= (select .cse2 .cse1) (_ bv0 32)))) (not (= (select (select .cse3 |c_ULTIMATE.start_main_~node~1#1.base|) v_ArrVal_891) (_ bv0 32))) (not (= (select (select .cse4 |c_ULTIMATE.start_main_~node~1#1.base|) v_ArrVal_891) (_ bv0 32))) (let ((.cse5 (select .cse2 |c_ULTIMATE.start_main_~data~0#1.offset|)) (.cse6 (select .cse0 |c_ULTIMATE.start_main_~data~0#1.offset|))) (and (= (select (select .cse3 .cse5) .cse6) (_ bv0 32)) (= (select (select .cse4 .cse5) .cse6) (_ bv0 32))))))))) is different from false [2022-07-21 02:00:14,247 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_891 (_ BitVec 32)) (v_ArrVal_887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_888 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (let ((.cse3 (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_888))) (store .cse8 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse8 |ULTIMATE.start_main_~item~0#1.base|) (_ bv0 32) v_ArrVal_891) (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.offset|)))) (.cse0 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_887))) (store .cse7 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse7 |ULTIMATE.start_main_~item~0#1.base|) (_ bv0 32) |c_ULTIMATE.start_main_~node~1#1.base|) (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse5 (select .cse0 |c_ULTIMATE.start_main_~data~0#1.base|)) (.cse4 (select .cse3 |c_ULTIMATE.start_main_~data~0#1.base|))) (or (let ((.cse1 (select .cse5 |c_ULTIMATE.start_main_~data~0#1.offset|)) (.cse2 (select .cse4 |c_ULTIMATE.start_main_~data~0#1.offset|))) (and (= (select (select .cse0 .cse1) .cse2) (_ bv0 32)) (= (_ bv0 32) (select (select .cse3 .cse1) .cse2)))) (not (= (select (select .cse0 |c_ULTIMATE.start_main_~node~1#1.base|) v_ArrVal_891) (_ bv0 32))) (not (= (select (select .cse3 |c_ULTIMATE.start_main_~node~1#1.base|) v_ArrVal_891) (_ bv0 32))) (let ((.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.offset|))) (and (= (select .cse5 .cse6) (_ bv0 32)) (= (_ bv0 32) (select .cse4 .cse6)))))))) is different from false [2022-07-21 02:00:22,343 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~node~1#1.base_24| (_ BitVec 32))) (or (not (= (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~node~1#1.base_24|)) (_ bv0 1))) (forall ((v_ArrVal_891 (_ BitVec 32)) (v_ArrVal_887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_888 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (let ((.cse0 (let ((.cse8 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~1#1.base_24| v_ArrVal_887))) (store .cse8 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse8 |ULTIMATE.start_main_~item~0#1.base|) (_ bv0 32) |v_ULTIMATE.start_main_~node~1#1.base_24|) (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.base|)))) (.cse4 (let ((.cse7 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~node~1#1.base_24| v_ArrVal_888))) (store .cse7 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse7 |ULTIMATE.start_main_~item~0#1.base|) (_ bv0 32) v_ArrVal_891) (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.offset|))))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_main_~data~0#1.base|)) (.cse3 (select .cse0 |c_ULTIMATE.start_main_~data~0#1.base|))) (or (not (= (select (select .cse0 |v_ULTIMATE.start_main_~node~1#1.base_24|) v_ArrVal_891) (_ bv0 32))) (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~data~0#1.offset|))) (and (= (select .cse1 .cse2) (_ bv0 32)) (= (select .cse3 .cse2) (_ bv0 32)))) (not (= (_ bv0 32) (select (select .cse4 |v_ULTIMATE.start_main_~node~1#1.base_24|) v_ArrVal_891))) (let ((.cse5 (select .cse3 |c_ULTIMATE.start_main_~data~0#1.offset|)) (.cse6 (select .cse1 |c_ULTIMATE.start_main_~data~0#1.offset|))) (and (= (select (select .cse0 .cse5) .cse6) (_ bv0 32)) (= (select (select .cse4 .cse5) .cse6) (_ bv0 32)))))))))) is different from false [2022-07-21 02:00:22,364 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:00:22,413 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:00:22,414 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-21 02:00:22,422 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:00:22,456 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:00:22,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, 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-21 02:00:22,580 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:00:22,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 6285 treesize of output 5795 [2022-07-21 02:00:23,649 INFO L356 Elim1Store]: treesize reduction 58, result has 66.1 percent of original size [2022-07-21 02:00:23,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 60661 treesize of output 56397 [2022-07-21 02:00:24,157 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:00:25,291 INFO L356 Elim1Store]: treesize reduction 86, result has 70.4 percent of original size [2022-07-21 02:00:25,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 149287 treesize of output 140729 [2022-07-21 02:00:33,199 WARN L233 SmtUtils]: Spent 7.90s on a formula simplification. DAG size of input: 1214 DAG size of output: 1200 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 02:00:33,413 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:00:33,911 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:00:33,912 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 161579 treesize of output 158825 [2022-07-21 02:00:40,185 WARN L233 SmtUtils]: Spent 6.27s on a formula simplification. DAG size of input: 1419 DAG size of output: 1386 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 02:00:41,173 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:00:41,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1990821132] [2022-07-21 02:00:41,173 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-21 02:00:41,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-21 02:00:41,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 02:00:41,374 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:545) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:528) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:348) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-21 02:00:41,377 INFO L158 Benchmark]: Toolchain (without parser) took 97049.16ms. Allocated memory was 62.9MB in the beginning and 478.2MB in the end (delta: 415.2MB). Free memory was 42.6MB in the beginning and 273.8MB in the end (delta: -231.2MB). Peak memory consumption was 290.1MB. Max. memory is 16.1GB. [2022-07-21 02:00:41,378 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 62.9MB. Free memory is still 45.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 02:00:41,378 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.16ms. Allocated memory is still 62.9MB. Free memory was 42.4MB in the beginning and 37.3MB in the end (delta: 5.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-21 02:00:41,380 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.34ms. Allocated memory is still 62.9MB. Free memory was 37.2MB in the beginning and 34.5MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-21 02:00:41,381 INFO L158 Benchmark]: Boogie Preprocessor took 55.91ms. Allocated memory is still 62.9MB. Free memory was 34.5MB in the beginning and 31.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 02:00:41,381 INFO L158 Benchmark]: RCFGBuilder took 690.43ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 31.6MB in the beginning and 37.9MB in the end (delta: -6.3MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2022-07-21 02:00:41,381 INFO L158 Benchmark]: TraceAbstraction took 95937.57ms. Allocated memory was 77.6MB in the beginning and 478.2MB in the end (delta: 400.6MB). Free memory was 37.6MB in the beginning and 273.8MB in the end (delta: -236.2MB). Peak memory consumption was 269.5MB. Max. memory is 16.1GB. [2022-07-21 02:00:41,386 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 62.9MB. Free memory is still 45.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 314.16ms. Allocated memory is still 62.9MB. Free memory was 42.4MB in the beginning and 37.3MB in the end (delta: 5.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.34ms. Allocated memory is still 62.9MB. Free memory was 37.2MB in the beginning and 34.5MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.91ms. Allocated memory is still 62.9MB. Free memory was 34.5MB in the beginning and 31.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 690.43ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 31.6MB in the beginning and 37.9MB in the end (delta: -6.3MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. * TraceAbstraction took 95937.57ms. Allocated memory was 77.6MB in the beginning and 478.2MB in the end (delta: 400.6MB). Free memory was 37.6MB in the beginning and 273.8MB in the end (delta: -236.2MB). Peak memory consumption was 269.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-21 02:00:41,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range