./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-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/bubble_sort_linux-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 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 01:58:21,783 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 01:58:21,785 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 01:58:21,825 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 01:58:21,825 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 01:58:21,827 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 01:58:21,830 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 01:58:21,832 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 01:58:21,834 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 01:58:21,837 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 01:58:21,838 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 01:58:21,840 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 01:58:21,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 01:58:21,842 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 01:58:21,843 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 01:58:21,847 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 01:58:21,848 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 01:58:21,849 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 01:58:21,851 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 01:58:21,855 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 01:58:21,856 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 01:58:21,857 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 01:58:21,859 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 01:58:21,859 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 01:58:21,860 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 01:58:21,866 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 01:58:21,866 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 01:58:21,867 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 01:58:21,867 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 01:58:21,868 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 01:58:21,868 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 01:58:21,869 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 01:58:21,870 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 01:58:21,871 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 01:58:21,872 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 01:58:21,873 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 01:58:21,873 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 01:58:21,874 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 01:58:21,874 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 01:58:21,874 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 01:58:21,875 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 01:58:21,876 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 01:58:21,880 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:21,907 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 01:58:21,908 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 01:58:21,908 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 01:58:21,908 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 01:58:21,909 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 01:58:21,909 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 01:58:21,910 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 01:58:21,910 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 01:58:21,910 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 01:58:21,911 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 01:58:21,911 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 01:58:21,911 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 01:58:21,912 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 01:58:21,912 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 01:58:21,912 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 01:58:21,912 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 01:58:21,912 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 01:58:21,913 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 01:58:21,913 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 01:58:21,913 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 01:58:21,913 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 01:58:21,913 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 01:58:21,914 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 01:58:21,914 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 01:58:21,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:58:21,914 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 01:58:21,914 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 01:58:21,914 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 01:58:21,915 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 01:58:21,915 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 01:58:21,915 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 01:58:21,915 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 01:58:21,916 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 01:58:21,916 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 -> 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 [2022-07-21 01:58:22,331 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 01:58:22,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 01:58:22,375 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 01:58:22,383 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 01:58:22,383 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 01:58:22,384 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2022-07-21 01:58:22,517 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d191c4b2/452d2e4e1fc940ba813435cac2339541/FLAGfcad30422 [2022-07-21 01:58:22,957 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 01:58:22,960 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2022-07-21 01:58:22,978 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d191c4b2/452d2e4e1fc940ba813435cac2339541/FLAGfcad30422 [2022-07-21 01:58:23,298 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d191c4b2/452d2e4e1fc940ba813435cac2339541 [2022-07-21 01:58:23,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 01:58:23,302 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 01:58:23,310 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 01:58:23,310 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 01:58:23,313 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 01:58:23,314 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:58:23" (1/1) ... [2022-07-21 01:58:23,315 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@724726b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:23, skipping insertion in model container [2022-07-21 01:58:23,315 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:58:23" (1/1) ... [2022-07-21 01:58:23,320 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 01:58:23,361 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 01:58:23,714 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/bubble_sort_linux-2.i[33822,33835] [2022-07-21 01:58:23,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:58:23,772 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 01:58:23,808 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/bubble_sort_linux-2.i[33822,33835] [2022-07-21 01:58:23,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:58:23,869 INFO L208 MainTranslator]: Completed translation [2022-07-21 01:58:23,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:23 WrapperNode [2022-07-21 01:58:23,870 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 01:58:23,871 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 01:58:23,871 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 01:58:23,871 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 01:58:23,875 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:23" (1/1) ... [2022-07-21 01:58:23,893 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:23" (1/1) ... [2022-07-21 01:58:23,926 INFO L137 Inliner]: procedures = 232, calls = 75, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 116 [2022-07-21 01:58:23,926 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 01:58:23,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 01:58:23,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 01:58:23,928 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 01:58:23,933 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:23" (1/1) ... [2022-07-21 01:58:23,933 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:23" (1/1) ... [2022-07-21 01:58:23,948 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:23" (1/1) ... [2022-07-21 01:58:23,954 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:23" (1/1) ... [2022-07-21 01:58:23,961 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:23" (1/1) ... [2022-07-21 01:58:23,975 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:23" (1/1) ... [2022-07-21 01:58:23,978 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:23" (1/1) ... [2022-07-21 01:58:23,984 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 01:58:23,987 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 01:58:23,987 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 01:58:23,987 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 01:58:23,988 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:23" (1/1) ... [2022-07-21 01:58:23,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:58:24,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:58:24,011 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:24,030 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:24,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 01:58:24,042 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2022-07-21 01:58:24,042 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2022-07-21 01:58:24,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 01:58:24,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 01:58:24,042 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2022-07-21 01:58:24,042 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2022-07-21 01:58:24,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 01:58:24,043 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2022-07-21 01:58:24,043 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2022-07-21 01:58:24,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 01:58:24,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 01:58:24,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 01:58:24,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 01:58:24,043 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2022-07-21 01:58:24,043 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2022-07-21 01:58:24,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 01:58:24,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 01:58:24,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 01:58:24,183 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 01:58:24,187 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 01:58:24,458 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 01:58:24,463 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 01:58:24,464 INFO L299 CfgBuilder]: Removed 41 assume(true) statements. [2022-07-21 01:58:24,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:58:24 BoogieIcfgContainer [2022-07-21 01:58:24,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 01:58:24,466 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 01:58:24,466 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 01:58:24,468 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 01:58:24,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 01:58:23" (1/3) ... [2022-07-21 01:58:24,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a23dbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:58:24, skipping insertion in model container [2022-07-21 01:58:24,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:23" (2/3) ... [2022-07-21 01:58:24,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a23dbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:58:24, skipping insertion in model container [2022-07-21 01:58:24,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:58:24" (3/3) ... [2022-07-21 01:58:24,470 INFO L111 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-2.i [2022-07-21 01:58:24,480 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 01:58:24,481 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 01:58:24,514 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 01:58:24,518 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@30e5902e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@8012e2b [2022-07-21 01:58:24,519 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 01:58:24,522 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 89 states have (on average 1.7415730337078652) internal successors, (155), 108 states have internal predecessors, (155), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-07-21 01:58:24,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-21 01:58:24,527 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:24,527 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:58:24,527 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:24,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:24,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1761516263, now seen corresponding path program 1 times [2022-07-21 01:58:24,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:24,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22916950] [2022-07-21 01:58:24,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:24,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:24,639 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:24,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:24,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22916950] [2022-07-21 01:58:24,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22916950] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:58:24,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:58:24,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 01:58:24,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951606335] [2022-07-21 01:58:24,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:58:24,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 01:58:24,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:24,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 01:58:24,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 01:58:24,674 INFO L87 Difference]: Start difference. First operand has 118 states, 89 states have (on average 1.7415730337078652) internal successors, (155), 108 states have internal predecessors, (155), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:58:24,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:24,742 INFO L93 Difference]: Finished difference Result 230 states and 397 transitions. [2022-07-21 01:58:24,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 01:58:24,744 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-21 01:58:24,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:24,752 INFO L225 Difference]: With dead ends: 230 [2022-07-21 01:58:24,752 INFO L226 Difference]: Without dead ends: 107 [2022-07-21 01:58:24,759 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:24,762 INFO L413 NwaCegarLoop]: 136 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, 136 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:24,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 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:24,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-21 01:58:24,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-07-21 01:58:24,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 97 states have internal predecessors, (102), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-21 01:58:24,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 128 transitions. [2022-07-21 01:58:24,809 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 128 transitions. Word has length 9 [2022-07-21 01:58:24,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:24,809 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 128 transitions. [2022-07-21 01:58:24,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:58:24,810 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 128 transitions. [2022-07-21 01:58:24,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-21 01:58:24,812 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:24,812 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] [2022-07-21 01:58:24,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 01:58:24,813 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:24,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:24,813 INFO L85 PathProgramCache]: Analyzing trace with hash 849043181, now seen corresponding path program 1 times [2022-07-21 01:58:24,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:24,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176436079] [2022-07-21 01:58:24,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:24,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:25,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 01:58:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:25,044 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:25,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:25,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176436079] [2022-07-21 01:58:25,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176436079] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:58:25,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:58:25,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 01:58:25,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328311520] [2022-07-21 01:58:25,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:58:25,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 01:58:25,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:25,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 01:58:25,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 01:58:25,047 INFO L87 Difference]: Start difference. First operand 107 states and 128 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 01:58:25,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:25,292 INFO L93 Difference]: Finished difference Result 109 states and 129 transitions. [2022-07-21 01:58:25,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 01:58:25,293 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-07-21 01:58:25,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:25,299 INFO L225 Difference]: With dead ends: 109 [2022-07-21 01:58:25,300 INFO L226 Difference]: Without dead ends: 106 [2022-07-21 01:58:25,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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:25,305 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 238 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 01:58:25,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 196 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 01:58:25,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-21 01:58:25,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-07-21 01:58:25,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 82 states have (on average 1.2317073170731707) internal successors, (101), 96 states have internal predecessors, (101), 20 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-21 01:58:25,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 126 transitions. [2022-07-21 01:58:25,325 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 126 transitions. Word has length 21 [2022-07-21 01:58:25,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:25,327 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 126 transitions. [2022-07-21 01:58:25,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 01:58:25,327 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 126 transitions. [2022-07-21 01:58:25,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 01:58:25,328 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:25,328 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] [2022-07-21 01:58:25,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 01:58:25,328 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:25,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:25,329 INFO L85 PathProgramCache]: Analyzing trace with hash 502050183, now seen corresponding path program 1 times [2022-07-21 01:58:25,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:25,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094034923] [2022-07-21 01:58:25,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:25,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:25,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:25,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 01:58:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:25,576 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:25,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:25,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094034923] [2022-07-21 01:58:25,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094034923] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:58:25,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:58:25,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 01:58:25,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909500077] [2022-07-21 01:58:25,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:58:25,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 01:58:25,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:25,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 01:58:25,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-21 01:58:25,579 INFO L87 Difference]: Start difference. First operand 106 states and 126 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 01:58:26,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:26,408 INFO L93 Difference]: Finished difference Result 198 states and 235 transitions. [2022-07-21 01:58:26,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 01:58:26,409 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-07-21 01:58:26,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:26,411 INFO L225 Difference]: With dead ends: 198 [2022-07-21 01:58:26,411 INFO L226 Difference]: Without dead ends: 192 [2022-07-21 01:58:26,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2022-07-21 01:58:26,412 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 518 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 01:58:26,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 221 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-21 01:58:26,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-07-21 01:58:26,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 172. [2022-07-21 01:58:26,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 144 states have (on average 1.2430555555555556) internal successors, (179), 158 states have internal predecessors, (179), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-21 01:58:26,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 209 transitions. [2022-07-21 01:58:26,430 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 209 transitions. Word has length 24 [2022-07-21 01:58:26,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:26,431 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 209 transitions. [2022-07-21 01:58:26,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 01:58:26,431 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 209 transitions. [2022-07-21 01:58:26,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-21 01:58:26,448 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:26,448 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] [2022-07-21 01:58:26,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 01:58:26,448 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:26,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:26,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1234303898, now seen corresponding path program 1 times [2022-07-21 01:58:26,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:26,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625977992] [2022-07-21 01:58:26,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:26,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:26,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:26,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 01:58:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:26,727 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:26,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:26,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625977992] [2022-07-21 01:58:26,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625977992] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:58:26,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:58:26,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 01:58:26,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198306120] [2022-07-21 01:58:26,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:58:26,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 01:58:26,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:26,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 01:58:26,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-21 01:58:26,730 INFO L87 Difference]: Start difference. First operand 172 states and 209 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 01:58:27,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:27,271 INFO L93 Difference]: Finished difference Result 274 states and 329 transitions. [2022-07-21 01:58:27,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 01:58:27,272 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-07-21 01:58:27,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:27,273 INFO L225 Difference]: With dead ends: 274 [2022-07-21 01:58:27,273 INFO L226 Difference]: Without dead ends: 271 [2022-07-21 01:58:27,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-07-21 01:58:27,274 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 286 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 01:58:27,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 312 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 01:58:27,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-07-21 01:58:27,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 253. [2022-07-21 01:58:27,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.238532110091743) internal successors, (270), 233 states have internal predecessors, (270), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-21 01:58:27,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 309 transitions. [2022-07-21 01:58:27,306 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 309 transitions. Word has length 27 [2022-07-21 01:58:27,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:27,306 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 309 transitions. [2022-07-21 01:58:27,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 01:58:27,306 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 309 transitions. [2022-07-21 01:58:27,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-21 01:58:27,307 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:27,308 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] [2022-07-21 01:58:27,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 01:58:27,308 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:27,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:27,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1680148119, now seen corresponding path program 1 times [2022-07-21 01:58:27,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:27,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750353603] [2022-07-21 01:58:27,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:27,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:27,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:27,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 01:58:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:27,574 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:27,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:27,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750353603] [2022-07-21 01:58:27,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750353603] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:58:27,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:58:27,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 01:58:27,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525264570] [2022-07-21 01:58:27,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:58:27,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 01:58:27,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:27,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 01:58:27,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-21 01:58:27,580 INFO L87 Difference]: Start difference. First operand 253 states and 309 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 01:58:28,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:28,336 INFO L93 Difference]: Finished difference Result 273 states and 327 transitions. [2022-07-21 01:58:28,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 01:58:28,337 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-07-21 01:58:28,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:28,340 INFO L225 Difference]: With dead ends: 273 [2022-07-21 01:58:28,340 INFO L226 Difference]: Without dead ends: 270 [2022-07-21 01:58:28,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-07-21 01:58:28,346 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 326 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 01:58:28,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 300 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 01:58:28,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-07-21 01:58:28,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 253. [2022-07-21 01:58:28,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.2339449541284404) internal successors, (269), 233 states have internal predecessors, (269), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-21 01:58:28,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 308 transitions. [2022-07-21 01:58:28,372 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 308 transitions. Word has length 30 [2022-07-21 01:58:28,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:28,372 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 308 transitions. [2022-07-21 01:58:28,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 01:58:28,372 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 308 transitions. [2022-07-21 01:58:28,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-21 01:58:28,373 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:28,373 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] [2022-07-21 01:58:28,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 01:58:28,374 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:28,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:28,374 INFO L85 PathProgramCache]: Analyzing trace with hash -493122043, now seen corresponding path program 1 times [2022-07-21 01:58:28,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:28,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821794334] [2022-07-21 01:58:28,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:28,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:28,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:28,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 01:58:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:28,717 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:28,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:28,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821794334] [2022-07-21 01:58:28,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821794334] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:58:28,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:58:28,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-21 01:58:28,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734371755] [2022-07-21 01:58:28,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:58:28,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 01:58:28,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:28,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 01:58:28,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-21 01:58:28,721 INFO L87 Difference]: Start difference. First operand 253 states and 308 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 01:58:29,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:29,485 INFO L93 Difference]: Finished difference Result 272 states and 325 transitions. [2022-07-21 01:58:29,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 01:58:29,486 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-07-21 01:58:29,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:29,487 INFO L225 Difference]: With dead ends: 272 [2022-07-21 01:58:29,487 INFO L226 Difference]: Without dead ends: 269 [2022-07-21 01:58:29,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2022-07-21 01:58:29,488 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 321 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 01:58:29,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 325 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 01:58:29,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-07-21 01:58:29,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 253. [2022-07-21 01:58:29,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.2293577981651376) internal successors, (268), 233 states have internal predecessors, (268), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-21 01:58:29,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 307 transitions. [2022-07-21 01:58:29,500 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 307 transitions. Word has length 33 [2022-07-21 01:58:29,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:29,500 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 307 transitions. [2022-07-21 01:58:29,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 01:58:29,500 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 307 transitions. [2022-07-21 01:58:29,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-21 01:58:29,501 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:29,501 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] [2022-07-21 01:58:29,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 01:58:29,502 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:29,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:29,502 INFO L85 PathProgramCache]: Analyzing trace with hash -2033122620, now seen corresponding path program 1 times [2022-07-21 01:58:29,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:29,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601315189] [2022-07-21 01:58:29,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:29,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:29,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:29,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 01:58:29,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:29,839 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:29,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:29,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601315189] [2022-07-21 01:58:29,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601315189] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:58:29,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:58:29,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 01:58:29,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501917615] [2022-07-21 01:58:29,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:58:29,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 01:58:29,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:29,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 01:58:29,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-21 01:58:29,841 INFO L87 Difference]: Start difference. First operand 253 states and 307 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 01:58:30,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:30,718 INFO L93 Difference]: Finished difference Result 271 states and 323 transitions. [2022-07-21 01:58:30,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 01:58:30,718 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-07-21 01:58:30,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:30,719 INFO L225 Difference]: With dead ends: 271 [2022-07-21 01:58:30,719 INFO L226 Difference]: Without dead ends: 268 [2022-07-21 01:58:30,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-07-21 01:58:30,720 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 324 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 999 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 01:58:30,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 304 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 999 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-21 01:58:30,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-07-21 01:58:30,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 253. [2022-07-21 01:58:30,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.224770642201835) internal successors, (267), 233 states have internal predecessors, (267), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-21 01:58:30,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 306 transitions. [2022-07-21 01:58:30,761 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 306 transitions. Word has length 36 [2022-07-21 01:58:30,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:30,762 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 306 transitions. [2022-07-21 01:58:30,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 01:58:30,762 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 306 transitions. [2022-07-21 01:58:30,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-21 01:58:30,767 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:30,767 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] [2022-07-21 01:58:30,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 01:58:30,767 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:30,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:30,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1335339115, now seen corresponding path program 1 times [2022-07-21 01:58:30,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:30,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589623410] [2022-07-21 01:58:30,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:30,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:30,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:30,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 01:58:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:31,042 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:31,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:31,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589623410] [2022-07-21 01:58:31,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589623410] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:58:31,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:58:31,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 01:58:31,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385258320] [2022-07-21 01:58:31,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:58:31,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 01:58:31,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:31,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 01:58:31,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-21 01:58:31,043 INFO L87 Difference]: Start difference. First operand 253 states and 306 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 01:58:31,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:31,761 INFO L93 Difference]: Finished difference Result 270 states and 321 transitions. [2022-07-21 01:58:31,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-21 01:58:31,761 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-07-21 01:58:31,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:31,762 INFO L225 Difference]: With dead ends: 270 [2022-07-21 01:58:31,762 INFO L226 Difference]: Without dead ends: 267 [2022-07-21 01:58:31,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2022-07-21 01:58:31,763 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 396 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 01:58:31,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 312 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 01:58:31,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-07-21 01:58:31,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 253. [2022-07-21 01:58:31,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.2201834862385321) internal successors, (266), 233 states have internal predecessors, (266), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-21 01:58:31,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 305 transitions. [2022-07-21 01:58:31,781 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 305 transitions. Word has length 39 [2022-07-21 01:58:31,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:31,797 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 305 transitions. [2022-07-21 01:58:31,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 01:58:31,797 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 305 transitions. [2022-07-21 01:58:31,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-21 01:58:31,799 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:31,799 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2022-07-21 01:58:31,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 01:58:31,800 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:31,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:31,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1154705564, now seen corresponding path program 1 times [2022-07-21 01:58:31,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:31,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196970228] [2022-07-21 01:58:31,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:31,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:31,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:32,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 01:58:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:32,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 01:58:32,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:32,313 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 01:58:32,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:32,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196970228] [2022-07-21 01:58:32,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196970228] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 01:58:32,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340981070] [2022-07-21 01:58:32,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:32,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:58:32,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:58:32,315 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:32,317 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:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:32,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 124 conjunts are in the unsatisfiable core [2022-07-21 01:58:32,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:58:32,593 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 01:58:32,593 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:32,649 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 01:58:32,650 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-21 01:58:32,660 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 5 treesize of output 3 [2022-07-21 01:58:32,677 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 01:58:32,677 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 1 case distinctions, treesize of input 21 treesize of output 21 [2022-07-21 01:58:32,708 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:32,715 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 7 treesize of output 3 [2022-07-21 01:58:32,872 INFO L356 Elim1Store]: treesize reduction 77, result has 3.8 percent of original size [2022-07-21 01:58:32,873 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-21 01:58:32,895 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:33,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:58:33,084 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.base_BEFORE_CALL_2| input size 43 context size 43 output size 43 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:764) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:725) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:643) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:335) 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$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) 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.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) 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:58:33,088 INFO L158 Benchmark]: Toolchain (without parser) took 9785.80ms. Allocated memory was 69.2MB in the beginning and 174.1MB in the end (delta: 104.9MB). Free memory was 52.7MB in the beginning and 59.1MB in the end (delta: -6.4MB). Peak memory consumption was 98.0MB. Max. memory is 16.1GB. [2022-07-21 01:58:33,089 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 50.3MB. Free memory was 31.9MB in the beginning and 31.9MB in the end (delta: 43.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 01:58:33,089 INFO L158 Benchmark]: CACSL2BoogieTranslator took 560.54ms. Allocated memory is still 69.2MB. Free memory was 52.5MB in the beginning and 35.7MB in the end (delta: 16.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-21 01:58:33,089 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.61ms. Allocated memory is still 69.2MB. Free memory was 35.4MB in the beginning and 50.3MB in the end (delta: -14.9MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2022-07-21 01:58:33,089 INFO L158 Benchmark]: Boogie Preprocessor took 59.21ms. Allocated memory is still 69.2MB. Free memory was 50.3MB in the beginning and 47.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 01:58:33,089 INFO L158 Benchmark]: RCFGBuilder took 478.18ms. Allocated memory is still 69.2MB. Free memory was 47.7MB in the beginning and 45.6MB in the end (delta: 2.0MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2022-07-21 01:58:33,090 INFO L158 Benchmark]: TraceAbstraction took 8620.52ms. Allocated memory was 69.2MB in the beginning and 174.1MB in the end (delta: 104.9MB). Free memory was 45.3MB in the beginning and 59.1MB in the end (delta: -13.8MB). Peak memory consumption was 89.8MB. Max. memory is 16.1GB. [2022-07-21 01:58:33,091 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.22ms. Allocated memory is still 50.3MB. Free memory was 31.9MB in the beginning and 31.9MB in the end (delta: 43.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 560.54ms. Allocated memory is still 69.2MB. Free memory was 52.5MB in the beginning and 35.7MB in the end (delta: 16.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.61ms. Allocated memory is still 69.2MB. Free memory was 35.4MB in the beginning and 50.3MB in the end (delta: -14.9MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.21ms. Allocated memory is still 69.2MB. Free memory was 50.3MB in the beginning and 47.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 478.18ms. Allocated memory is still 69.2MB. Free memory was 47.7MB in the beginning and 45.6MB in the end (delta: 2.0MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. * TraceAbstraction took 8620.52ms. Allocated memory was 69.2MB in the beginning and 174.1MB in the end (delta: 104.9MB). Free memory was 45.3MB in the beginning and 59.1MB in the end (delta: -13.8MB). Peak memory consumption was 89.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_BEFORE_CALL_2| input size 43 context size 43 output size 43 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_BEFORE_CALL_2| input size 43 context size 43 output size 43: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-21 01:58:33,120 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/bubble_sort_linux-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 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 01:58:34,842 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 01:58:34,844 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 01:58:34,885 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 01:58:34,885 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 01:58:34,886 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 01:58:34,889 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 01:58:34,892 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 01:58:34,893 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 01:58:34,896 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 01:58:34,898 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 01:58:34,901 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 01:58:34,901 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 01:58:34,903 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 01:58:34,904 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 01:58:34,906 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 01:58:34,907 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 01:58:34,908 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 01:58:34,909 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 01:58:34,913 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 01:58:34,914 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 01:58:34,916 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 01:58:34,917 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 01:58:34,917 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 01:58:34,919 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 01:58:34,924 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 01:58:34,924 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 01:58:34,925 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 01:58:34,925 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 01:58:34,926 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 01:58:34,927 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 01:58:34,927 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 01:58:34,928 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 01:58:34,929 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 01:58:34,930 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 01:58:34,930 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 01:58:34,930 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 01:58:34,931 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 01:58:34,931 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 01:58:34,931 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 01:58:34,932 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 01:58:34,933 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 01:58:34,940 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:58:34,966 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 01:58:34,967 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 01:58:34,967 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 01:58:34,967 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 01:58:34,968 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 01:58:34,968 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 01:58:34,968 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 01:58:34,968 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 01:58:34,969 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 01:58:34,969 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 01:58:34,969 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 01:58:34,970 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 01:58:34,970 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 01:58:34,970 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 01:58:34,970 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 01:58:34,970 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 01:58:34,970 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 01:58:34,971 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-21 01:58:34,971 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-21 01:58:34,971 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 01:58:34,971 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 01:58:34,971 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 01:58:34,971 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 01:58:34,971 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 01:58:34,972 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 01:58:34,972 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 01:58:34,972 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:58:34,972 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 01:58:34,972 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 01:58:34,972 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 01:58:34,973 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-21 01:58:34,973 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-21 01:58:34,973 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 01:58:34,973 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 01:58:34,973 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 01:58:34,973 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-21 01:58:34,974 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 -> 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 [2022-07-21 01:58:35,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 01:58:35,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 01:58:35,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 01:58:35,260 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 01:58:35,261 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 01:58:35,262 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2022-07-21 01:58:35,302 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d40d324f/17f5f0f2d62a443ba06abc08fda342d5/FLAGc82d22050 [2022-07-21 01:58:35,753 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 01:58:35,754 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2022-07-21 01:58:35,768 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d40d324f/17f5f0f2d62a443ba06abc08fda342d5/FLAGc82d22050 [2022-07-21 01:58:36,090 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d40d324f/17f5f0f2d62a443ba06abc08fda342d5 [2022-07-21 01:58:36,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 01:58:36,093 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 01:58:36,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 01:58:36,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 01:58:36,104 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 01:58:36,104 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:58:36" (1/1) ... [2022-07-21 01:58:36,106 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@628687a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:36, skipping insertion in model container [2022-07-21 01:58:36,107 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:58:36" (1/1) ... [2022-07-21 01:58:36,112 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 01:58:36,136 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 01:58:36,366 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/bubble_sort_linux-2.i[33822,33835] [2022-07-21 01:58:36,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:58:36,413 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-21 01:58:36,423 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 01:58:36,437 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/bubble_sort_linux-2.i[33822,33835] [2022-07-21 01:58:36,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:58:36,453 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 01:58:36,494 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/bubble_sort_linux-2.i[33822,33835] [2022-07-21 01:58:36,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:58:36,562 INFO L208 MainTranslator]: Completed translation [2022-07-21 01:58:36,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:36 WrapperNode [2022-07-21 01:58:36,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 01:58:36,564 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 01:58:36,564 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 01:58:36,564 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 01:58:36,569 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:36" (1/1) ... [2022-07-21 01:58:36,588 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:36" (1/1) ... [2022-07-21 01:58:36,605 INFO L137 Inliner]: procedures = 235, calls = 75, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 113 [2022-07-21 01:58:36,606 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 01:58:36,607 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 01:58:36,607 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 01:58:36,607 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 01:58:36,613 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:36" (1/1) ... [2022-07-21 01:58:36,613 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:36" (1/1) ... [2022-07-21 01:58:36,618 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:36" (1/1) ... [2022-07-21 01:58:36,618 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:36" (1/1) ... [2022-07-21 01:58:36,636 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:36" (1/1) ... [2022-07-21 01:58:36,642 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:36" (1/1) ... [2022-07-21 01:58:36,645 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:36" (1/1) ... [2022-07-21 01:58:36,655 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 01:58:36,656 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 01:58:36,656 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 01:58:36,656 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 01:58:36,657 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:36" (1/1) ... [2022-07-21 01:58:36,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:58:36,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:58:36,688 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:36,693 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:36,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-21 01:58:36,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 01:58:36,763 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2022-07-21 01:58:36,763 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2022-07-21 01:58:36,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 01:58:36,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-21 01:58:36,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 01:58:36,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-21 01:58:36,763 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2022-07-21 01:58:36,763 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2022-07-21 01:58:36,763 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2022-07-21 01:58:36,763 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2022-07-21 01:58:36,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 01:58:36,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 01:58:36,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 01:58:36,764 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2022-07-21 01:58:36,764 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2022-07-21 01:58:36,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 01:58:36,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 01:58:36,910 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 01:58:36,912 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 01:58:37,228 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 01:58:37,232 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 01:58:37,232 INFO L299 CfgBuilder]: Removed 41 assume(true) statements. [2022-07-21 01:58:37,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:58:37 BoogieIcfgContainer [2022-07-21 01:58:37,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 01:58:37,235 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 01:58:37,235 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 01:58:37,236 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 01:58:37,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 01:58:36" (1/3) ... [2022-07-21 01:58:37,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15d8944 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:58:37, skipping insertion in model container [2022-07-21 01:58:37,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:36" (2/3) ... [2022-07-21 01:58:37,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15d8944 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:58:37, skipping insertion in model container [2022-07-21 01:58:37,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:58:37" (3/3) ... [2022-07-21 01:58:37,238 INFO L111 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-2.i [2022-07-21 01:58:37,247 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 01:58:37,247 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 01:58:37,278 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 01:58:37,282 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@3e031279, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@72ac2abe [2022-07-21 01:58:37,282 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 01:58:37,285 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 88 states have (on average 1.75) internal successors, (154), 107 states have internal predecessors, (154), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-07-21 01:58:37,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-21 01:58:37,289 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:37,290 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:58:37,290 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:37,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:37,293 INFO L85 PathProgramCache]: Analyzing trace with hash 844459879, now seen corresponding path program 1 times [2022-07-21 01:58:37,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:58:37,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1760582524] [2022-07-21 01:58:37,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:37,303 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:58:37,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:58:37,305 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:58:37,306 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:58:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:37,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-21 01:58:37,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:58:37,385 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:37,385 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:58:37,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:58:37,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1760582524] [2022-07-21 01:58:37,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1760582524] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:58:37,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:58:37,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 01:58:37,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783349664] [2022-07-21 01:58:37,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:58:37,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 01:58:37,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:58:37,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 01:58:37,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 01:58:37,409 INFO L87 Difference]: Start difference. First operand has 117 states, 88 states have (on average 1.75) internal successors, (154), 107 states have internal predecessors, (154), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:58:37,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:37,434 INFO L93 Difference]: Finished difference Result 228 states and 395 transitions. [2022-07-21 01:58:37,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 01:58:37,435 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-21 01:58:37,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:37,440 INFO L225 Difference]: With dead ends: 228 [2022-07-21 01:58:37,440 INFO L226 Difference]: Without dead ends: 106 [2022-07-21 01:58:37,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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:37,447 INFO L413 NwaCegarLoop]: 135 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, 135 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:37,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 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:37,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-21 01:58:37,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-07-21 01:58:37,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 81 states have (on average 1.2469135802469136) internal successors, (101), 96 states have internal predecessors, (101), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-21 01:58:37,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 127 transitions. [2022-07-21 01:58:37,477 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 127 transitions. Word has length 9 [2022-07-21 01:58:37,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:37,477 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 127 transitions. [2022-07-21 01:58:37,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:58:37,478 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 127 transitions. [2022-07-21 01:58:37,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-21 01:58:37,478 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:37,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, 1] [2022-07-21 01:58:37,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-21 01:58:37,686 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:58:37,687 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:37,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:37,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1622181416, now seen corresponding path program 1 times [2022-07-21 01:58:37,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:58:37,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1558737594] [2022-07-21 01:58:37,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:37,692 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:58:37,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:58:37,710 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:58:37,711 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:58:37,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:37,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 01:58:37,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:58:37,889 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:37,891 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:58:37,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:58:37,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1558737594] [2022-07-21 01:58:37,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1558737594] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:58:37,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:58:37,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 01:58:37,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325399393] [2022-07-21 01:58:37,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:58:37,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 01:58:37,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:58:37,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 01:58:37,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 01:58:37,902 INFO L87 Difference]: Start difference. First operand 106 states and 127 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 01:58:37,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:37,989 INFO L93 Difference]: Finished difference Result 108 states and 128 transitions. [2022-07-21 01:58:37,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 01:58:37,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-07-21 01:58:37,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:37,991 INFO L225 Difference]: With dead ends: 108 [2022-07-21 01:58:37,991 INFO L226 Difference]: Without dead ends: 105 [2022-07-21 01:58:37,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 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:58:37,992 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 169 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 01:58:37,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 253 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 01:58:37,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-21 01:58:37,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-07-21 01:58:37,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 81 states have (on average 1.2345679012345678) internal successors, (100), 95 states have internal predecessors, (100), 20 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-21 01:58:38,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 125 transitions. [2022-07-21 01:58:38,000 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 125 transitions. Word has length 20 [2022-07-21 01:58:38,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:38,001 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 125 transitions. [2022-07-21 01:58:38,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 01:58:38,001 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 125 transitions. [2022-07-21 01:58:38,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-21 01:58:38,002 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:38,002 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:58:38,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-21 01:58:38,210 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:58:38,211 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:38,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:38,212 INFO L85 PathProgramCache]: Analyzing trace with hash -845475890, now seen corresponding path program 1 times [2022-07-21 01:58:38,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:58:38,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1209661856] [2022-07-21 01:58:38,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:38,212 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:58:38,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:58:38,214 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:58:38,215 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:58:38,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:38,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-21 01:58:38,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:58:38,420 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 01:58:38,420 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:38,675 INFO L356 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-07-21 01:58:38,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2022-07-21 01:58:38,700 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 8 treesize of output 7 [2022-07-21 01:58:38,728 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 8 treesize of output 7 [2022-07-21 01:58:38,745 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 8 treesize of output 7 [2022-07-21 01:58:38,881 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:58:38,906 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:58:38,924 INFO L356 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-07-21 01:58:38,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 93 treesize of output 92 [2022-07-21 01:58:38,940 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 5 treesize of output 3 [2022-07-21 01:58:38,976 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 5 treesize of output 3 [2022-07-21 01:58:39,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:39,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:39,045 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:58:39,054 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:58:39,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 94 [2022-07-21 01:58:39,100 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:58:39,110 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:58:39,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 88 treesize of output 79 [2022-07-21 01:58:39,123 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 5 treesize of output 3 [2022-07-21 01:58:39,174 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:58:39,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:39,185 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:58:39,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 89 [2022-07-21 01:58:39,690 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-21 01:58:39,803 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 01:58:39,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 49 [2022-07-21 01:58:39,811 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 9 treesize of output 7 [2022-07-21 01:58:39,884 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 01:58:39,884 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 16 treesize of output 11 [2022-07-21 01:58:39,898 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:39,898 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:58:39,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:58:39,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1209661856] [2022-07-21 01:58:39,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1209661856] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:58:39,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:58:39,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 01:58:39,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443968056] [2022-07-21 01:58:39,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:58:39,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 01:58:39,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:58:39,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 01:58:39,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-21 01:58:39,900 INFO L87 Difference]: Start difference. First operand 105 states and 125 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 01:58:40,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:40,481 INFO L93 Difference]: Finished difference Result 210 states and 248 transitions. [2022-07-21 01:58:40,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 01:58:40,482 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-07-21 01:58:40,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:40,484 INFO L225 Difference]: With dead ends: 210 [2022-07-21 01:58:40,484 INFO L226 Difference]: Without dead ends: 207 [2022-07-21 01:58:40,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-07-21 01:58:40,485 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 168 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 01:58:40,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 846 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 260 Invalid, 0 Unknown, 117 Unchecked, 0.5s Time] [2022-07-21 01:58:40,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-07-21 01:58:40,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 189. [2022-07-21 01:58:40,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 157 states have (on average 1.2356687898089171) internal successors, (194), 172 states have internal predecessors, (194), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-21 01:58:40,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 228 transitions. [2022-07-21 01:58:40,504 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 228 transitions. Word has length 23 [2022-07-21 01:58:40,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:40,504 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 228 transitions. [2022-07-21 01:58:40,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 01:58:40,505 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 228 transitions. [2022-07-21 01:58:40,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-21 01:58:40,505 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:40,505 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] [2022-07-21 01:58:40,539 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:58:40,716 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:58:40,716 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:40,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:40,719 INFO L85 PathProgramCache]: Analyzing trace with hash 2145302357, now seen corresponding path program 1 times [2022-07-21 01:58:40,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:58:40,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [429382021] [2022-07-21 01:58:40,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:40,720 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:58:40,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:58:40,724 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:58:40,726 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:58:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:40,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-21 01:58:40,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:58:40,936 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 01:58:40,936 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:40,972 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 01:58:40,980 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 01:58:40,991 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 7 treesize of output 3 [2022-07-21 01:58:40,996 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 7 treesize of output 3 [2022-07-21 01:58:41,255 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 137 treesize of output 101 [2022-07-21 01:58:41,266 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-21 01:58:41,266 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 37 [2022-07-21 01:58:41,334 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 01:58:41,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 39 [2022-07-21 01:58:41,338 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 22 treesize of output 16 [2022-07-21 01:58:41,523 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 9 treesize of output 3 [2022-07-21 01:58:41,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:41,526 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-07-21 01:58:41,563 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:41,563 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:58:41,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:58:41,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [429382021] [2022-07-21 01:58:41,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [429382021] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:58:41,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:58:41,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 01:58:41,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296693992] [2022-07-21 01:58:41,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:58:41,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 01:58:41,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:58:41,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 01:58:41,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-21 01:58:41,565 INFO L87 Difference]: Start difference. First operand 189 states and 228 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 01:58:43,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:43,461 INFO L93 Difference]: Finished difference Result 209 states and 246 transitions. [2022-07-21 01:58:43,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 01:58:43,462 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-07-21 01:58:43,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:43,463 INFO L225 Difference]: With dead ends: 209 [2022-07-21 01:58:43,463 INFO L226 Difference]: Without dead ends: 206 [2022-07-21 01:58:43,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-07-21 01:58:43,466 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 216 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-21 01:58:43,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 495 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-21 01:58:43,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-07-21 01:58:43,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 189. [2022-07-21 01:58:43,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 157 states have (on average 1.2292993630573248) internal successors, (193), 172 states have internal predecessors, (193), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-21 01:58:43,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 227 transitions. [2022-07-21 01:58:43,482 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 227 transitions. Word has length 26 [2022-07-21 01:58:43,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:43,483 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 227 transitions. [2022-07-21 01:58:43,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 01:58:43,483 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 227 transitions. [2022-07-21 01:58:43,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-21 01:58:43,484 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:43,484 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] [2022-07-21 01:58:43,494 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:58:43,693 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:58:43,694 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:43,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:43,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1337820254, now seen corresponding path program 1 times [2022-07-21 01:58:43,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:58:43,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [902961523] [2022-07-21 01:58:43,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:43,695 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:58:43,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:58:43,696 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:58:43,698 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:58:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:43,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-21 01:58:43,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:58:43,886 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 01:58:43,886 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:43,930 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 01:58:43,936 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 01:58:43,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 7 treesize of output 3 [2022-07-21 01:58:43,956 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 7 treesize of output 3 [2022-07-21 01:58:52,200 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 137 treesize of output 101 [2022-07-21 01:58:52,211 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-21 01:58:52,211 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 37 [2022-07-21 01:58:54,264 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 01:58:54,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 34 [2022-07-21 01:58:54,268 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 22 treesize of output 16 [2022-07-21 01:58:56,411 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:56,428 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:56,429 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:58:56,429 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:58:56,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [902961523] [2022-07-21 01:58:56,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [902961523] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:58:56,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:58:56,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 01:58:56,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131411474] [2022-07-21 01:58:56,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:58:56,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 01:58:56,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:58:56,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 01:58:56,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=85, Unknown=5, NotChecked=0, Total=110 [2022-07-21 01:58:56,430 INFO L87 Difference]: Start difference. First operand 189 states and 227 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 01:59:09,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:59:09,757 INFO L93 Difference]: Finished difference Result 208 states and 244 transitions. [2022-07-21 01:59:09,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 01:59:09,758 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-07-21 01:59:09,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:59:09,758 INFO L225 Difference]: With dead ends: 208 [2022-07-21 01:59:09,758 INFO L226 Difference]: Without dead ends: 205 [2022-07-21 01:59:09,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 24.4s TimeCoverageRelationStatistics Valid=54, Invalid=207, Unknown=11, NotChecked=0, Total=272 [2022-07-21 01:59:09,759 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 256 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 209 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-21 01:59:09,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 522 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 670 Invalid, 0 Unknown, 209 Unchecked, 1.1s Time] [2022-07-21 01:59:09,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-07-21 01:59:09,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 189. [2022-07-21 01:59:09,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 157 states have (on average 1.2229299363057324) internal successors, (192), 172 states have internal predecessors, (192), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-21 01:59:09,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 226 transitions. [2022-07-21 01:59:09,781 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 226 transitions. Word has length 29 [2022-07-21 01:59:09,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:59:09,781 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 226 transitions. [2022-07-21 01:59:09,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 01:59:09,782 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 226 transitions. [2022-07-21 01:59:09,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-21 01:59:09,783 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:59:09,783 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] [2022-07-21 01:59:09,810 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,012 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,013 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:59:10,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:59:10,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1765703232, now seen corresponding path program 1 times [2022-07-21 01:59:10,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:59:10,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2016621641] [2022-07-21 01:59:10,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:10,014 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:59:10,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:59:10,015 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,017 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,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:10,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-21 01:59:10,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:59:10,229 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 01:59:10,230 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:10,266 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 01:59:10,273 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 01:59:10,283 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 7 treesize of output 3 [2022-07-21 01:59:10,290 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 7 treesize of output 3 [2022-07-21 01:59:12,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:12,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:12,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:12,823 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:59:12,834 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-21 01:59:12,834 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 193 treesize of output 81 [2022-07-21 01:59:12,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 81 treesize of output 97 [2022-07-21 01:59:12,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:12,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 40 [2022-07-21 01:59:12,860 INFO L356 Elim1Store]: treesize reduction 23, result has 39.5 percent of original size [2022-07-21 01:59:12,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 52 [2022-07-21 01:59:13,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:13,002 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 20 treesize of output 22 [2022-07-21 01:59:13,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:13,009 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:59:13,011 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 01:59:13,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 52 [2022-07-21 01:59:13,549 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 23 treesize of output 7 [2022-07-21 01:59:13,658 INFO L356 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2022-07-21 01:59:13,659 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 48 treesize of output 22 [2022-07-21 01:59:13,701 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:13,701 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:59:13,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:59:13,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2016621641] [2022-07-21 01:59:13,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2016621641] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:59:13,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:59:13,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 01:59:13,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735021333] [2022-07-21 01:59:13,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:59:13,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 01:59:13,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:59:13,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 01:59:13,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=105, Unknown=5, NotChecked=0, Total=132 [2022-07-21 01:59:13,702 INFO L87 Difference]: Start difference. First operand 189 states and 226 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 01:59:14,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:59:14,446 INFO L93 Difference]: Finished difference Result 209 states and 246 transitions. [2022-07-21 01:59:14,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 01:59:14,448 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-07-21 01:59:14,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:59:14,449 INFO L225 Difference]: With dead ends: 209 [2022-07-21 01:59:14,449 INFO L226 Difference]: Without dead ends: 206 [2022-07-21 01:59:14,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=35, Invalid=168, Unknown=7, NotChecked=0, Total=210 [2022-07-21 01:59:14,449 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 9 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 253 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 01:59:14,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 790 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 172 Invalid, 0 Unknown, 253 Unchecked, 0.4s Time] [2022-07-21 01:59:14,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-07-21 01:59:14,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 203. [2022-07-21 01:59:14,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 171 states have (on average 1.2046783625730995) internal successors, (206), 185 states have internal predecessors, (206), 25 states have call successors, (25), 8 states have call predecessors, (25), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-21 01:59:14,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 240 transitions. [2022-07-21 01:59:14,480 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 240 transitions. Word has length 32 [2022-07-21 01:59:14,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:59:14,481 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 240 transitions. [2022-07-21 01:59:14,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 01:59:14,481 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 240 transitions. [2022-07-21 01:59:14,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-21 01:59:14,485 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:59:14,485 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:59:14,496 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:14,695 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:14,696 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:59:14,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:59:14,696 INFO L85 PathProgramCache]: Analyzing trace with hash -123071722, now seen corresponding path program 1 times [2022-07-21 01:59:14,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:59:14,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [857580845] [2022-07-21 01:59:14,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:14,697 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:59:14,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:59:14,698 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:14,699 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:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:14,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-21 01:59:14,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:59:15,213 INFO L356 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-07-21 01:59:15,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2022-07-21 01:59:15,229 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 8 treesize of output 7 [2022-07-21 01:59:15,244 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 8 treesize of output 7 [2022-07-21 01:59:15,264 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 8 treesize of output 7 [2022-07-21 01:59:23,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:23,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 16 [2022-07-21 01:59:23,648 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 5 treesize of output 3 [2022-07-21 01:59:23,692 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 5 treesize of output 3 [2022-07-21 01:59:24,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:24,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:24,135 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-07-21 01:59:24,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 62 [2022-07-21 01:59:24,144 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 5 treesize of output 3 [2022-07-21 01:59:24,227 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 5 treesize of output 3 [2022-07-21 01:59:24,353 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 5 treesize of output 3 [2022-07-21 01:59:24,467 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 5 treesize of output 3 [2022-07-21 01:59:24,650 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 5 treesize of output 3 [2022-07-21 01:59:24,752 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 5 treesize of output 3 [2022-07-21 01:59:24,837 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 5 treesize of output 3 [2022-07-21 01:59:25,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 01:59:25,394 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 5 treesize of output 3 [2022-07-21 01:59:25,471 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 5 treesize of output 3 [2022-07-21 01:59:25,649 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 5 treesize of output 3 [2022-07-21 01:59:25,726 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 5 treesize of output 3 [2022-07-21 01:59:25,821 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 5 treesize of output 3 [2022-07-21 01:59:25,982 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 7 treesize of output 5 [2022-07-21 01:59:26,041 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 7 treesize of output 5 [2022-07-21 01:59:26,155 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 7 treesize of output 5 [2022-07-21 01:59:26,516 INFO L356 Elim1Store]: treesize reduction 63, result has 45.2 percent of original size [2022-07-21 01:59:26,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 908 treesize of output 910 [2022-07-21 01:59:26,582 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 8 treesize of output 7 [2022-07-21 01:59:26,702 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-21 01:59:26,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 [2022-07-21 01:59:26,936 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:26,955 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 01:59:26,955 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:59:26,955 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:59:26,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [857580845] [2022-07-21 01:59:26,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [857580845] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:59:26,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:59:26,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 01:59:26,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820891247] [2022-07-21 01:59:26,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:59:26,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 01:59:26,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:59:26,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 01:59:26,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=65, Unknown=2, NotChecked=0, Total=90 [2022-07-21 01:59:26,956 INFO L87 Difference]: Start difference. First operand 203 states and 240 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 01:59:27,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:59:27,521 INFO L93 Difference]: Finished difference Result 296 states and 349 transitions. [2022-07-21 01:59:27,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 01:59:27,521 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2022-07-21 01:59:27,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:59:27,523 INFO L225 Difference]: With dead ends: 296 [2022-07-21 01:59:27,523 INFO L226 Difference]: Without dead ends: 290 [2022-07-21 01:59:27,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=50, Invalid=129, Unknown=3, NotChecked=0, Total=182 [2022-07-21 01:59:27,524 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 242 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 01:59:27,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 639 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 245 Invalid, 0 Unknown, 109 Unchecked, 0.4s Time] [2022-07-21 01:59:27,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-07-21 01:59:27,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 275. [2022-07-21 01:59:27,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 237 states have (on average 1.2151898734177216) internal successors, (288), 252 states have internal predecessors, (288), 29 states have call successors, (29), 11 states have call predecessors, (29), 8 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-07-21 01:59:27,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 329 transitions. [2022-07-21 01:59:27,537 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 329 transitions. Word has length 35 [2022-07-21 01:59:27,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:59:27,538 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 329 transitions. [2022-07-21 01:59:27,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 01:59:27,538 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 329 transitions. [2022-07-21 01:59:27,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-21 01:59:27,539 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:59:27,539 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] [2022-07-21 01:59:27,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-07-21 01:59:27,749 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:27,750 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:59:27,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:59:27,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1378941963, now seen corresponding path program 1 times [2022-07-21 01:59:27,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:59:27,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2012016392] [2022-07-21 01:59:27,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:27,751 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:59:27,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:59:27,753 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:27,759 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:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:27,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 70 conjunts are in the unsatisfiable core [2022-07-21 01:59:27,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:59:27,989 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 01:59:27,989 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:28,023 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 01:59:28,027 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 01:59:28,036 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 7 treesize of output 3 [2022-07-21 01:59:28,038 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 7 treesize of output 3 [2022-07-21 01:59:30,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:30,629 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 157 [2022-07-21 01:59:30,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:30,646 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 35 treesize of output 30 [2022-07-21 01:59:30,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:30,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:30,665 INFO L356 Elim1Store]: treesize reduction 17, result has 34.6 percent of original size [2022-07-21 01:59:30,666 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 50 [2022-07-21 01:59:30,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:30,671 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 0 case distinctions, treesize of input 21 treesize of output 23 [2022-07-21 01:59:30,755 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 01:59:30,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 59 [2022-07-21 01:59:30,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:30,759 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:59:30,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:30,770 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-07-21 01:59:30,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 58 [2022-07-21 01:59:31,326 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 30 treesize of output 18 [2022-07-21 01:59:31,438 INFO L356 Elim1Store]: treesize reduction 35, result has 18.6 percent of original size [2022-07-21 01:59:31,438 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 23 [2022-07-21 01:59:31,486 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:31,487 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:59:31,487 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:59:31,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2012016392] [2022-07-21 01:59:31,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2012016392] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:59:31,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:59:31,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 01:59:31,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14547115] [2022-07-21 01:59:31,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:59:31,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 01:59:31,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:59:31,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 01:59:31,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=105, Unknown=5, NotChecked=0, Total=132 [2022-07-21 01:59:31,488 INFO L87 Difference]: Start difference. First operand 275 states and 329 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 01:59:33,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:59:33,660 INFO L93 Difference]: Finished difference Result 293 states and 345 transitions. [2022-07-21 01:59:33,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 01:59:33,661 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-07-21 01:59:33,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:59:33,662 INFO L225 Difference]: With dead ends: 293 [2022-07-21 01:59:33,662 INFO L226 Difference]: Without dead ends: 290 [2022-07-21 01:59:33,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=66, Invalid=264, Unknown=12, NotChecked=0, Total=342 [2022-07-21 01:59:33,663 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 258 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-21 01:59:33,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 517 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 751 Invalid, 0 Unknown, 138 Unchecked, 1.4s Time] [2022-07-21 01:59:33,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-07-21 01:59:33,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 275. [2022-07-21 01:59:33,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 237 states have (on average 1.2109704641350212) internal successors, (287), 252 states have internal predecessors, (287), 29 states have call successors, (29), 11 states have call predecessors, (29), 8 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-07-21 01:59:33,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 328 transitions. [2022-07-21 01:59:33,690 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 328 transitions. Word has length 35 [2022-07-21 01:59:33,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:59:33,690 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 328 transitions. [2022-07-21 01:59:33,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 01:59:33,691 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 328 transitions. [2022-07-21 01:59:33,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-21 01:59:33,692 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:59:33,692 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2022-07-21 01:59:33,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-21 01:59:33,903 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:33,903 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:59:33,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:59:33,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1206750989, now seen corresponding path program 1 times [2022-07-21 01:59:33,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:59:33,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1156041572] [2022-07-21 01:59:33,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:33,904 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:59:33,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:59:33,920 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:33,953 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:34,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:34,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 84 conjunts are in the unsatisfiable core [2022-07-21 01:59:34,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:59:34,307 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-21 01:59:34,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 39 [2022-07-21 01:59:34,369 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:34,378 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:34,390 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 7 treesize of output 3 [2022-07-21 01:59:34,395 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 7 treesize of output 3 [2022-07-21 01:59:34,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:34,527 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 44 [2022-07-21 01:59:34,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:34,541 INFO L356 Elim1Store]: treesize reduction 44, result has 6.4 percent of original size [2022-07-21 01:59:34,542 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 39 treesize of output 38 [2022-07-21 01:59:34,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:34,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2022-07-21 01:59:34,551 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:34,605 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 01:59:34,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 37 [2022-07-21 01:59:34,701 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-21 01:59:34,702 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 20 treesize of output 22 [2022-07-21 01:59:34,815 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 36 treesize of output 32 [2022-07-21 01:59:34,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:34,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2022-07-21 01:59:53,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:53,186 INFO L356 Elim1Store]: treesize reduction 167, result has 16.9 percent of original size [2022-07-21 01:59:53,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 64 [2022-07-21 01:59:57,346 INFO L356 Elim1Store]: treesize reduction 18, result has 50.0 percent of original size [2022-07-21 01:59:57,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 82 [2022-07-21 01:59:57,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:59:57,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1156041572] [2022-07-21 01:59:57,350 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-21 01:59:57,361 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:57,550 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:57,551 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:764) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:725) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:643) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:335) 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$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) 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.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) 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 01:59:57,554 INFO L158 Benchmark]: Toolchain (without parser) took 81461.04ms. Allocated memory was 58.7MB in the beginning and 117.4MB in the end (delta: 58.7MB). Free memory was 35.2MB in the beginning and 65.6MB in the end (delta: -30.4MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. [2022-07-21 01:59:57,554 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 58.7MB. Free memory is still 40.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 01:59:57,554 INFO L158 Benchmark]: CACSL2BoogieTranslator took 462.03ms. Allocated memory was 58.7MB in the beginning and 79.7MB in the end (delta: 21.0MB). Free memory was 35.0MB in the beginning and 52.6MB in the end (delta: -17.5MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2022-07-21 01:59:57,555 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.51ms. Allocated memory is still 79.7MB. Free memory was 52.2MB in the beginning and 49.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 01:59:57,555 INFO L158 Benchmark]: Boogie Preprocessor took 48.87ms. Allocated memory is still 79.7MB. Free memory was 49.8MB in the beginning and 47.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 01:59:57,555 INFO L158 Benchmark]: RCFGBuilder took 577.61ms. Allocated memory is still 79.7MB. Free memory was 46.7MB in the beginning and 45.3MB in the end (delta: 1.4MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2022-07-21 01:59:57,555 INFO L158 Benchmark]: TraceAbstraction took 80319.18ms. Allocated memory was 79.7MB in the beginning and 117.4MB in the end (delta: 37.7MB). Free memory was 44.9MB in the beginning and 65.6MB in the end (delta: -20.7MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2022-07-21 01:59:57,556 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.15ms. Allocated memory is still 58.7MB. Free memory is still 40.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 462.03ms. Allocated memory was 58.7MB in the beginning and 79.7MB in the end (delta: 21.0MB). Free memory was 35.0MB in the beginning and 52.6MB in the end (delta: -17.5MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.51ms. Allocated memory is still 79.7MB. Free memory was 52.2MB in the beginning and 49.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.87ms. Allocated memory is still 79.7MB. Free memory was 49.8MB in the beginning and 47.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 577.61ms. Allocated memory is still 79.7MB. Free memory was 46.7MB in the beginning and 45.3MB in the end (delta: 1.4MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * TraceAbstraction took 80319.18ms. Allocated memory was 79.7MB in the beginning and 117.4MB in the end (delta: 37.7MB). Free memory was 44.9MB in the beginning and 65.6MB in the end (delta: -20.7MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Should have been eliminated by DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-21 01:59:57,592 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: AssertionError: Should have been eliminated by DER