./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-multidimensional/max-3-n-u.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-multidimensional/max-3-n-u.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6c8d330fcf7e017e6b51632eb7a9f8f167fb4f3e932700b6ef82da7b1572a2f0 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 00:23:19,813 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 00:23:19,828 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 00:23:19,866 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 00:23:19,867 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 00:23:19,870 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 00:23:19,871 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 00:23:19,876 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 00:23:19,878 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 00:23:19,883 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 00:23:19,884 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 00:23:19,885 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 00:23:19,885 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 00:23:19,888 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 00:23:19,889 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 00:23:19,893 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 00:23:19,894 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 00:23:19,895 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 00:23:19,897 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 00:23:19,903 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 00:23:19,904 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 00:23:19,905 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 00:23:19,907 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 00:23:19,907 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 00:23:19,909 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 00:23:19,910 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 00:23:19,910 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 00:23:19,911 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 00:23:19,912 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 00:23:19,912 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 00:23:19,913 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 00:23:19,914 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 00:23:19,915 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 00:23:19,916 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 00:23:19,917 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 00:23:19,917 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 00:23:19,917 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 00:23:19,917 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 00:23:19,918 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 00:23:19,918 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 00:23:19,919 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 00:23:19,919 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 00:23:19,954 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 00:23:19,954 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 00:23:19,955 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 00:23:19,955 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 00:23:19,955 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 00:23:19,955 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 00:23:19,956 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 00:23:19,956 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 00:23:19,956 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 00:23:19,956 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 00:23:19,957 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 00:23:19,957 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 00:23:19,958 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 00:23:19,958 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 00:23:19,958 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 00:23:19,958 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 00:23:19,958 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 00:23:19,958 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 00:23:19,958 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 00:23:19,959 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 00:23:19,959 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 00:23:19,959 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 00:23:19,959 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 00:23:19,959 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 00:23:19,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 00:23:19,960 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 00:23:19,960 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 00:23:19,961 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 00:23:19,961 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 00:23:19,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 00:23:19,961 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 00:23:19,962 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 00:23:19,962 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 00:23:19,962 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 00:23:19,962 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 -> 6c8d330fcf7e017e6b51632eb7a9f8f167fb4f3e932700b6ef82da7b1572a2f0 [2021-12-17 00:23:20,136 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 00:23:20,157 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 00:23:20,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 00:23:20,161 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 00:23:20,162 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 00:23:20,163 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/max-3-n-u.c [2021-12-17 00:23:20,227 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84b043373/62120f5881cc46abb1303d5f29b53f2f/FLAG7173f38b7 [2021-12-17 00:23:20,601 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 00:23:20,601 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/max-3-n-u.c [2021-12-17 00:23:20,606 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84b043373/62120f5881cc46abb1303d5f29b53f2f/FLAG7173f38b7 [2021-12-17 00:23:20,615 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84b043373/62120f5881cc46abb1303d5f29b53f2f [2021-12-17 00:23:20,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 00:23:20,618 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 00:23:20,619 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 00:23:20,620 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 00:23:20,622 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 00:23:20,623 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 12:23:20" (1/1) ... [2021-12-17 00:23:20,623 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c80f1e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:23:20, skipping insertion in model container [2021-12-17 00:23:20,623 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 12:23:20" (1/1) ... [2021-12-17 00:23:20,628 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 00:23:20,638 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 00:23:20,757 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/max-3-n-u.c[321,334] [2021-12-17 00:23:20,785 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 00:23:20,791 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 00:23:20,799 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/max-3-n-u.c[321,334] [2021-12-17 00:23:20,806 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 00:23:20,820 INFO L208 MainTranslator]: Completed translation [2021-12-17 00:23:20,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:23:20 WrapperNode [2021-12-17 00:23:20,821 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 00:23:20,822 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 00:23:20,822 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 00:23:20,822 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 00:23:20,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:23:20" (1/1) ... [2021-12-17 00:23:20,832 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:23:20" (1/1) ... [2021-12-17 00:23:20,849 INFO L137 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 109 [2021-12-17 00:23:20,850 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 00:23:20,850 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 00:23:20,850 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 00:23:20,850 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 00:23:20,856 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:23:20" (1/1) ... [2021-12-17 00:23:20,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:23:20" (1/1) ... [2021-12-17 00:23:20,858 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:23:20" (1/1) ... [2021-12-17 00:23:20,858 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:23:20" (1/1) ... [2021-12-17 00:23:20,861 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:23:20" (1/1) ... [2021-12-17 00:23:20,865 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:23:20" (1/1) ... [2021-12-17 00:23:20,866 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:23:20" (1/1) ... [2021-12-17 00:23:20,868 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 00:23:20,869 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 00:23:20,869 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 00:23:20,869 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 00:23:20,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:23:20" (1/1) ... [2021-12-17 00:23:20,878 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 00:23:20,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 00:23:20,897 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) [2021-12-17 00:23:20,899 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 [2021-12-17 00:23:20,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 00:23:20,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 00:23:20,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 00:23:20,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-17 00:23:20,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 00:23:20,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 00:23:20,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-17 00:23:20,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 00:23:20,997 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 00:23:20,999 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 00:23:21,115 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 00:23:21,120 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 00:23:21,121 INFO L301 CfgBuilder]: Removed 9 assume(true) statements. [2021-12-17 00:23:21,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 12:23:21 BoogieIcfgContainer [2021-12-17 00:23:21,122 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 00:23:21,124 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 00:23:21,124 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 00:23:21,146 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 00:23:21,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 12:23:20" (1/3) ... [2021-12-17 00:23:21,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e427c68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 12:23:21, skipping insertion in model container [2021-12-17 00:23:21,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:23:20" (2/3) ... [2021-12-17 00:23:21,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e427c68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 12:23:21, skipping insertion in model container [2021-12-17 00:23:21,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 12:23:21" (3/3) ... [2021-12-17 00:23:21,150 INFO L111 eAbstractionObserver]: Analyzing ICFG max-3-n-u.c [2021-12-17 00:23:21,155 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 00:23:21,156 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 00:23:21,237 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 00:23:21,244 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 00:23:21,244 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 00:23:21,257 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:23:21,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-17 00:23:21,263 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 00:23:21,263 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 00:23:21,264 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 00:23:21,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 00:23:21,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1361272673, now seen corresponding path program 1 times [2021-12-17 00:23:21,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 00:23:21,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501716128] [2021-12-17 00:23:21,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 00:23:21,278 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 00:23:21,337 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 00:23:21,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [193228230] [2021-12-17 00:23:21,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 00:23:21,338 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 00:23:21,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 00:23:21,354 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) [2021-12-17 00:23:21,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-17 00:23:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 00:23:21,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-17 00:23:21,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 00:23:21,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 00:23:21,460 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 00:23:21,461 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 00:23:21,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501716128] [2021-12-17 00:23:21,462 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 00:23:21,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193228230] [2021-12-17 00:23:21,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193228230] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 00:23:21,464 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 00:23:21,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 00:23:21,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957765587] [2021-12-17 00:23:21,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 00:23:21,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 00:23:21,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 00:23:21,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 00:23:21,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 00:23:21,500 INFO L87 Difference]: Start difference. First operand has 29 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:23:21,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 00:23:21,517 INFO L93 Difference]: Finished difference Result 56 states and 94 transitions. [2021-12-17 00:23:21,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 00:23:21,519 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-17 00:23:21,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 00:23:21,524 INFO L225 Difference]: With dead ends: 56 [2021-12-17 00:23:21,531 INFO L226 Difference]: Without dead ends: 25 [2021-12-17 00:23:21,534 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 00:23:21,540 INFO L933 BasicCegarLoop]: 38 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, 38 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 [2021-12-17 00:23:21,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 00:23:21,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-17 00:23:21,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-12-17 00:23:21,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:23:21,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2021-12-17 00:23:21,572 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 11 [2021-12-17 00:23:21,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 00:23:21,573 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2021-12-17 00:23:21,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:23:21,574 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2021-12-17 00:23:21,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-17 00:23:21,574 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 00:23:21,575 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 00:23:21,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-17 00:23:21,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2021-12-17 00:23:21,794 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 00:23:21,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 00:23:21,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1322753665, now seen corresponding path program 1 times [2021-12-17 00:23:21,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 00:23:21,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859079086] [2021-12-17 00:23:21,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 00:23:21,795 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 00:23:21,807 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 00:23:21,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1547623921] [2021-12-17 00:23:21,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 00:23:21,810 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 00:23:21,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 00:23:21,811 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 00:23:21,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-17 00:23:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 00:23:21,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 00:23:21,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 00:23:21,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 00:23:21,912 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 00:23:21,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 00:23:21,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859079086] [2021-12-17 00:23:21,912 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 00:23:21,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547623921] [2021-12-17 00:23:21,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547623921] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 00:23:21,913 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 00:23:21,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 00:23:21,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831756020] [2021-12-17 00:23:21,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 00:23:21,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 00:23:21,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 00:23:21,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 00:23:21,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 00:23:21,915 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:23:21,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 00:23:21,936 INFO L93 Difference]: Finished difference Result 48 states and 66 transitions. [2021-12-17 00:23:21,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 00:23:21,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-17 00:23:21,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 00:23:21,937 INFO L225 Difference]: With dead ends: 48 [2021-12-17 00:23:21,937 INFO L226 Difference]: Without dead ends: 30 [2021-12-17 00:23:21,937 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 00:23:21,938 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 6 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 00:23:21,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 50 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 00:23:21,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-17 00:23:21,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2021-12-17 00:23:21,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.4) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:23:21,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2021-12-17 00:23:21,943 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 11 [2021-12-17 00:23:21,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 00:23:21,943 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2021-12-17 00:23:21,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:23:21,943 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2021-12-17 00:23:21,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-17 00:23:21,944 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 00:23:21,944 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 00:23:21,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-17 00:23:22,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2021-12-17 00:23:22,154 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 00:23:22,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 00:23:22,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1329032119, now seen corresponding path program 1 times [2021-12-17 00:23:22,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 00:23:22,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341201022] [2021-12-17 00:23:22,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 00:23:22,155 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 00:23:22,165 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 00:23:22,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1567894640] [2021-12-17 00:23:22,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 00:23:22,166 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 00:23:22,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 00:23:22,170 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 00:23:22,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-17 00:23:22,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 00:23:22,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 00:23:22,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 00:23:22,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 00:23:22,243 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 00:23:22,244 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 00:23:22,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341201022] [2021-12-17 00:23:22,244 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 00:23:22,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567894640] [2021-12-17 00:23:22,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567894640] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 00:23:22,244 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 00:23:22,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 00:23:22,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004527144] [2021-12-17 00:23:22,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 00:23:22,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 00:23:22,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 00:23:22,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 00:23:22,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-17 00:23:22,246 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:23:22,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 00:23:22,282 INFO L93 Difference]: Finished difference Result 67 states and 93 transitions. [2021-12-17 00:23:22,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 00:23:22,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-17 00:23:22,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 00:23:22,284 INFO L225 Difference]: With dead ends: 67 [2021-12-17 00:23:22,284 INFO L226 Difference]: Without dead ends: 44 [2021-12-17 00:23:22,284 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-17 00:23:22,285 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 70 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 00:23:22,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 36 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 00:23:22,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-12-17 00:23:22,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 29. [2021-12-17 00:23:22,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:23:22,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2021-12-17 00:23:22,290 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 14 [2021-12-17 00:23:22,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 00:23:22,290 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2021-12-17 00:23:22,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:23:22,290 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2021-12-17 00:23:22,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-17 00:23:22,291 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 00:23:22,291 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 00:23:22,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-17 00:23:22,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 00:23:22,505 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 00:23:22,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 00:23:22,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1416884703, now seen corresponding path program 1 times [2021-12-17 00:23:22,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 00:23:22,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858324354] [2021-12-17 00:23:22,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 00:23:22,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 00:23:22,512 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 00:23:22,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1223198163] [2021-12-17 00:23:22,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 00:23:22,515 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 00:23:22,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 00:23:22,516 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 00:23:22,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-17 00:23:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 00:23:22,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 00:23:22,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 00:23:22,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 00:23:22,603 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 00:23:22,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 00:23:22,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858324354] [2021-12-17 00:23:22,604 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 00:23:22,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223198163] [2021-12-17 00:23:22,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223198163] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 00:23:22,604 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 00:23:22,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 00:23:22,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737009804] [2021-12-17 00:23:22,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 00:23:22,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 00:23:22,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 00:23:22,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 00:23:22,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-17 00:23:22,606 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:23:22,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 00:23:22,655 INFO L93 Difference]: Finished difference Result 67 states and 90 transitions. [2021-12-17 00:23:22,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 00:23:22,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-17 00:23:22,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 00:23:22,656 INFO L225 Difference]: With dead ends: 67 [2021-12-17 00:23:22,657 INFO L226 Difference]: Without dead ends: 41 [2021-12-17 00:23:22,660 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-17 00:23:22,662 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 34 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 00:23:22,663 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 42 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 00:23:22,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-12-17 00:23:22,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2021-12-17 00:23:22,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:23:22,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2021-12-17 00:23:22,675 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 17 [2021-12-17 00:23:22,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 00:23:22,678 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2021-12-17 00:23:22,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:23:22,678 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2021-12-17 00:23:22,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-17 00:23:22,679 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 00:23:22,680 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 00:23:22,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-17 00:23:22,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 00:23:22,897 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 00:23:22,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 00:23:22,898 INFO L85 PathProgramCache]: Analyzing trace with hash 109301050, now seen corresponding path program 1 times [2021-12-17 00:23:22,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 00:23:22,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395129280] [2021-12-17 00:23:22,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 00:23:22,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 00:23:22,919 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 00:23:22,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [124792574] [2021-12-17 00:23:22,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 00:23:22,919 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 00:23:22,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 00:23:22,921 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 00:23:22,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-17 00:23:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 00:23:22,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-17 00:23:22,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 00:23:23,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 00:23:23,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 00:23:23,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 00:23:23,067 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 00:23:23,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395129280] [2021-12-17 00:23:23,067 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 00:23:23,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124792574] [2021-12-17 00:23:23,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124792574] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 00:23:23,067 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 00:23:23,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-12-17 00:23:23,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240556412] [2021-12-17 00:23:23,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 00:23:23,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 00:23:23,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 00:23:23,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 00:23:23,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-12-17 00:23:23,069 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:23:23,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 00:23:23,171 INFO L93 Difference]: Finished difference Result 91 states and 122 transitions. [2021-12-17 00:23:23,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 00:23:23,172 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-17 00:23:23,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 00:23:23,172 INFO L225 Difference]: With dead ends: 91 [2021-12-17 00:23:23,172 INFO L226 Difference]: Without dead ends: 62 [2021-12-17 00:23:23,173 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2021-12-17 00:23:23,173 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 110 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 00:23:23,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 51 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 00:23:23,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-12-17 00:23:23,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2021-12-17 00:23:23,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:23:23,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2021-12-17 00:23:23,187 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 18 [2021-12-17 00:23:23,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 00:23:23,188 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2021-12-17 00:23:23,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:23:23,188 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2021-12-17 00:23:23,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-17 00:23:23,189 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 00:23:23,189 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 00:23:23,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-17 00:23:23,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 00:23:23,390 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 00:23:23,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 00:23:23,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1195208863, now seen corresponding path program 2 times [2021-12-17 00:23:23,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 00:23:23,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624871867] [2021-12-17 00:23:23,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 00:23:23,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 00:23:23,397 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 00:23:23,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [577379997] [2021-12-17 00:23:23,398 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 00:23:23,398 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 00:23:23,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 00:23:23,399 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 00:23:23,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-17 00:23:23,432 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-17 00:23:23,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 00:23:23,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 00:23:23,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 00:23:23,479 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-17 00:23:23,480 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 00:23:23,480 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 00:23:23,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624871867] [2021-12-17 00:23:23,480 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 00:23:23,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577379997] [2021-12-17 00:23:23,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577379997] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 00:23:23,480 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 00:23:23,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 00:23:23,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448553305] [2021-12-17 00:23:23,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 00:23:23,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 00:23:23,481 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 00:23:23,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 00:23:23,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-17 00:23:23,482 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:23:23,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 00:23:23,517 INFO L93 Difference]: Finished difference Result 121 states and 155 transitions. [2021-12-17 00:23:23,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 00:23:23,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-17 00:23:23,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 00:23:23,519 INFO L225 Difference]: With dead ends: 121 [2021-12-17 00:23:23,519 INFO L226 Difference]: Without dead ends: 100 [2021-12-17 00:23:23,519 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-17 00:23:23,520 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 68 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 00:23:23,520 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 41 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 00:23:23,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-17 00:23:23,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 54. [2021-12-17 00:23:23,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 53 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:23:23,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2021-12-17 00:23:23,527 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 21 [2021-12-17 00:23:23,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 00:23:23,528 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2021-12-17 00:23:23,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:23:23,528 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2021-12-17 00:23:23,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-17 00:23:23,528 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 00:23:23,529 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 00:23:23,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-17 00:23:23,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 00:23:23,747 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 00:23:23,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 00:23:23,748 INFO L85 PathProgramCache]: Analyzing trace with hash 238928719, now seen corresponding path program 1 times [2021-12-17 00:23:23,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 00:23:23,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102439592] [2021-12-17 00:23:23,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 00:23:23,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 00:23:23,767 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 00:23:23,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1781664011] [2021-12-17 00:23:23,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 00:23:23,768 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 00:23:23,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 00:23:23,770 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 00:23:23,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-17 00:23:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 00:23:23,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-17 00:23:23,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 00:23:23,962 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-17 00:23:23,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 00:23:24,065 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-17 00:23:24,065 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 00:23:24,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102439592] [2021-12-17 00:23:24,065 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 00:23:24,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781664011] [2021-12-17 00:23:24,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781664011] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 00:23:24,066 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 00:23:24,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-12-17 00:23:24,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107943268] [2021-12-17 00:23:24,066 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 00:23:24,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-17 00:23:24,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 00:23:24,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-17 00:23:24,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2021-12-17 00:23:24,067 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:23:24,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 00:23:24,250 INFO L93 Difference]: Finished difference Result 166 states and 217 transitions. [2021-12-17 00:23:24,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 00:23:24,250 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-12-17 00:23:24,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 00:23:24,251 INFO L225 Difference]: With dead ends: 166 [2021-12-17 00:23:24,251 INFO L226 Difference]: Without dead ends: 115 [2021-12-17 00:23:24,251 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=151, Invalid=191, Unknown=0, NotChecked=0, Total=342 [2021-12-17 00:23:24,252 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 305 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 00:23:24,252 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [305 Valid, 86 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 00:23:24,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-12-17 00:23:24,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 96. [2021-12-17 00:23:24,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.2947368421052632) internal successors, (123), 95 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:23:24,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 123 transitions. [2021-12-17 00:23:24,260 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 123 transitions. Word has length 39 [2021-12-17 00:23:24,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 00:23:24,261 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 123 transitions. [2021-12-17 00:23:24,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:23:24,261 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 123 transitions. [2021-12-17 00:23:24,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-17 00:23:24,262 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 00:23:24,262 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 00:23:24,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-17 00:23:24,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 00:23:24,483 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 00:23:24,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 00:23:24,483 INFO L85 PathProgramCache]: Analyzing trace with hash 66224111, now seen corresponding path program 2 times [2021-12-17 00:23:24,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 00:23:24,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835581933] [2021-12-17 00:23:24,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 00:23:24,483 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 00:23:24,493 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 00:23:24,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [817371900] [2021-12-17 00:23:24,493 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 00:23:24,493 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 00:23:24,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 00:23:24,494 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 00:23:24,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-17 00:23:24,559 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 00:23:24,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 00:23:24,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-17 00:23:24,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 00:23:24,787 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 2 proven. 55 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2021-12-17 00:23:24,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 00:23:25,000 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 2 proven. 55 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2021-12-17 00:23:25,000 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 00:23:25,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835581933] [2021-12-17 00:23:25,000 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 00:23:25,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817371900] [2021-12-17 00:23:25,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817371900] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 00:23:25,001 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 00:23:25,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2021-12-17 00:23:25,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684258132] [2021-12-17 00:23:25,001 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 00:23:25,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-17 00:23:25,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 00:23:25,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-17 00:23:25,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=347, Unknown=0, NotChecked=0, Total=650 [2021-12-17 00:23:25,002 INFO L87 Difference]: Start difference. First operand 96 states and 123 transitions. Second operand has 26 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:23:25,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 00:23:25,464 INFO L93 Difference]: Finished difference Result 316 states and 409 transitions. [2021-12-17 00:23:25,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-17 00:23:25,465 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-12-17 00:23:25,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 00:23:25,466 INFO L225 Difference]: With dead ends: 316 [2021-12-17 00:23:25,466 INFO L226 Difference]: Without dead ends: 223 [2021-12-17 00:23:25,467 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=589, Invalid=743, Unknown=0, NotChecked=0, Total=1332 [2021-12-17 00:23:25,467 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 711 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 00:23:25,468 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [711 Valid, 158 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 00:23:25,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-12-17 00:23:25,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 180. [2021-12-17 00:23:25,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 1.2905027932960893) internal successors, (231), 179 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:23:25,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 231 transitions. [2021-12-17 00:23:25,482 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 231 transitions. Word has length 63 [2021-12-17 00:23:25,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 00:23:25,482 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 231 transitions. [2021-12-17 00:23:25,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:23:25,482 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 231 transitions. [2021-12-17 00:23:25,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-12-17 00:23:25,484 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 00:23:25,484 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 00:23:25,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-17 00:23:25,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-12-17 00:23:25,703 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 00:23:25,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 00:23:25,703 INFO L85 PathProgramCache]: Analyzing trace with hash 811802927, now seen corresponding path program 3 times [2021-12-17 00:23:25,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 00:23:25,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144347980] [2021-12-17 00:23:25,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 00:23:25,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 00:23:25,715 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 00:23:25,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1104938545] [2021-12-17 00:23:25,716 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 00:23:25,716 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 00:23:25,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 00:23:25,717 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 00:23:25,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-17 00:23:25,770 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-17 00:23:25,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 00:23:25,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-17 00:23:25,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 00:23:26,121 INFO L134 CoverageAnalysis]: Checked inductivity of 972 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 971 trivial. 0 not checked. [2021-12-17 00:23:26,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 00:23:26,330 INFO L134 CoverageAnalysis]: Checked inductivity of 972 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 971 trivial. 0 not checked. [2021-12-17 00:23:26,330 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 00:23:26,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144347980] [2021-12-17 00:23:26,331 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 00:23:26,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104938545] [2021-12-17 00:23:26,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104938545] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 00:23:26,331 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 00:23:26,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-12-17 00:23:26,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693255381] [2021-12-17 00:23:26,331 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 00:23:26,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 00:23:26,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 00:23:26,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 00:23:26,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-12-17 00:23:26,333 INFO L87 Difference]: Start difference. First operand 180 states and 231 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:23:26,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 00:23:26,426 INFO L93 Difference]: Finished difference Result 852 states and 1104 transitions. [2021-12-17 00:23:26,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 00:23:26,426 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2021-12-17 00:23:26,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 00:23:26,429 INFO L225 Difference]: With dead ends: 852 [2021-12-17 00:23:26,429 INFO L226 Difference]: Without dead ends: 703 [2021-12-17 00:23:26,430 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2021-12-17 00:23:26,430 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 267 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 00:23:26,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 78 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 00:23:26,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2021-12-17 00:23:26,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 480. [2021-12-17 00:23:26,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 479 states have (on average 1.2713987473903967) internal successors, (609), 479 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:23:26,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 609 transitions. [2021-12-17 00:23:26,454 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 609 transitions. Word has length 111 [2021-12-17 00:23:26,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 00:23:26,455 INFO L470 AbstractCegarLoop]: Abstraction has 480 states and 609 transitions. [2021-12-17 00:23:26,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:23:26,455 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 609 transitions. [2021-12-17 00:23:26,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2021-12-17 00:23:26,473 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 00:23:26,474 INFO L514 BasicCegarLoop]: trace histogram [88, 88, 88, 88, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 00:23:26,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-17 00:23:26,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 00:23:26,692 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 00:23:26,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 00:23:26,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1613933369, now seen corresponding path program 4 times [2021-12-17 00:23:26,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 00:23:26,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541490734] [2021-12-17 00:23:26,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 00:23:26,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 00:23:26,740 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 00:23:26,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [584910725] [2021-12-17 00:23:26,740 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 00:23:26,741 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 00:23:26,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 00:23:26,742 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 00:23:26,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-17 00:23:26,962 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 00:23:26,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 00:23:26,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 852 conjuncts, 275 conjunts are in the unsatisfiable core [2021-12-17 00:23:26,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 00:26:18,849 WARN L228 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2021-12-17 00:26:18,850 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 00:26:18,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541490734] [2021-12-17 00:26:18,850 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 00:26:18,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584910725] [2021-12-17 00:26:18,850 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2021-12-17 00:26:18,850 INFO L186 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2021-12-17 00:26:18,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-12-17 00:26:18,850 ERROR L172 FreeRefinementEngine]: Strategy CAMEL failed to provide any proof altough trace is infeasible [2021-12-17 00:26:18,850 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2021-12-17 00:26:18,857 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 00:26:18,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2021-12-17 00:26:18,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-17 00:26:19,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-17 00:26:19,062 INFO L732 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1] [2021-12-17 00:26:19,065 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 00:26:19,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 12:26:19 BoogieIcfgContainer [2021-12-17 00:26:19,144 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 00:26:19,145 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 00:26:19,145 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 00:26:19,145 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 00:26:19,145 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 12:23:21" (3/4) ... [2021-12-17 00:26:19,147 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-17 00:26:19,147 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 00:26:19,148 INFO L158 Benchmark]: Toolchain (without parser) took 178529.59ms. Allocated memory was 100.7MB in the beginning and 180.4MB in the end (delta: 79.7MB). Free memory was 70.9MB in the beginning and 141.6MB in the end (delta: -70.7MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2021-12-17 00:26:19,148 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 100.7MB. Free memory is still 58.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 00:26:19,148 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.50ms. Allocated memory is still 100.7MB. Free memory was 70.9MB in the beginning and 77.3MB in the end (delta: -6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 00:26:19,149 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.20ms. Allocated memory is still 100.7MB. Free memory was 77.3MB in the beginning and 75.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 00:26:19,149 INFO L158 Benchmark]: Boogie Preprocessor took 18.05ms. Allocated memory is still 100.7MB. Free memory was 75.4MB in the beginning and 74.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 00:26:19,149 INFO L158 Benchmark]: RCFGBuilder took 253.50ms. Allocated memory is still 100.7MB. Free memory was 74.3MB in the beginning and 63.4MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-17 00:26:19,149 INFO L158 Benchmark]: TraceAbstraction took 178020.27ms. Allocated memory was 100.7MB in the beginning and 180.4MB in the end (delta: 79.7MB). Free memory was 63.0MB in the beginning and 142.6MB in the end (delta: -79.7MB). Peak memory consumption was 93.6MB. Max. memory is 16.1GB. [2021-12-17 00:26:19,150 INFO L158 Benchmark]: Witness Printer took 2.82ms. Allocated memory is still 180.4MB. Free memory was 142.6MB in the beginning and 141.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 00:26:19,151 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.16ms. Allocated memory is still 100.7MB. Free memory is still 58.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 201.50ms. Allocated memory is still 100.7MB. Free memory was 70.9MB in the beginning and 77.3MB in the end (delta: -6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.20ms. Allocated memory is still 100.7MB. Free memory was 77.3MB in the beginning and 75.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.05ms. Allocated memory is still 100.7MB. Free memory was 75.4MB in the beginning and 74.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 253.50ms. Allocated memory is still 100.7MB. Free memory was 74.3MB in the beginning and 63.4MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 178020.27ms. Allocated memory was 100.7MB in the beginning and 180.4MB in the end (delta: 79.7MB). Free memory was 63.0MB in the beginning and 142.6MB in the end (delta: -79.7MB). Peak memory consumption was 93.6MB. Max. memory is 16.1GB. * Witness Printer took 2.82ms. Allocated memory is still 180.4MB. Free memory was 142.6MB in the beginning and 141.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 7]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L16] int i,j,k; [L17] int m=1000,n=1500,p=1800; [L18] int A [m][n][p]; [L19] int max; [L22] i=0 [L23] j=0 [L24] k=0 [L25] COND TRUE i < m [L26] j=0 [L27] k=0 [L28] COND TRUE j < n [L29] k=0 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND FALSE !(k < p) [L34] j=j+1 [L28] COND FALSE !(j < n) [L36] i=i+1 [L25] COND TRUE i < m [L26] j=0 [L27] k=0 [L28] COND TRUE j < n [L29] k=0 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND FALSE !(k < p) [L34] j=j+1 [L28] COND FALSE !(j < n) [L36] i=i+1 [L25] COND TRUE i < m [L26] j=0 [L27] k=0 [L28] COND TRUE j < n [L29] k=0 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND FALSE !(k < p) [L34] j=j+1 [L28] COND FALSE !(j < n) [L36] i=i+1 [L25] COND TRUE i < m [L26] j=0 [L27] k=0 [L28] COND TRUE j < n [L29] k=0 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND TRUE k < p [L31] A[i][j][k]= __VERIFIER_nondet_int() [L32] k=k+1 [L30] COND FALSE !(k < p) [L34] j=j+1 [L28] COND FALSE !(j < n) [L36] i=i+1 [L25] COND FALSE !(i < m) [L41] i=0 [L42] j=0 [L43] k=0 [L44] EXPR A [0][0][0] [L44] max=A [0][0][0] [L45] COND TRUE i < m [L46] j=0 [L47] k=0 [L48] COND TRUE j < n [L49] k=0 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND FALSE !(k < p) [L55] j=j+1 [L48] COND FALSE !(j < n) [L57] i=i+1 [L45] COND TRUE i < m [L46] j=0 [L47] k=0 [L48] COND TRUE j < n [L49] k=0 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND FALSE !(k < p) [L55] j=j+1 [L48] COND FALSE !(j < n) [L57] i=i+1 [L45] COND TRUE i < m [L46] j=0 [L47] k=0 [L48] COND TRUE j < n [L49] k=0 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND FALSE !(k < p) [L55] j=j+1 [L48] COND FALSE !(j < n) [L57] i=i+1 [L45] COND TRUE i < m [L46] j=0 [L47] k=0 [L48] COND TRUE j < n [L49] k=0 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND TRUE k < p [L51] EXPR A[i][j][k] [L51] COND TRUE A[i][j][k]>max [L52] EXPR A[i][j][k] [L52] max=A[i][j][k] [L53] k=k+1 [L50] COND FALSE !(k < p) [L55] j=j+1 [L48] COND FALSE !(j < n) [L57] i=i+1 [L45] COND FALSE !(i < m) [L63] i=0 [L64] j=0 [L65] k=0 [L66] COND TRUE i < m [L67] j=0 [L68] k=0 [L69] COND TRUE j < n [L70] k=0 [L71] COND TRUE k < p [L72] EXPR A[i][j][k] [L72] CALL __VERIFIER_assert(A[i][j][k]<=max) [L6] COND TRUE !(cond) [L7] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 177.8s, OverallIterations: 10, TraceHistogramMax: 88, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1571 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1571 mSDsluCounter, 580 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 346 mSDsCounter, 608 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 391 IncrementalHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 608 mSolverCounterUnsat, 234 mSDtfsCounter, 391 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 543 GetRequests, 468 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=480occurred in iteration=9, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 368 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 173.5s InterpolantComputationTime, 716 NumberOfCodeBlocks, 522 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 523 ConstructedInterpolants, 0 QuantifiedInterpolants, 1623 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1954 ConjunctsInSsa, 316 ConjunctsInUnsatCore, 13 InterpolantComputations, 5 PerfectInterpolantSequences, 2311/2445 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces 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/array-multidimensional/max-3-n-u.c -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 6c8d330fcf7e017e6b51632eb7a9f8f167fb4f3e932700b6ef82da7b1572a2f0 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 00:26:20,617 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 00:26:20,620 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 00:26:20,650 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 00:26:20,651 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 00:26:20,653 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 00:26:20,654 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 00:26:20,659 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 00:26:20,661 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 00:26:20,664 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 00:26:20,670 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 00:26:20,671 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 00:26:20,671 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 00:26:20,673 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 00:26:20,674 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 00:26:20,677 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 00:26:20,678 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 00:26:20,678 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 00:26:20,682 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 00:26:20,686 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 00:26:20,687 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 00:26:20,688 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 00:26:20,689 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 00:26:20,690 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 00:26:20,695 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 00:26:20,695 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 00:26:20,695 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 00:26:20,696 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 00:26:20,697 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 00:26:20,697 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 00:26:20,698 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 00:26:20,698 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 00:26:20,699 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 00:26:20,700 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 00:26:20,701 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 00:26:20,701 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 00:26:20,701 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 00:26:20,702 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 00:26:20,702 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 00:26:20,703 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 00:26:20,704 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 00:26:20,704 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-17 00:26:20,734 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 00:26:20,735 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 00:26:20,735 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 00:26:20,736 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 00:26:20,736 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 00:26:20,737 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 00:26:20,737 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 00:26:20,738 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 00:26:20,738 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 00:26:20,738 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 00:26:20,739 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 00:26:20,739 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 00:26:20,739 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 00:26:20,739 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 00:26:20,739 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 00:26:20,739 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 00:26:20,740 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-17 00:26:20,740 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-17 00:26:20,740 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-17 00:26:20,740 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 00:26:20,740 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 00:26:20,740 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 00:26:20,741 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 00:26:20,741 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 00:26:20,741 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 00:26:20,741 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 00:26:20,741 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 00:26:20,741 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 00:26:20,742 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 00:26:20,742 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 00:26:20,742 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-17 00:26:20,742 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-17 00:26:20,742 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 00:26:20,743 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 00:26:20,743 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 00:26:20,743 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 00:26:20,743 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-17 00:26:20,743 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 -> 6c8d330fcf7e017e6b51632eb7a9f8f167fb4f3e932700b6ef82da7b1572a2f0 [2021-12-17 00:26:21,039 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 00:26:21,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 00:26:21,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 00:26:21,067 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 00:26:21,068 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 00:26:21,070 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/max-3-n-u.c [2021-12-17 00:26:21,135 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95761fc8a/752b7900c6e74773b110380a9c42ce24/FLAGeebf183bd [2021-12-17 00:26:21,474 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 00:26:21,474 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/max-3-n-u.c [2021-12-17 00:26:21,483 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95761fc8a/752b7900c6e74773b110380a9c42ce24/FLAGeebf183bd [2021-12-17 00:26:21,922 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95761fc8a/752b7900c6e74773b110380a9c42ce24 [2021-12-17 00:26:21,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 00:26:21,924 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 00:26:21,925 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 00:26:21,925 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 00:26:21,928 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 00:26:21,928 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 12:26:21" (1/1) ... [2021-12-17 00:26:21,930 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@610c20a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:26:21, skipping insertion in model container [2021-12-17 00:26:21,930 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 12:26:21" (1/1) ... [2021-12-17 00:26:21,937 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 00:26:21,950 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 00:26:22,034 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/max-3-n-u.c[321,334] [2021-12-17 00:26:22,049 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 00:26:22,057 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 00:26:22,114 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/max-3-n-u.c[321,334] [2021-12-17 00:26:22,134 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 00:26:22,145 INFO L208 MainTranslator]: Completed translation [2021-12-17 00:26:22,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:26:22 WrapperNode [2021-12-17 00:26:22,146 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 00:26:22,147 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 00:26:22,147 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 00:26:22,147 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 00:26:22,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:26:22" (1/1) ... [2021-12-17 00:26:22,162 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:26:22" (1/1) ... [2021-12-17 00:26:22,180 INFO L137 Inliner]: procedures = 16, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 108 [2021-12-17 00:26:22,180 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 00:26:22,181 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 00:26:22,181 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 00:26:22,181 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 00:26:22,186 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:26:22" (1/1) ... [2021-12-17 00:26:22,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:26:22" (1/1) ... [2021-12-17 00:26:22,190 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:26:22" (1/1) ... [2021-12-17 00:26:22,190 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:26:22" (1/1) ... [2021-12-17 00:26:22,203 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:26:22" (1/1) ... [2021-12-17 00:26:22,209 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:26:22" (1/1) ... [2021-12-17 00:26:22,213 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:26:22" (1/1) ... [2021-12-17 00:26:22,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 00:26:22,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 00:26:22,218 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 00:26:22,218 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 00:26:22,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:26:22" (1/1) ... [2021-12-17 00:26:22,223 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 00:26:22,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 00:26:22,254 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) [2021-12-17 00:26:22,288 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 [2021-12-17 00:26:22,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 00:26:22,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-17 00:26:22,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 00:26:22,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-17 00:26:22,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 00:26:22,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 00:26:22,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 00:26:22,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-17 00:26:22,360 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 00:26:22,361 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 00:26:22,642 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 00:26:22,646 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 00:26:22,646 INFO L301 CfgBuilder]: Removed 9 assume(true) statements. [2021-12-17 00:26:22,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 12:26:22 BoogieIcfgContainer [2021-12-17 00:26:22,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 00:26:22,649 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 00:26:22,649 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 00:26:22,651 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 00:26:22,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 12:26:21" (1/3) ... [2021-12-17 00:26:22,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b958d98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 12:26:22, skipping insertion in model container [2021-12-17 00:26:22,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:26:22" (2/3) ... [2021-12-17 00:26:22,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b958d98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 12:26:22, skipping insertion in model container [2021-12-17 00:26:22,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 12:26:22" (3/3) ... [2021-12-17 00:26:22,653 INFO L111 eAbstractionObserver]: Analyzing ICFG max-3-n-u.c [2021-12-17 00:26:22,656 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 00:26:22,656 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 00:26:22,690 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 00:26:22,695 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 00:26:22,696 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 00:26:22,712 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:26:22,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-17 00:26:22,716 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 00:26:22,716 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 00:26:22,716 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 00:26:22,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 00:26:22,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1361272673, now seen corresponding path program 1 times [2021-12-17 00:26:22,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 00:26:22,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1008950634] [2021-12-17 00:26:22,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 00:26:22,730 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 00:26:22,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 00:26:22,732 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) [2021-12-17 00:26:22,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-17 00:26:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 00:26:22,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-17 00:26:22,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 00:26:22,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 00:26:22,826 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 00:26:22,827 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 00:26:22,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1008950634] [2021-12-17 00:26:22,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1008950634] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 00:26:22,827 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 00:26:22,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 00:26:22,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337935458] [2021-12-17 00:26:22,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 00:26:22,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 00:26:22,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 00:26:22,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 00:26:22,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 00:26:22,850 INFO L87 Difference]: Start difference. First operand has 29 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:26:22,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 00:26:22,878 INFO L93 Difference]: Finished difference Result 56 states and 94 transitions. [2021-12-17 00:26:22,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 00:26:22,880 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-17 00:26:22,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 00:26:22,884 INFO L225 Difference]: With dead ends: 56 [2021-12-17 00:26:22,884 INFO L226 Difference]: Without dead ends: 25 [2021-12-17 00:26:22,886 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 00:26:22,889 INFO L933 BasicCegarLoop]: 38 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, 38 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 [2021-12-17 00:26:22,889 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 00:26:22,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-17 00:26:22,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-12-17 00:26:22,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:26:22,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2021-12-17 00:26:22,916 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 11 [2021-12-17 00:26:22,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 00:26:22,916 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2021-12-17 00:26:22,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:26:22,917 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2021-12-17 00:26:22,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-17 00:26:22,917 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 00:26:22,917 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 00:26:22,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-17 00:26:23,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 00:26:23,127 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 00:26:23,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 00:26:23,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1322753665, now seen corresponding path program 1 times [2021-12-17 00:26:23,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 00:26:23,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [981658521] [2021-12-17 00:26:23,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 00:26:23,131 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 00:26:23,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 00:26:23,132 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) [2021-12-17 00:26:23,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-17 00:26:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 00:26:23,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 00:26:23,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 00:26:23,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 00:26:23,238 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 00:26:23,238 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 00:26:23,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [981658521] [2021-12-17 00:26:23,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [981658521] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 00:26:23,238 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 00:26:23,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 00:26:23,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106633226] [2021-12-17 00:26:23,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 00:26:23,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 00:26:23,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 00:26:23,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 00:26:23,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 00:26:23,243 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:26:23,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 00:26:23,436 INFO L93 Difference]: Finished difference Result 48 states and 66 transitions. [2021-12-17 00:26:23,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 00:26:23,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-17 00:26:23,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 00:26:23,443 INFO L225 Difference]: With dead ends: 48 [2021-12-17 00:26:23,443 INFO L226 Difference]: Without dead ends: 30 [2021-12-17 00:26:23,444 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 00:26:23,444 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 6 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 00:26:23,445 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 50 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 00:26:23,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-17 00:26:23,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2021-12-17 00:26:23,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.4) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:26:23,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2021-12-17 00:26:23,449 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 11 [2021-12-17 00:26:23,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 00:26:23,449 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2021-12-17 00:26:23,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:26:23,449 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2021-12-17 00:26:23,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-17 00:26:23,449 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 00:26:23,450 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 00:26:23,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-17 00:26:23,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 00:26:23,659 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 00:26:23,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 00:26:23,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1329032119, now seen corresponding path program 1 times [2021-12-17 00:26:23,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 00:26:23,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1579409078] [2021-12-17 00:26:23,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 00:26:23,660 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 00:26:23,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 00:26:23,661 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) [2021-12-17 00:26:23,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-17 00:26:23,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 00:26:23,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 00:26:23,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 00:26:23,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 00:26:23,765 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 00:26:23,765 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 00:26:23,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1579409078] [2021-12-17 00:26:23,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1579409078] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 00:26:23,765 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 00:26:23,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 00:26:23,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881562925] [2021-12-17 00:26:23,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 00:26:23,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 00:26:23,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 00:26:23,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 00:26:23,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-17 00:26:23,767 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:26:24,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 00:26:24,123 INFO L93 Difference]: Finished difference Result 67 states and 93 transitions. [2021-12-17 00:26:24,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 00:26:24,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-17 00:26:24,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 00:26:24,139 INFO L225 Difference]: With dead ends: 67 [2021-12-17 00:26:24,139 INFO L226 Difference]: Without dead ends: 44 [2021-12-17 00:26:24,139 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-17 00:26:24,140 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 70 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 00:26:24,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 36 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 00:26:24,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-12-17 00:26:24,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 29. [2021-12-17 00:26:24,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:26:24,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2021-12-17 00:26:24,146 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 14 [2021-12-17 00:26:24,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 00:26:24,146 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2021-12-17 00:26:24,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:26:24,146 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2021-12-17 00:26:24,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-17 00:26:24,147 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 00:26:24,147 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 00:26:24,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-12-17 00:26:24,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 00:26:24,355 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 00:26:24,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 00:26:24,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1416884703, now seen corresponding path program 1 times [2021-12-17 00:26:24,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 00:26:24,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037806552] [2021-12-17 00:26:24,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 00:26:24,357 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 00:26:24,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 00:26:24,358 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) [2021-12-17 00:26:24,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-17 00:26:24,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 00:26:24,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 00:26:24,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 00:26:24,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 00:26:24,460 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 00:26:24,460 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 00:26:24,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1037806552] [2021-12-17 00:26:24,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1037806552] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 00:26:24,460 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 00:26:24,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 00:26:24,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269977906] [2021-12-17 00:26:24,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 00:26:24,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 00:26:24,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 00:26:24,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 00:26:24,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-17 00:26:24,462 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:26:24,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 00:26:24,707 INFO L93 Difference]: Finished difference Result 67 states and 90 transitions. [2021-12-17 00:26:24,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 00:26:24,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-17 00:26:24,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 00:26:24,708 INFO L225 Difference]: With dead ends: 67 [2021-12-17 00:26:24,708 INFO L226 Difference]: Without dead ends: 41 [2021-12-17 00:26:24,708 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-17 00:26:24,709 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 34 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 00:26:24,709 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 42 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 00:26:24,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-12-17 00:26:24,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2021-12-17 00:26:24,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:26:24,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2021-12-17 00:26:24,714 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 17 [2021-12-17 00:26:24,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 00:26:24,714 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2021-12-17 00:26:24,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:26:24,715 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2021-12-17 00:26:24,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-17 00:26:24,715 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 00:26:24,715 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 00:26:24,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-12-17 00:26:24,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 00:26:24,922 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 00:26:24,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 00:26:24,922 INFO L85 PathProgramCache]: Analyzing trace with hash 109301050, now seen corresponding path program 1 times [2021-12-17 00:26:24,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 00:26:24,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1827090241] [2021-12-17 00:26:24,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 00:26:24,923 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 00:26:24,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 00:26:24,928 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) [2021-12-17 00:26:24,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-17 00:26:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 00:26:24,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-17 00:26:24,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 00:26:25,027 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 00:26:25,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 00:26:25,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 00:26:25,091 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 00:26:25,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1827090241] [2021-12-17 00:26:25,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1827090241] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 00:26:25,092 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 00:26:25,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-12-17 00:26:25,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648042709] [2021-12-17 00:26:25,092 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 00:26:25,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 00:26:25,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 00:26:25,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 00:26:25,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-17 00:26:25,093 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:26:25,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 00:26:25,560 INFO L93 Difference]: Finished difference Result 91 states and 122 transitions. [2021-12-17 00:26:25,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 00:26:25,560 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-17 00:26:25,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 00:26:25,561 INFO L225 Difference]: With dead ends: 91 [2021-12-17 00:26:25,561 INFO L226 Difference]: Without dead ends: 62 [2021-12-17 00:26:25,561 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-12-17 00:26:25,562 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 110 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 00:26:25,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 68 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 00:26:25,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-12-17 00:26:25,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2021-12-17 00:26:25,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:26:25,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2021-12-17 00:26:25,568 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 18 [2021-12-17 00:26:25,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 00:26:25,568 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2021-12-17 00:26:25,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:26:25,568 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2021-12-17 00:26:25,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-17 00:26:25,569 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 00:26:25,569 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 00:26:25,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-17 00:26:25,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 00:26:25,776 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 00:26:25,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 00:26:25,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1195208863, now seen corresponding path program 2 times [2021-12-17 00:26:25,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 00:26:25,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [81149060] [2021-12-17 00:26:25,777 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 00:26:25,777 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 00:26:25,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 00:26:25,778 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) [2021-12-17 00:26:25,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-17 00:26:25,817 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-17 00:26:25,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 00:26:25,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 00:26:25,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 00:26:25,875 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-17 00:26:25,875 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 00:26:25,875 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 00:26:25,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [81149060] [2021-12-17 00:26:25,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [81149060] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 00:26:25,876 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 00:26:25,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 00:26:25,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440085407] [2021-12-17 00:26:25,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 00:26:25,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 00:26:25,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 00:26:25,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 00:26:25,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-17 00:26:25,877 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:26:26,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 00:26:26,191 INFO L93 Difference]: Finished difference Result 121 states and 155 transitions. [2021-12-17 00:26:26,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 00:26:26,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-17 00:26:26,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 00:26:26,199 INFO L225 Difference]: With dead ends: 121 [2021-12-17 00:26:26,199 INFO L226 Difference]: Without dead ends: 100 [2021-12-17 00:26:26,200 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-17 00:26:26,200 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 68 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 00:26:26,200 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 41 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 00:26:26,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-17 00:26:26,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 54. [2021-12-17 00:26:26,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 53 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:26:26,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2021-12-17 00:26:26,208 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 21 [2021-12-17 00:26:26,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 00:26:26,208 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2021-12-17 00:26:26,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:26:26,208 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2021-12-17 00:26:26,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-17 00:26:26,208 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 00:26:26,209 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 00:26:26,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-17 00:26:26,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 00:26:26,409 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 00:26:26,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 00:26:26,410 INFO L85 PathProgramCache]: Analyzing trace with hash 238928719, now seen corresponding path program 1 times [2021-12-17 00:26:26,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 00:26:26,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1483969960] [2021-12-17 00:26:26,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 00:26:26,410 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 00:26:26,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 00:26:26,411 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) [2021-12-17 00:26:26,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-17 00:26:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 00:26:26,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-17 00:26:26,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 00:26:26,612 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-17 00:26:26,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 00:26:26,806 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-17 00:26:26,807 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 00:26:26,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1483969960] [2021-12-17 00:26:26,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1483969960] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 00:26:26,807 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 00:26:26,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-12-17 00:26:26,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831731762] [2021-12-17 00:26:26,807 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 00:26:26,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-17 00:26:26,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 00:26:26,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-17 00:26:26,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-12-17 00:26:26,808 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:26:28,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 00:26:28,546 INFO L93 Difference]: Finished difference Result 166 states and 217 transitions. [2021-12-17 00:26:28,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 00:26:28,547 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-12-17 00:26:28,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 00:26:28,547 INFO L225 Difference]: With dead ends: 166 [2021-12-17 00:26:28,547 INFO L226 Difference]: Without dead ends: 115 [2021-12-17 00:26:28,548 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2021-12-17 00:26:28,548 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 363 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-12-17 00:26:28,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [363 Valid, 198 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-12-17 00:26:28,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-12-17 00:26:28,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 96. [2021-12-17 00:26:28,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.2947368421052632) internal successors, (123), 95 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:26:28,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 123 transitions. [2021-12-17 00:26:28,561 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 123 transitions. Word has length 39 [2021-12-17 00:26:28,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 00:26:28,561 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 123 transitions. [2021-12-17 00:26:28,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:26:28,561 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 123 transitions. [2021-12-17 00:26:28,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-17 00:26:28,562 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 00:26:28,562 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 00:26:28,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-17 00:26:28,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 00:26:28,772 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 00:26:28,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 00:26:28,772 INFO L85 PathProgramCache]: Analyzing trace with hash 66224111, now seen corresponding path program 2 times [2021-12-17 00:26:28,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 00:26:28,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1672510376] [2021-12-17 00:26:28,773 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 00:26:28,773 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 00:26:28,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 00:26:28,775 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) [2021-12-17 00:26:28,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-17 00:26:28,963 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 00:26:28,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 00:26:28,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-17 00:26:28,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 00:26:29,217 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 2 proven. 55 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2021-12-17 00:26:29,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 00:26:29,780 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 2 proven. 55 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2021-12-17 00:26:29,780 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 00:26:29,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1672510376] [2021-12-17 00:26:29,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1672510376] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 00:26:29,780 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 00:26:29,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2021-12-17 00:26:29,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91593168] [2021-12-17 00:26:29,780 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 00:26:29,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-17 00:26:29,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 00:26:29,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-17 00:26:29,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2021-12-17 00:26:29,782 INFO L87 Difference]: Start difference. First operand 96 states and 123 transitions. Second operand has 26 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:26:34,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 00:26:34,965 INFO L93 Difference]: Finished difference Result 316 states and 409 transitions. [2021-12-17 00:26:34,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-17 00:26:34,965 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-12-17 00:26:34,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 00:26:34,967 INFO L225 Difference]: With dead ends: 316 [2021-12-17 00:26:34,967 INFO L226 Difference]: Without dead ends: 223 [2021-12-17 00:26:34,968 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=479, Invalid=853, Unknown=0, NotChecked=0, Total=1332 [2021-12-17 00:26:34,968 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 1416 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 544 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1416 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 1462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 544 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2021-12-17 00:26:34,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1416 Valid, 678 Invalid, 1462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [544 Valid, 918 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2021-12-17 00:26:34,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-12-17 00:26:34,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 180. [2021-12-17 00:26:34,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 1.2905027932960893) internal successors, (231), 179 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:26:34,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 231 transitions. [2021-12-17 00:26:34,986 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 231 transitions. Word has length 63 [2021-12-17 00:26:34,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 00:26:34,986 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 231 transitions. [2021-12-17 00:26:34,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:26:34,986 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 231 transitions. [2021-12-17 00:26:34,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-12-17 00:26:34,988 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 00:26:34,989 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 00:26:35,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-17 00:26:35,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 00:26:35,200 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 00:26:35,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 00:26:35,200 INFO L85 PathProgramCache]: Analyzing trace with hash 811802927, now seen corresponding path program 3 times [2021-12-17 00:26:35,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 00:26:35,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [478967649] [2021-12-17 00:26:35,201 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 00:26:35,201 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 00:26:35,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 00:26:35,202 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) [2021-12-17 00:26:35,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-17 00:26:35,280 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-17 00:26:35,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 00:26:35,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-17 00:26:35,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 00:26:35,682 INFO L134 CoverageAnalysis]: Checked inductivity of 972 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 971 trivial. 0 not checked. [2021-12-17 00:26:35,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 00:26:35,981 INFO L134 CoverageAnalysis]: Checked inductivity of 972 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 971 trivial. 0 not checked. [2021-12-17 00:26:35,982 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 00:26:35,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [478967649] [2021-12-17 00:26:35,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [478967649] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 00:26:35,982 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 00:26:35,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-12-17 00:26:35,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081425241] [2021-12-17 00:26:35,982 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 00:26:35,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 00:26:35,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 00:26:35,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 00:26:35,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-17 00:26:35,983 INFO L87 Difference]: Start difference. First operand 180 states and 231 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:26:36,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 00:26:36,563 INFO L93 Difference]: Finished difference Result 852 states and 1104 transitions. [2021-12-17 00:26:36,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 00:26:36,563 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2021-12-17 00:26:36,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 00:26:36,566 INFO L225 Difference]: With dead ends: 852 [2021-12-17 00:26:36,566 INFO L226 Difference]: Without dead ends: 703 [2021-12-17 00:26:36,566 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-12-17 00:26:36,567 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 267 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-17 00:26:36,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 97 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-17 00:26:36,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2021-12-17 00:26:36,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 480. [2021-12-17 00:26:36,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 479 states have (on average 1.2713987473903967) internal successors, (609), 479 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:26:36,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 609 transitions. [2021-12-17 00:26:36,603 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 609 transitions. Word has length 111 [2021-12-17 00:26:36,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 00:26:36,603 INFO L470 AbstractCegarLoop]: Abstraction has 480 states and 609 transitions. [2021-12-17 00:26:36,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:26:36,603 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 609 transitions. [2021-12-17 00:26:36,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2021-12-17 00:26:36,612 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 00:26:36,612 INFO L514 BasicCegarLoop]: trace histogram [88, 88, 88, 88, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 00:26:36,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-17 00:26:36,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 00:26:36,819 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 00:26:36,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 00:26:36,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1613933369, now seen corresponding path program 4 times [2021-12-17 00:26:36,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 00:26:36,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [413477556] [2021-12-17 00:26:36,820 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 00:26:36,821 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 00:26:36,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 00:26:36,822 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 00:26:36,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-17 00:26:37,365 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 00:26:37,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 00:26:37,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 1000 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-17 00:26:37,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 00:26:38,285 INFO L134 CoverageAnalysis]: Checked inductivity of 16128 backedges. 1598 proven. 253 refuted. 0 times theorem prover too weak. 14277 trivial. 0 not checked. [2021-12-17 00:26:38,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 00:26:40,379 INFO L134 CoverageAnalysis]: Checked inductivity of 16128 backedges. 1598 proven. 253 refuted. 0 times theorem prover too weak. 14277 trivial. 0 not checked. [2021-12-17 00:26:40,379 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 00:26:40,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [413477556] [2021-12-17 00:26:40,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [413477556] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 00:26:40,379 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 00:26:40,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2021-12-17 00:26:40,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752797839] [2021-12-17 00:26:40,380 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 00:26:40,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-12-17 00:26:40,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 00:26:40,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-12-17 00:26:40,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=1777, Unknown=0, NotChecked=0, Total=2450 [2021-12-17 00:26:40,381 INFO L87 Difference]: Start difference. First operand 480 states and 609 transitions. Second operand has 50 states, 50 states have (on average 1.56) internal successors, (78), 50 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:26:58,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 00:26:58,512 INFO L93 Difference]: Finished difference Result 1503 states and 2052 transitions. [2021-12-17 00:26:58,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-12-17 00:26:58,512 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.56) internal successors, (78), 50 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 411 [2021-12-17 00:26:58,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 00:26:58,515 INFO L225 Difference]: With dead ends: 1503 [2021-12-17 00:26:58,515 INFO L226 Difference]: Without dead ends: 1027 [2021-12-17 00:26:58,518 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 843 GetRequests, 772 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=1823, Invalid=3433, Unknown=0, NotChecked=0, Total=5256 [2021-12-17 00:26:58,518 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 4502 mSDsluCounter, 2402 mSDsCounter, 0 mSdLazyCounter, 3585 mSolverCounterSat, 1683 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4502 SdHoareTripleChecker+Valid, 2515 SdHoareTripleChecker+Invalid, 5268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1683 IncrementalHoareTripleChecker+Valid, 3585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2021-12-17 00:26:58,519 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4502 Valid, 2515 Invalid, 5268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1683 Valid, 3585 Invalid, 0 Unknown, 0 Unchecked, 12.7s Time] [2021-12-17 00:26:58,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2021-12-17 00:26:58,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 936. [2021-12-17 00:26:58,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 935 states have (on average 1.267379679144385) internal successors, (1185), 935 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:26:58,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1185 transitions. [2021-12-17 00:26:58,565 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1185 transitions. Word has length 411 [2021-12-17 00:26:58,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 00:26:58,565 INFO L470 AbstractCegarLoop]: Abstraction has 936 states and 1185 transitions. [2021-12-17 00:26:58,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.56) internal successors, (78), 50 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:26:58,565 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1185 transitions. [2021-12-17 00:26:58,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2021-12-17 00:26:58,580 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 00:26:58,580 INFO L514 BasicCegarLoop]: trace histogram [184, 184, 184, 184, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 00:26:58,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-17 00:26:58,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 00:26:58,795 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 00:26:58,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 00:26:58,796 INFO L85 PathProgramCache]: Analyzing trace with hash 788549945, now seen corresponding path program 5 times [2021-12-17 00:26:58,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 00:26:58,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689249851] [2021-12-17 00:26:58,797 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-17 00:26:58,797 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 00:26:58,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 00:26:58,799 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 00:26:58,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-17 00:30:52,517 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 189 check-sat command(s) [2021-12-17 00:30:52,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 00:30:52,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 1960 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-17 00:30:52,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 00:30:54,272 INFO L134 CoverageAnalysis]: Checked inductivity of 68928 backedges. 32239 proven. 1 refuted. 0 times theorem prover too weak. 36688 trivial. 0 not checked. [2021-12-17 00:30:54,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 00:30:56,281 INFO L134 CoverageAnalysis]: Checked inductivity of 68928 backedges. 25793 proven. 6447 refuted. 0 times theorem prover too weak. 36688 trivial. 0 not checked. [2021-12-17 00:30:56,282 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 00:30:56,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [689249851] [2021-12-17 00:30:56,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [689249851] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 00:30:56,282 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 00:30:56,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2021-12-17 00:30:56,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402133068] [2021-12-17 00:30:56,283 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 00:30:56,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 00:30:56,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 00:30:56,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 00:30:56,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-17 00:30:56,284 INFO L87 Difference]: Start difference. First operand 936 states and 1185 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:30:56,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 00:30:56,949 INFO L93 Difference]: Finished difference Result 4529 states and 5766 transitions. [2021-12-17 00:30:56,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 00:30:56,950 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 795 [2021-12-17 00:30:56,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 00:30:56,959 INFO L225 Difference]: With dead ends: 4529 [2021-12-17 00:30:56,959 INFO L226 Difference]: Without dead ends: 3646 [2021-12-17 00:30:56,961 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1591 GetRequests, 1581 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2021-12-17 00:30:56,962 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 211 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-17 00:30:56,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 80 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-17 00:30:56,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3646 states. [2021-12-17 00:30:57,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3646 to 3639. [2021-12-17 00:30:57,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3639 states, 3638 states have (on average 1.265805387575591) internal successors, (4605), 3638 states have internal predecessors, (4605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:30:57,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3639 states to 3639 states and 4605 transitions. [2021-12-17 00:30:57,129 INFO L78 Accepts]: Start accepts. Automaton has 3639 states and 4605 transitions. Word has length 795 [2021-12-17 00:30:57,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 00:30:57,130 INFO L470 AbstractCegarLoop]: Abstraction has 3639 states and 4605 transitions. [2021-12-17 00:30:57,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:30:57,130 INFO L276 IsEmpty]: Start isEmpty. Operand 3639 states and 4605 transitions. [2021-12-17 00:30:57,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3076 [2021-12-17 00:30:57,228 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 00:30:57,229 INFO L514 BasicCegarLoop]: trace histogram [736, 736, 736, 736, 16, 16, 16, 16, 16, 16, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 00:30:57,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2021-12-17 00:30:57,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 00:30:57,451 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 00:30:57,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 00:30:57,452 INFO L85 PathProgramCache]: Analyzing trace with hash -985540095, now seen corresponding path program 6 times [2021-12-17 00:30:57,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 00:30:57,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [212302047] [2021-12-17 00:30:57,458 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-17 00:30:57,458 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 00:30:57,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 00:30:57,459 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 00:30:57,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-17 00:30:58,529 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2021-12-17 00:30:58,529 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 00:30:58,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-17 00:30:58,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 00:31:04,273 INFO L388 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 [2021-12-17 00:31:06,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1106364 backedges. 1509 proven. 0 refuted. 0 times theorem prover too weak. 1104855 trivial. 0 not checked. [2021-12-17 00:31:06,960 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 00:31:06,960 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 00:31:06,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [212302047] [2021-12-17 00:31:06,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [212302047] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 00:31:06,961 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 00:31:06,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 00:31:06,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234140077] [2021-12-17 00:31:06,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 00:31:06,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 00:31:06,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 00:31:06,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 00:31:06,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-17 00:31:06,964 INFO L87 Difference]: Start difference. First operand 3639 states and 4605 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:31:07,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 00:31:07,457 INFO L93 Difference]: Finished difference Result 7034 states and 9131 transitions. [2021-12-17 00:31:07,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 00:31:07,458 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3075 [2021-12-17 00:31:07,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 00:31:07,472 INFO L225 Difference]: With dead ends: 7034 [2021-12-17 00:31:07,472 INFO L226 Difference]: Without dead ends: 4199 [2021-12-17 00:31:07,476 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3075 GetRequests, 3069 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-12-17 00:31:07,477 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 40 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 00:31:07,478 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 43 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 00:31:07,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4199 states. [2021-12-17 00:31:07,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4199 to 3639. [2021-12-17 00:31:07,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3639 states, 3638 states have (on average 1.2655305112699284) internal successors, (4604), 3638 states have internal predecessors, (4604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:31:07,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3639 states to 3639 states and 4604 transitions. [2021-12-17 00:31:07,642 INFO L78 Accepts]: Start accepts. Automaton has 3639 states and 4604 transitions. Word has length 3075 [2021-12-17 00:31:07,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 00:31:07,644 INFO L470 AbstractCegarLoop]: Abstraction has 3639 states and 4604 transitions. [2021-12-17 00:31:07,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:31:07,644 INFO L276 IsEmpty]: Start isEmpty. Operand 3639 states and 4604 transitions. [2021-12-17 00:31:07,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3076 [2021-12-17 00:31:07,706 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 00:31:07,707 INFO L514 BasicCegarLoop]: trace histogram [736, 736, 736, 735, 16, 16, 16, 16, 16, 16, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 00:31:07,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-17 00:31:07,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 00:31:07,920 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 00:31:07,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 00:31:07,920 INFO L85 PathProgramCache]: Analyzing trace with hash -227702337, now seen corresponding path program 1 times [2021-12-17 00:31:07,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 00:31:07,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2109132797] [2021-12-17 00:31:07,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 00:31:07,925 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 00:31:07,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 00:31:07,932 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 00:31:07,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-17 00:31:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 00:31:12,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 7575 conjuncts, 49 conjunts are in the unsatisfiable core [2021-12-17 00:31:12,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 00:31:17,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1106364 backedges. 33158 proven. 1081 refuted. 0 times theorem prover too weak. 1072125 trivial. 0 not checked. [2021-12-17 00:31:17,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 00:31:25,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1106364 backedges. 33158 proven. 1081 refuted. 0 times theorem prover too weak. 1072125 trivial. 0 not checked. [2021-12-17 00:31:25,426 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 00:31:25,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2109132797] [2021-12-17 00:31:25,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2109132797] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 00:31:25,426 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 00:31:25,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 98 [2021-12-17 00:31:25,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145393087] [2021-12-17 00:31:25,427 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 00:31:25,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2021-12-17 00:31:25,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 00:31:25,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2021-12-17 00:31:25,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2497, Invalid=7009, Unknown=0, NotChecked=0, Total=9506 [2021-12-17 00:31:25,433 INFO L87 Difference]: Start difference. First operand 3639 states and 4604 transitions. Second operand has 98 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 98 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:32:50,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 00:32:50,049 INFO L93 Difference]: Finished difference Result 11062 states and 15586 transitions. [2021-12-17 00:32:50,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2021-12-17 00:32:50,050 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 98 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3075 [2021-12-17 00:32:50,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 00:32:50,068 INFO L225 Difference]: With dead ends: 11062 [2021-12-17 00:32:50,068 INFO L226 Difference]: Without dead ends: 7474 [2021-12-17 00:32:50,076 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6195 GetRequests, 6052 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3384 ImplicationChecksByTransitivity, 48.4s TimeCoverageRelationStatistics Valid=7103, Invalid=13777, Unknown=0, NotChecked=0, Total=20880 [2021-12-17 00:32:50,078 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 14955 mSDsluCounter, 9410 mSDsCounter, 0 mSdLazyCounter, 14097 mSolverCounterSat, 4713 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14955 SdHoareTripleChecker+Valid, 9619 SdHoareTripleChecker+Invalid, 18810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4713 IncrementalHoareTripleChecker+Valid, 14097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.9s IncrementalHoareTripleChecker+Time [2021-12-17 00:32:50,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14955 Valid, 9619 Invalid, 18810 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4713 Valid, 14097 Invalid, 0 Unknown, 0 Unchecked, 40.9s Time] [2021-12-17 00:32:50,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7474 states. [2021-12-17 00:32:50,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7474 to 7287. [2021-12-17 00:32:50,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7287 states, 7286 states have (on average 1.2643425748009882) internal successors, (9212), 7286 states have internal predecessors, (9212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:32:50,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7287 states to 7287 states and 9212 transitions. [2021-12-17 00:32:50,448 INFO L78 Accepts]: Start accepts. Automaton has 7287 states and 9212 transitions. Word has length 3075 [2021-12-17 00:32:50,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 00:32:50,449 INFO L470 AbstractCegarLoop]: Abstraction has 7287 states and 9212 transitions. [2021-12-17 00:32:50,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 98 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 00:32:50,449 INFO L276 IsEmpty]: Start isEmpty. Operand 7287 states and 9212 transitions. [2021-12-17 00:32:50,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6148 [2021-12-17 00:32:50,644 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 00:32:50,646 INFO L514 BasicCegarLoop]: trace histogram [1504, 1504, 1504, 1503, 16, 16, 16, 16, 16, 16, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 00:32:50,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-17 00:32:50,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 00:32:50,871 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 00:32:50,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 00:32:50,873 INFO L85 PathProgramCache]: Analyzing trace with hash -402658881, now seen corresponding path program 2 times [2021-12-17 00:32:50,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 00:32:50,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388773323] [2021-12-17 00:32:50,883 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 00:32:50,883 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 00:32:50,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 00:32:50,885 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 00:32:50,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-17 00:33:01,391 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 00:33:01,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 00:33:02,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 15255 conjuncts, 97 conjunts are in the unsatisfiable core [2021-12-17 00:33:02,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 00:33:11,399 INFO L134 CoverageAnalysis]: Checked inductivity of 4570044 backedges. 135398 proven. 4465 refuted. 0 times theorem prover too weak. 4430181 trivial. 0 not checked. [2021-12-17 00:33:11,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 00:33:33,989 INFO L134 CoverageAnalysis]: Checked inductivity of 4570044 backedges. 135398 proven. 4465 refuted. 0 times theorem prover too weak. 4430181 trivial. 0 not checked. [2021-12-17 00:33:33,990 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 00:33:33,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [388773323] [2021-12-17 00:33:33,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [388773323] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 00:33:33,990 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 00:33:33,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 194 [2021-12-17 00:33:33,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844065803] [2021-12-17 00:33:33,992 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 00:33:33,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 194 states [2021-12-17 00:33:33,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 00:33:33,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2021-12-17 00:33:34,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9601, Invalid=27841, Unknown=0, NotChecked=0, Total=37442 [2021-12-17 00:33:34,003 INFO L87 Difference]: Start difference. First operand 7287 states and 9212 transitions. Second operand has 194 states, 194 states have (on average 1.1494845360824741) internal successors, (223), 194 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Killed by 15