./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3a877d22 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4f3d269e2deae26c7ce036912e3874a49494c634991dfc4135fd1a54005e7fac --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 14:07:33,825 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 14:07:33,848 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 14:07:33,879 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 14:07:33,880 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 14:07:33,883 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 14:07:33,884 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 14:07:33,886 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 14:07:33,888 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 14:07:33,891 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 14:07:33,891 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 14:07:33,892 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 14:07:33,892 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 14:07:33,894 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 14:07:33,896 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 14:07:33,898 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 14:07:33,899 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 14:07:33,900 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 14:07:33,902 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 14:07:33,908 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 14:07:33,910 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 14:07:33,911 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 14:07:33,912 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 14:07:33,913 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 14:07:33,919 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 14:07:33,919 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 14:07:33,920 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 14:07:33,921 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 14:07:33,921 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 14:07:33,922 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 14:07:33,922 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 14:07:33,923 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 14:07:33,924 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 14:07:33,925 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 14:07:33,926 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 14:07:33,926 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 14:07:33,927 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 14:07:33,927 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 14:07:33,927 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 14:07:33,928 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 14:07:33,929 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 14:07:33,930 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-15 14:07:33,953 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 14:07:33,963 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 14:07:33,964 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 14:07:33,964 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 14:07:33,965 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 14:07:33,965 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 14:07:33,965 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 14:07:33,965 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 14:07:33,966 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 14:07:33,966 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 14:07:33,966 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 14:07:33,966 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 14:07:33,966 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 14:07:33,966 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 14:07:33,967 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 14:07:33,967 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-15 14:07:33,967 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-15 14:07:33,967 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-15 14:07:33,967 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 14:07:33,967 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-15 14:07:33,968 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 14:07:33,968 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 14:07:33,968 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 14:07:33,968 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 14:07:33,968 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 14:07:33,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 14:07:33,969 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 14:07:33,969 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 14:07:33,969 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 14:07:33,969 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 14:07:33,969 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 14:07:33,969 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 4f3d269e2deae26c7ce036912e3874a49494c634991dfc4135fd1a54005e7fac [2021-12-15 14:07:34,168 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 14:07:34,187 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 14:07:34,189 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 14:07:34,190 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 14:07:34,191 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 14:07:34,191 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c [2021-12-15 14:07:34,238 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0effb7325/f37704a9e6344ee2b7868f181890c3cd/FLAG0cee32a08 [2021-12-15 14:07:34,563 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 14:07:34,564 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c [2021-12-15 14:07:34,568 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0effb7325/f37704a9e6344ee2b7868f181890c3cd/FLAG0cee32a08 [2021-12-15 14:07:34,576 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0effb7325/f37704a9e6344ee2b7868f181890c3cd [2021-12-15 14:07:34,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 14:07:34,579 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 14:07:34,580 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 14:07:34,581 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 14:07:34,583 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 14:07:34,583 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 02:07:34" (1/1) ... [2021-12-15 14:07:34,584 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46a2bda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:07:34, skipping insertion in model container [2021-12-15 14:07:34,584 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 02:07:34" (1/1) ... [2021-12-15 14:07:34,589 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 14:07:34,597 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 14:07:34,752 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 14:07:34,763 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 14:07:34,793 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 14:07:34,803 INFO L208 MainTranslator]: Completed translation [2021-12-15 14:07:34,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:07:34 WrapperNode [2021-12-15 14:07:34,804 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 14:07:34,805 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 14:07:34,805 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 14:07:34,806 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 14:07:34,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:07:34" (1/1) ... [2021-12-15 14:07:34,823 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:07:34" (1/1) ... [2021-12-15 14:07:34,845 INFO L137 Inliner]: procedures = 14, calls = 25, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 99 [2021-12-15 14:07:34,846 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 14:07:34,847 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 14:07:34,847 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 14:07:34,847 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 14:07:34,853 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:07:34" (1/1) ... [2021-12-15 14:07:34,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:07:34" (1/1) ... [2021-12-15 14:07:34,858 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:07:34" (1/1) ... [2021-12-15 14:07:34,859 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:07:34" (1/1) ... [2021-12-15 14:07:34,877 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:07:34" (1/1) ... [2021-12-15 14:07:34,881 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:07:34" (1/1) ... [2021-12-15 14:07:34,885 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:07:34" (1/1) ... [2021-12-15 14:07:34,888 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 14:07:34,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 14:07:34,890 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 14:07:34,890 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 14:07:34,891 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:07:34" (1/1) ... [2021-12-15 14:07:34,904 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 14:07:34,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:07:34,926 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-15 14:07:34,944 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-15 14:07:34,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 14:07:34,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 14:07:34,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 14:07:34,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 14:07:34,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 14:07:34,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 14:07:34,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 14:07:34,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 14:07:35,033 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 14:07:35,034 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 14:07:35,242 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 14:07:35,246 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 14:07:35,247 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-15 14:07:35,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 02:07:35 BoogieIcfgContainer [2021-12-15 14:07:35,248 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 14:07:35,249 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 14:07:35,249 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 14:07:35,258 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 14:07:35,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 02:07:34" (1/3) ... [2021-12-15 14:07:35,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c5e6c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 02:07:35, skipping insertion in model container [2021-12-15 14:07:35,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:07:34" (2/3) ... [2021-12-15 14:07:35,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c5e6c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 02:07:35, skipping insertion in model container [2021-12-15 14:07:35,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 02:07:35" (3/3) ... [2021-12-15 14:07:35,268 INFO L111 eAbstractionObserver]: Analyzing ICFG getNumbers4-2.c [2021-12-15 14:07:35,272 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 14:07:35,273 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2021-12-15 14:07:35,301 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 14:07:35,305 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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-15 14:07:35,306 INFO L340 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2021-12-15 14:07:35,315 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 52 states have internal predecessors, (62), 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-15 14:07:35,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-15 14:07:35,319 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:07:35,320 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-15 14:07:35,320 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-15 14:07:35,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:07:35,324 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2021-12-15 14:07:35,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:07:35,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373806359] [2021-12-15 14:07:35,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:35,331 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:07:35,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:35,515 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-15 14:07:35,516 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:07:35,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373806359] [2021-12-15 14:07:35,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373806359] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:07:35,517 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:07:35,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-12-15 14:07:35,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42420402] [2021-12-15 14:07:35,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:07:35,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:07:35,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:07:35,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:07:35,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:07:35,544 INFO L87 Difference]: Start difference. First operand has 53 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 52 states have internal predecessors, (62), 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 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-15 14:07:35,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:07:35,594 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2021-12-15 14:07:35,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:07:35,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2021-12-15 14:07:35,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:07:35,601 INFO L225 Difference]: With dead ends: 52 [2021-12-15 14:07:35,601 INFO L226 Difference]: Without dead ends: 50 [2021-12-15 14:07:35,603 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-15 14:07:35,607 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 27 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:07:35,608 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 58 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:07:35,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-12-15 14:07:35,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2021-12-15 14:07:35,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.588235294117647) internal successors, (54), 49 states have internal predecessors, (54), 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-15 14:07:35,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2021-12-15 14:07:35,634 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 4 [2021-12-15 14:07:35,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:07:35,635 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2021-12-15 14:07:35,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-15 14:07:35,635 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2021-12-15 14:07:35,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-15 14:07:35,635 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:07:35,636 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-15 14:07:35,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 14:07:35,636 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-15 14:07:35,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:07:35,638 INFO L85 PathProgramCache]: Analyzing trace with hash 925766, now seen corresponding path program 1 times [2021-12-15 14:07:35,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:07:35,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261049531] [2021-12-15 14:07:35,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:35,639 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:07:35,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:35,760 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-15 14:07:35,760 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:07:35,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261049531] [2021-12-15 14:07:35,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261049531] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:07:35,761 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:07:35,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:07:35,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150472150] [2021-12-15 14:07:35,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:07:35,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 14:07:35,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:07:35,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 14:07:35,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 14:07:35,763 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-15 14:07:35,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:07:35,814 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2021-12-15 14:07:35,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 14:07:35,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2021-12-15 14:07:35,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:07:35,816 INFO L225 Difference]: With dead ends: 53 [2021-12-15 14:07:35,816 INFO L226 Difference]: Without dead ends: 53 [2021-12-15 14:07:35,818 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-15 14:07:35,818 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 54 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:07:35,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 65 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:07:35,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-12-15 14:07:35,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2021-12-15 14:07:35,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:07:35,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2021-12-15 14:07:35,829 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 4 [2021-12-15 14:07:35,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:07:35,830 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2021-12-15 14:07:35,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-15 14:07:35,830 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2021-12-15 14:07:35,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-15 14:07:35,830 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:07:35,831 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2021-12-15 14:07:35,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 14:07:35,833 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-15 14:07:35,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:07:35,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1809646286, now seen corresponding path program 1 times [2021-12-15 14:07:35,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:07:35,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940490813] [2021-12-15 14:07:35,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:35,835 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:07:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:35,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:07:35,981 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:07:35,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940490813] [2021-12-15 14:07:35,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940490813] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:07:35,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469384619] [2021-12-15 14:07:35,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:35,982 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:07:35,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:07:35,983 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-15 14:07:35,984 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-15 14:07:36,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:36,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-15 14:07:36,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:07:36,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:07:36,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:07:36,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:07:36,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469384619] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:07:36,207 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:07:36,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2021-12-15 14:07:36,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773585156] [2021-12-15 14:07:36,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:07:36,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-15 14:07:36,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:07:36,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-15 14:07:36,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-12-15 14:07:36,211 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:07:36,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:07:36,397 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2021-12-15 14:07:36,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 14:07:36,397 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-15 14:07:36,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:07:36,400 INFO L225 Difference]: With dead ends: 59 [2021-12-15 14:07:36,400 INFO L226 Difference]: Without dead ends: 59 [2021-12-15 14:07:36,401 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2021-12-15 14:07:36,403 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 179 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:07:36,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 126 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:07:36,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-12-15 14:07:36,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-12-15 14:07:36,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 58 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:07:36,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2021-12-15 14:07:36,412 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 7 [2021-12-15 14:07:36,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:07:36,412 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2021-12-15 14:07:36,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:07:36,412 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2021-12-15 14:07:36,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-15 14:07:36,413 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:07:36,413 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:07:36,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-15 14:07:36,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:07:36,630 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-15 14:07:36,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:07:36,630 INFO L85 PathProgramCache]: Analyzing trace with hash -2129139286, now seen corresponding path program 1 times [2021-12-15 14:07:36,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:07:36,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591052948] [2021-12-15 14:07:36,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:36,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:07:36,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:36,735 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-15 14:07:36,736 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:07:36,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591052948] [2021-12-15 14:07:36,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591052948] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:07:36,738 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:07:36,738 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:07:36,738 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695583190] [2021-12-15 14:07:36,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:07:36,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 14:07:36,739 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:07:36,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 14:07:36,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:07:36,740 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-15 14:07:36,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:07:36,824 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2021-12-15 14:07:36,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 14:07:36,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 19 [2021-12-15 14:07:36,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:07:36,825 INFO L225 Difference]: With dead ends: 67 [2021-12-15 14:07:36,825 INFO L226 Difference]: Without dead ends: 67 [2021-12-15 14:07:36,825 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:07:36,826 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 111 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:07:36,826 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 64 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:07:36,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-12-15 14:07:36,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2021-12-15 14:07:36,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.434782608695652) internal successors, (66), 60 states have internal predecessors, (66), 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-15 14:07:36,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2021-12-15 14:07:36,834 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 19 [2021-12-15 14:07:36,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:07:36,835 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2021-12-15 14:07:36,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-15 14:07:36,835 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2021-12-15 14:07:36,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-15 14:07:36,835 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:07:36,835 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:07:36,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-15 14:07:36,836 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-15 14:07:36,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:07:36,836 INFO L85 PathProgramCache]: Analyzing trace with hash -2129139287, now seen corresponding path program 1 times [2021-12-15 14:07:36,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:07:36,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453106969] [2021-12-15 14:07:36,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:36,837 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:07:36,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:36,868 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-15 14:07:36,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:07:36,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453106969] [2021-12-15 14:07:36,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453106969] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:07:36,869 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:07:36,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:07:36,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202034505] [2021-12-15 14:07:36,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:07:36,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 14:07:36,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:07:36,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 14:07:36,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:07:36,871 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-15 14:07:36,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:07:36,911 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2021-12-15 14:07:36,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 14:07:36,912 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 19 [2021-12-15 14:07:36,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:07:36,916 INFO L225 Difference]: With dead ends: 60 [2021-12-15 14:07:36,916 INFO L226 Difference]: Without dead ends: 60 [2021-12-15 14:07:36,917 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:07:36,917 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 63 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:07:36,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 89 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:07:36,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-12-15 14:07:36,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2021-12-15 14:07:36,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 46 states have (on average 1.391304347826087) internal successors, (64), 59 states have internal predecessors, (64), 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-15 14:07:36,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2021-12-15 14:07:36,929 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 19 [2021-12-15 14:07:36,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:07:36,929 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2021-12-15 14:07:36,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-15 14:07:36,930 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2021-12-15 14:07:36,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-15 14:07:36,930 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:07:36,930 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:07:36,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-15 14:07:36,930 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-15 14:07:36,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:07:36,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1578808454, now seen corresponding path program 1 times [2021-12-15 14:07:36,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:07:36,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897943015] [2021-12-15 14:07:36,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:36,931 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:07:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:36,975 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-15 14:07:36,975 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:07:36,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897943015] [2021-12-15 14:07:36,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897943015] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:07:36,976 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:07:36,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-12-15 14:07:36,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845915155] [2021-12-15 14:07:36,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:07:36,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:07:36,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:07:36,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:07:36,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:07:36,977 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 3 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-15 14:07:36,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:07:36,994 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2021-12-15 14:07:36,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:07:36,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 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 20 [2021-12-15 14:07:36,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:07:36,995 INFO L225 Difference]: With dead ends: 59 [2021-12-15 14:07:36,995 INFO L226 Difference]: Without dead ends: 59 [2021-12-15 14:07:36,995 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-15 14:07:36,995 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 17 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:07:36,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 54 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:07:36,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-12-15 14:07:36,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-12-15 14:07:36,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 58 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:07:36,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2021-12-15 14:07:36,998 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 20 [2021-12-15 14:07:36,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:07:36,998 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2021-12-15 14:07:36,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-15 14:07:36,999 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2021-12-15 14:07:36,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-15 14:07:36,999 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:07:36,999 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:07:36,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-15 14:07:36,999 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-15 14:07:37,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:07:37,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1578808453, now seen corresponding path program 1 times [2021-12-15 14:07:37,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:07:37,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914362311] [2021-12-15 14:07:37,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:37,001 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:07:37,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:37,037 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:07:37,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:07:37,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914362311] [2021-12-15 14:07:37,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914362311] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:07:37,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403158826] [2021-12-15 14:07:37,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:37,038 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:07:37,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:07:37,039 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-15 14:07:37,041 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-15 14:07:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:37,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 14:07:37,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:07:37,128 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:07:37,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:07:37,199 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:07:37,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403158826] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:07:37,199 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:07:37,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2021-12-15 14:07:37,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105582326] [2021-12-15 14:07:37,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:07:37,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-15 14:07:37,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:07:37,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-15 14:07:37,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-12-15 14:07:37,201 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 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-15 14:07:37,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:07:37,236 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2021-12-15 14:07:37,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-15 14:07:37,250 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 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 20 [2021-12-15 14:07:37,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:07:37,250 INFO L225 Difference]: With dead ends: 77 [2021-12-15 14:07:37,251 INFO L226 Difference]: Without dead ends: 77 [2021-12-15 14:07:37,251 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-12-15 14:07:37,251 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 20 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:07:37,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 140 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:07:37,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-12-15 14:07:37,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2021-12-15 14:07:37,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 64 states have (on average 1.265625) internal successors, (81), 76 states have internal predecessors, (81), 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-15 14:07:37,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2021-12-15 14:07:37,260 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 20 [2021-12-15 14:07:37,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:07:37,260 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2021-12-15 14:07:37,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 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-15 14:07:37,260 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2021-12-15 14:07:37,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-15 14:07:37,261 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:07:37,261 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:07:37,277 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-15 14:07:37,461 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,SelfDestructingSolverStorable6 [2021-12-15 14:07:37,462 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-15 14:07:37,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:07:37,462 INFO L85 PathProgramCache]: Analyzing trace with hash -708557701, now seen corresponding path program 2 times [2021-12-15 14:07:37,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:07:37,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742976207] [2021-12-15 14:07:37,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:37,463 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:07:37,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:37,539 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-15 14:07:37,539 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:07:37,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742976207] [2021-12-15 14:07:37,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742976207] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:07:37,540 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:07:37,540 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:07:37,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840749269] [2021-12-15 14:07:37,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:07:37,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 14:07:37,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:07:37,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 14:07:37,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 14:07:37,542 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand has 4 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-15 14:07:37,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:07:37,573 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2021-12-15 14:07:37,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 14:07:37,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 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 38 [2021-12-15 14:07:37,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:07:37,574 INFO L225 Difference]: With dead ends: 80 [2021-12-15 14:07:37,574 INFO L226 Difference]: Without dead ends: 80 [2021-12-15 14:07:37,575 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-15 14:07:37,575 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 47 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:07:37,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 60 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:07:37,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-12-15 14:07:37,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2021-12-15 14:07:37,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 77 states have internal predecessors, (82), 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-15 14:07:37,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2021-12-15 14:07:37,580 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 38 [2021-12-15 14:07:37,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:07:37,580 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2021-12-15 14:07:37,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-15 14:07:37,580 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2021-12-15 14:07:37,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-15 14:07:37,581 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:07:37,581 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:07:37,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-15 14:07:37,581 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-15 14:07:37,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:07:37,581 INFO L85 PathProgramCache]: Analyzing trace with hash 414994334, now seen corresponding path program 1 times [2021-12-15 14:07:37,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:07:37,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118458907] [2021-12-15 14:07:37,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:37,582 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:07:37,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:37,678 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-15 14:07:37,679 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:07:37,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118458907] [2021-12-15 14:07:37,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118458907] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:07:37,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750037151] [2021-12-15 14:07:37,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:37,679 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:07:37,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:07:37,680 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-15 14:07:37,684 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-15 14:07:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:37,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-15 14:07:37,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:07:38,005 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-15 14:07:38,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:07:38,260 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-15 14:07:38,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750037151] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:07:38,261 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:07:38,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2021-12-15 14:07:38,261 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43565460] [2021-12-15 14:07:38,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:07:38,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-15 14:07:38,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:07:38,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-15 14:07:38,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-12-15 14:07:38,263 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:07:38,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:07:38,446 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2021-12-15 14:07:38,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 14:07:38,447 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-12-15 14:07:38,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:07:38,449 INFO L225 Difference]: With dead ends: 98 [2021-12-15 14:07:38,449 INFO L226 Difference]: Without dead ends: 98 [2021-12-15 14:07:38,450 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-12-15 14:07:38,451 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 214 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:07:38,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 155 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:07:38,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-12-15 14:07:38,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 92. [2021-12-15 14:07:38,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 91 states have internal predecessors, (100), 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-15 14:07:38,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2021-12-15 14:07:38,463 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 42 [2021-12-15 14:07:38,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:07:38,463 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2021-12-15 14:07:38,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:07:38,463 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2021-12-15 14:07:38,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-15 14:07:38,465 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:07:38,465 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:07:38,499 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-15 14:07:38,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:07:38,682 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-15 14:07:38,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:07:38,683 INFO L85 PathProgramCache]: Analyzing trace with hash -20077561, now seen corresponding path program 1 times [2021-12-15 14:07:38,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:07:38,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654962278] [2021-12-15 14:07:38,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:38,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:07:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:38,797 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-15 14:07:38,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:07:38,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654962278] [2021-12-15 14:07:38,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654962278] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:07:38,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430881943] [2021-12-15 14:07:38,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:38,799 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:07:38,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:07:38,803 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-15 14:07:38,805 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-15 14:07:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:38,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-15 14:07:38,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:07:39,125 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-15 14:07:39,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:07:39,359 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-15 14:07:39,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430881943] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:07:39,360 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:07:39,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2021-12-15 14:07:39,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99959730] [2021-12-15 14:07:39,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:07:39,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-15 14:07:39,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:07:39,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-15 14:07:39,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-12-15 14:07:39,362 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 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-15 14:07:39,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:07:39,487 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2021-12-15 14:07:39,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 14:07:39,488 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 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) Word has length 43 [2021-12-15 14:07:39,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:07:39,488 INFO L225 Difference]: With dead ends: 93 [2021-12-15 14:07:39,488 INFO L226 Difference]: Without dead ends: 93 [2021-12-15 14:07:39,488 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2021-12-15 14:07:39,489 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 122 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:07:39,489 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 92 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:07:39,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-12-15 14:07:39,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-12-15 14:07:39,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 80 states have (on average 1.2125) internal successors, (97), 92 states have internal predecessors, (97), 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-15 14:07:39,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2021-12-15 14:07:39,490 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 43 [2021-12-15 14:07:39,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:07:39,491 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2021-12-15 14:07:39,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 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-15 14:07:39,491 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2021-12-15 14:07:39,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-15 14:07:39,491 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:07:39,491 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2021-12-15 14:07:39,509 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-15 14:07:39,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:07:39,692 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-15 14:07:39,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:07:39,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1470341546, now seen corresponding path program 2 times [2021-12-15 14:07:39,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:07:39,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646762682] [2021-12-15 14:07:39,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:39,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:07:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:39,827 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-15 14:07:39,827 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:07:39,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646762682] [2021-12-15 14:07:39,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646762682] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:07:39,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992682437] [2021-12-15 14:07:39,828 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 14:07:39,828 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:07:39,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:07:39,844 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-15 14:07:39,845 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-15 14:07:39,907 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 14:07:39,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 14:07:39,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-15 14:07:39,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:07:40,339 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-15 14:07:40,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:07:40,674 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-15 14:07:40,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992682437] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:07:40,675 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:07:40,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2021-12-15 14:07:40,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416924231] [2021-12-15 14:07:40,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:07:40,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-15 14:07:40,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:07:40,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-15 14:07:40,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2021-12-15 14:07:40,677 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 23 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 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-15 14:07:41,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:07:41,172 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2021-12-15 14:07:41,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-15 14:07:41,173 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 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 57 [2021-12-15 14:07:41,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:07:41,173 INFO L225 Difference]: With dead ends: 137 [2021-12-15 14:07:41,173 INFO L226 Difference]: Without dead ends: 137 [2021-12-15 14:07:41,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=282, Invalid=840, Unknown=0, NotChecked=0, Total=1122 [2021-12-15 14:07:41,174 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 469 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:07:41,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [469 Valid, 255 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:07:41,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-12-15 14:07:41,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 122. [2021-12-15 14:07:41,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 109 states have (on average 1.2477064220183487) internal successors, (136), 121 states have internal predecessors, (136), 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-15 14:07:41,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2021-12-15 14:07:41,177 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 57 [2021-12-15 14:07:41,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:07:41,177 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2021-12-15 14:07:41,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 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-15 14:07:41,177 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2021-12-15 14:07:41,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-15 14:07:41,178 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:07:41,178 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2021-12-15 14:07:41,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-15 14:07:41,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-15 14:07:41,395 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-15 14:07:41,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:07:41,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1664052357, now seen corresponding path program 2 times [2021-12-15 14:07:41,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:07:41,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615215844] [2021-12-15 14:07:41,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:41,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:07:41,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:41,519 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-15 14:07:41,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:07:41,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615215844] [2021-12-15 14:07:41,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615215844] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:07:41,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102545978] [2021-12-15 14:07:41,520 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 14:07:41,520 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:07:41,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:07:41,521 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-15 14:07:41,521 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-15 14:07:41,566 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-15 14:07:41,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 14:07:41,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 14:07:41,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:07:42,012 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2021-12-15 14:07:42,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:07:42,700 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2021-12-15 14:07:42,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102545978] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:07:42,701 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:07:42,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2021-12-15 14:07:42,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440587140] [2021-12-15 14:07:42,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:07:42,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-15 14:07:42,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:07:42,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-15 14:07:42,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2021-12-15 14:07:42,702 INFO L87 Difference]: Start difference. First operand 122 states and 136 transitions. Second operand has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:07:43,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:07:43,031 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2021-12-15 14:07:43,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-15 14:07:43,032 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-12-15 14:07:43,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:07:43,032 INFO L225 Difference]: With dead ends: 121 [2021-12-15 14:07:43,033 INFO L226 Difference]: Without dead ends: 121 [2021-12-15 14:07:43,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2021-12-15 14:07:43,034 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 328 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:07:43,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [328 Valid, 219 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:07:43,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-15 14:07:43,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-12-15 14:07:43,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 109 states have (on average 1.18348623853211) internal successors, (129), 120 states have internal predecessors, (129), 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-15 14:07:43,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2021-12-15 14:07:43,038 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 58 [2021-12-15 14:07:43,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:07:43,039 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2021-12-15 14:07:43,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:07:43,039 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2021-12-15 14:07:43,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-15 14:07:43,043 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:07:43,043 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:07:43,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-15 14:07:43,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:07:43,259 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-15 14:07:43,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:07:43,260 INFO L85 PathProgramCache]: Analyzing trace with hash 797853176, now seen corresponding path program 1 times [2021-12-15 14:07:43,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:07:43,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722449222] [2021-12-15 14:07:43,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:43,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:07:43,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:43,337 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-15 14:07:43,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:07:43,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722449222] [2021-12-15 14:07:43,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722449222] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:07:43,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551366304] [2021-12-15 14:07:43,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:43,338 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:07:43,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:07:43,339 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-15 14:07:43,340 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-15 14:07:43,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:43,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 14:07:43,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:07:43,548 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-15 14:07:43,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:07:43,667 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-15 14:07:43,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551366304] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:07:43,667 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:07:43,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2021-12-15 14:07:43,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226352331] [2021-12-15 14:07:43,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:07:43,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-15 14:07:43,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:07:43,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-15 14:07:43,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-12-15 14:07:43,669 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 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-15 14:07:43,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:07:43,712 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2021-12-15 14:07:43,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-15 14:07:43,713 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 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 70 [2021-12-15 14:07:43,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:07:43,714 INFO L225 Difference]: With dead ends: 121 [2021-12-15 14:07:43,714 INFO L226 Difference]: Without dead ends: 121 [2021-12-15 14:07:43,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-12-15 14:07:43,715 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 41 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:07:43,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 260 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:07:43,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-15 14:07:43,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-12-15 14:07:43,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 109 states have (on average 1.146788990825688) internal successors, (125), 120 states have internal predecessors, (125), 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-15 14:07:43,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 125 transitions. [2021-12-15 14:07:43,718 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 125 transitions. Word has length 70 [2021-12-15 14:07:43,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:07:43,718 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 125 transitions. [2021-12-15 14:07:43,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 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-15 14:07:43,718 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2021-12-15 14:07:43,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-12-15 14:07:43,719 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:07:43,719 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2021-12-15 14:07:43,762 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-15 14:07:43,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:07:43,935 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-15 14:07:43,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:07:43,936 INFO L85 PathProgramCache]: Analyzing trace with hash -713446614, now seen corresponding path program 3 times [2021-12-15 14:07:43,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:07:43,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237100838] [2021-12-15 14:07:43,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:43,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:07:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:44,236 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 199 proven. 46 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-15 14:07:44,236 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:07:44,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237100838] [2021-12-15 14:07:44,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237100838] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:07:44,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983885228] [2021-12-15 14:07:44,237 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 14:07:44,237 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:07:44,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:07:44,238 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-15 14:07:44,239 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-15 14:07:44,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-15 14:07:44,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 14:07:44,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-15 14:07:44,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:07:44,842 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2021-12-15 14:07:44,842 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:07:44,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983885228] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:07:44,843 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-15 14:07:44,843 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 20 [2021-12-15 14:07:44,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202636403] [2021-12-15 14:07:44,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:07:44,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 14:07:44,844 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:07:44,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 14:07:44,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2021-12-15 14:07:44,844 INFO L87 Difference]: Start difference. First operand 121 states and 125 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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-15 14:07:44,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:07:44,959 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2021-12-15 14:07:44,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 14:07:44,959 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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 87 [2021-12-15 14:07:44,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:07:44,960 INFO L225 Difference]: With dead ends: 120 [2021-12-15 14:07:44,960 INFO L226 Difference]: Without dead ends: 120 [2021-12-15 14:07:44,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2021-12-15 14:07:44,961 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 191 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:07:44,961 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 67 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:07:44,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-12-15 14:07:44,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2021-12-15 14:07:44,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 108 states have (on average 1.1388888888888888) internal successors, (123), 118 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-15 14:07:44,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2021-12-15 14:07:44,963 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 87 [2021-12-15 14:07:44,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:07:44,963 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2021-12-15 14:07:44,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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-15 14:07:44,963 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2021-12-15 14:07:44,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-12-15 14:07:44,964 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:07:44,964 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:07:44,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-15 14:07:45,180 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,SelfDestructingSolverStorable13 [2021-12-15 14:07:45,180 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-15 14:07:45,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:07:45,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1503565048, now seen corresponding path program 2 times [2021-12-15 14:07:45,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:07:45,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125610672] [2021-12-15 14:07:45,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:45,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:07:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:45,290 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-15 14:07:45,290 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:07:45,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125610672] [2021-12-15 14:07:45,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125610672] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:07:45,291 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:07:45,291 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:07:45,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656784487] [2021-12-15 14:07:45,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:07:45,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 14:07:45,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:07:45,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 14:07:45,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:07:45,292 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand has 5 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-15 14:07:45,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:07:45,327 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2021-12-15 14:07:45,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 14:07:45,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 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 90 [2021-12-15 14:07:45,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:07:45,328 INFO L225 Difference]: With dead ends: 118 [2021-12-15 14:07:45,328 INFO L226 Difference]: Without dead ends: 118 [2021-12-15 14:07:45,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:07:45,329 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 27 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:07:45,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 100 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:07:45,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-12-15 14:07:45,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2021-12-15 14:07:45,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 108 states have (on average 1.1296296296296295) internal successors, (122), 117 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:07:45,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 122 transitions. [2021-12-15 14:07:45,332 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 122 transitions. Word has length 90 [2021-12-15 14:07:45,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:07:45,332 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 122 transitions. [2021-12-15 14:07:45,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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-15 14:07:45,333 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 122 transitions. [2021-12-15 14:07:45,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-12-15 14:07:45,333 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:07:45,333 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:07:45,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-15 14:07:45,334 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-15 14:07:45,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:07:45,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1503565049, now seen corresponding path program 1 times [2021-12-15 14:07:45,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:07:45,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499944377] [2021-12-15 14:07:45,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:45,335 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:07:45,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:45,426 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2021-12-15 14:07:45,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:07:45,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499944377] [2021-12-15 14:07:45,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499944377] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:07:45,427 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:07:45,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:07:45,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832033536] [2021-12-15 14:07:45,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:07:45,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 14:07:45,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:07:45,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 14:07:45,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-15 14:07:45,429 INFO L87 Difference]: Start difference. First operand 118 states and 122 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:07:45,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:07:45,510 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2021-12-15 14:07:45,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 14:07:45,511 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2021-12-15 14:07:45,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:07:45,512 INFO L225 Difference]: With dead ends: 125 [2021-12-15 14:07:45,512 INFO L226 Difference]: Without dead ends: 125 [2021-12-15 14:07:45,512 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-15 14:07:45,512 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 85 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:07:45,513 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 87 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:07:45,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-15 14:07:45,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 120. [2021-12-15 14:07:45,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 110 states have (on average 1.1272727272727272) internal successors, (124), 119 states have internal predecessors, (124), 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-15 14:07:45,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 124 transitions. [2021-12-15 14:07:45,515 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 124 transitions. Word has length 90 [2021-12-15 14:07:45,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:07:45,516 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 124 transitions. [2021-12-15 14:07:45,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:07:45,516 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2021-12-15 14:07:45,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-15 14:07:45,516 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:07:45,516 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:07:45,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-15 14:07:45,517 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-15 14:07:45,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:07:45,517 INFO L85 PathProgramCache]: Analyzing trace with hash -634123742, now seen corresponding path program 1 times [2021-12-15 14:07:45,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:07:45,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803149857] [2021-12-15 14:07:45,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:45,518 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:07:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:45,550 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-15 14:07:45,551 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:07:45,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803149857] [2021-12-15 14:07:45,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803149857] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:07:45,551 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:07:45,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:07:45,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871258789] [2021-12-15 14:07:45,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:07:45,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:07:45,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:07:45,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:07:45,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:07:45,552 INFO L87 Difference]: Start difference. First operand 120 states and 124 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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-15 14:07:45,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:07:45,577 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2021-12-15 14:07:45,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:07:45,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 91 [2021-12-15 14:07:45,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:07:45,578 INFO L225 Difference]: With dead ends: 119 [2021-12-15 14:07:45,578 INFO L226 Difference]: Without dead ends: 119 [2021-12-15 14:07:45,579 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-15 14:07:45,579 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 68 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-15 14:07:45,580 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 68 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:07:45,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-12-15 14:07:45,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2021-12-15 14:07:45,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 110 states have (on average 1.1181818181818182) internal successors, (123), 118 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-15 14:07:45,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2021-12-15 14:07:45,582 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 91 [2021-12-15 14:07:45,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:07:45,582 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2021-12-15 14:07:45,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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-15 14:07:45,582 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2021-12-15 14:07:45,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-15 14:07:45,583 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:07:45,583 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:07:45,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-15 14:07:45,583 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-15 14:07:45,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:07:45,584 INFO L85 PathProgramCache]: Analyzing trace with hash -634123741, now seen corresponding path program 1 times [2021-12-15 14:07:45,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:07:45,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443402426] [2021-12-15 14:07:45,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:45,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:07:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:45,623 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-15 14:07:45,623 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:07:45,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443402426] [2021-12-15 14:07:45,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443402426] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:07:45,624 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:07:45,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:07:45,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849487030] [2021-12-15 14:07:45,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:07:45,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:07:45,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:07:45,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:07:45,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:07:45,625 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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-15 14:07:45,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:07:45,642 INFO L93 Difference]: Finished difference Result 122 states and 126 transitions. [2021-12-15 14:07:45,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:07:45,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 91 [2021-12-15 14:07:45,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:07:45,643 INFO L225 Difference]: With dead ends: 122 [2021-12-15 14:07:45,643 INFO L226 Difference]: Without dead ends: 122 [2021-12-15 14:07:45,644 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-15 14:07:45,644 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:07:45,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 70 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:07:45,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-12-15 14:07:45,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2021-12-15 14:07:45,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 111 states have (on average 1.117117117117117) internal successors, (124), 119 states have internal predecessors, (124), 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-15 14:07:45,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 124 transitions. [2021-12-15 14:07:45,646 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 124 transitions. Word has length 91 [2021-12-15 14:07:45,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:07:45,647 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 124 transitions. [2021-12-15 14:07:45,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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-15 14:07:45,647 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2021-12-15 14:07:45,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-12-15 14:07:45,648 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:07:45,648 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:07:45,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-15 14:07:45,648 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-15 14:07:45,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:07:45,648 INFO L85 PathProgramCache]: Analyzing trace with hash 789303046, now seen corresponding path program 1 times [2021-12-15 14:07:45,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:07:45,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086157755] [2021-12-15 14:07:45,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:45,649 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:07:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:45,757 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2021-12-15 14:07:45,757 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:07:45,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086157755] [2021-12-15 14:07:45,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086157755] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:07:45,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232669363] [2021-12-15 14:07:45,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:45,758 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:07:45,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:07:45,772 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-15 14:07:45,827 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-15 14:07:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:45,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-15 14:07:45,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:07:46,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:07:46,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-15 14:07:46,737 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-15 14:07:46,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:07:48,067 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-15 14:07:48,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232669363] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:07:48,068 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:07:48,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 14 [2021-12-15 14:07:48,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121512991] [2021-12-15 14:07:48,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:07:48,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-15 14:07:48,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:07:48,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-15 14:07:48,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2021-12-15 14:07:48,070 INFO L87 Difference]: Start difference. First operand 120 states and 124 transitions. Second operand has 16 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 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-15 14:07:48,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:07:48,323 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2021-12-15 14:07:48,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 14:07:48,323 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 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 95 [2021-12-15 14:07:48,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:07:48,324 INFO L225 Difference]: With dead ends: 180 [2021-12-15 14:07:48,324 INFO L226 Difference]: Without dead ends: 180 [2021-12-15 14:07:48,324 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2021-12-15 14:07:48,325 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 194 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:07:48,325 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 224 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 154 Invalid, 0 Unknown, 60 Unchecked, 0.1s Time] [2021-12-15 14:07:48,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-12-15 14:07:48,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 134. [2021-12-15 14:07:48,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 125 states have (on average 1.136) internal successors, (142), 133 states have internal predecessors, (142), 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-15 14:07:48,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 142 transitions. [2021-12-15 14:07:48,327 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 142 transitions. Word has length 95 [2021-12-15 14:07:48,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:07:48,327 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 142 transitions. [2021-12-15 14:07:48,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 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-15 14:07:48,328 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2021-12-15 14:07:48,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-12-15 14:07:48,328 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:07:48,328 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:07:48,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-15 14:07:48,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:07:48,545 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-15 14:07:48,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:07:48,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1301409354, now seen corresponding path program 1 times [2021-12-15 14:07:48,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:07:48,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979294827] [2021-12-15 14:07:48,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:48,546 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:07:48,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:48,590 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-15 14:07:48,590 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:07:48,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979294827] [2021-12-15 14:07:48,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979294827] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:07:48,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817604713] [2021-12-15 14:07:48,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:48,591 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:07:48,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:07:48,592 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-15 14:07:48,611 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-15 14:07:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:48,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-15 14:07:48,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:07:48,790 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-15 14:07:48,835 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-15 14:07:48,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:07:48,944 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-15 14:07:48,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817604713] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:07:48,944 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:07:48,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2021-12-15 14:07:48,945 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848963349] [2021-12-15 14:07:48,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:07:48,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 14:07:48,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:07:48,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 14:07:48,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-12-15 14:07:48,946 INFO L87 Difference]: Start difference. First operand 134 states and 142 transitions. Second operand has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:07:49,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:07:49,024 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2021-12-15 14:07:49,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 14:07:49,025 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2021-12-15 14:07:49,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:07:49,025 INFO L225 Difference]: With dead ends: 137 [2021-12-15 14:07:49,025 INFO L226 Difference]: Without dead ends: 137 [2021-12-15 14:07:49,026 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2021-12-15 14:07:49,026 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 11 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:07:49,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 151 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:07:49,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-12-15 14:07:49,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2021-12-15 14:07:49,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 126 states have (on average 1.119047619047619) internal successors, (141), 134 states have internal predecessors, (141), 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-15 14:07:49,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 141 transitions. [2021-12-15 14:07:49,031 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 141 transitions. Word has length 96 [2021-12-15 14:07:49,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:07:49,031 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 141 transitions. [2021-12-15 14:07:49,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:07:49,032 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 141 transitions. [2021-12-15 14:07:49,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-12-15 14:07:49,032 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:07:49,032 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:07:49,057 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-15 14:07:49,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:07:49,251 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-15 14:07:49,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:07:49,251 INFO L85 PathProgramCache]: Analyzing trace with hash -265893408, now seen corresponding path program 1 times [2021-12-15 14:07:49,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:07:49,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917058141] [2021-12-15 14:07:49,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:49,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:07:49,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:49,292 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-15 14:07:49,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:07:49,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917058141] [2021-12-15 14:07:49,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917058141] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:07:49,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400740645] [2021-12-15 14:07:49,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:49,293 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:07:49,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:07:49,294 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 14:07:49,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-15 14:07:49,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:49,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 14:07:49,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:07:49,493 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-15 14:07:49,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:07:49,582 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-15 14:07:49,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400740645] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:07:49,583 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:07:49,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2021-12-15 14:07:49,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538913788] [2021-12-15 14:07:49,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:07:49,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-15 14:07:49,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:07:49,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 14:07:49,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2021-12-15 14:07:49,585 INFO L87 Difference]: Start difference. First operand 135 states and 141 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 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-15 14:07:49,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:07:49,614 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2021-12-15 14:07:49,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 14:07:49,614 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 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 103 [2021-12-15 14:07:49,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:07:49,615 INFO L225 Difference]: With dead ends: 145 [2021-12-15 14:07:49,615 INFO L226 Difference]: Without dead ends: 145 [2021-12-15 14:07:49,616 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2021-12-15 14:07:49,616 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 42 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:07:49,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 195 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:07:49,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-12-15 14:07:49,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2021-12-15 14:07:49,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 134 states have (on average 1.1119402985074627) internal successors, (149), 142 states have internal predecessors, (149), 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-15 14:07:49,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 149 transitions. [2021-12-15 14:07:49,619 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 149 transitions. Word has length 103 [2021-12-15 14:07:49,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:07:49,619 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 149 transitions. [2021-12-15 14:07:49,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 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-15 14:07:49,619 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 149 transitions. [2021-12-15 14:07:49,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-12-15 14:07:49,620 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:07:49,620 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:07:49,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-15 14:07:49,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-12-15 14:07:49,835 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-15 14:07:49,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:07:49,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1508601145, now seen corresponding path program 2 times [2021-12-15 14:07:49,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:07:49,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339341480] [2021-12-15 14:07:49,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:49,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:07:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:50,014 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 28 proven. 38 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2021-12-15 14:07:50,014 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:07:50,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339341480] [2021-12-15 14:07:50,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339341480] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:07:50,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901826910] [2021-12-15 14:07:50,015 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 14:07:50,015 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:07:50,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:07:50,016 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 14:07:50,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-15 14:07:50,126 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 14:07:50,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 14:07:50,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-15 14:07:50,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:07:50,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:07:50,777 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-15 14:07:50,998 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-15 14:07:50,999 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 14:07:50,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901826910] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:07:50,999 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-15 14:07:50,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 16 [2021-12-15 14:07:50,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419924079] [2021-12-15 14:07:50,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:07:51,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-15 14:07:51,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:07:51,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-15 14:07:51,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2021-12-15 14:07:51,001 INFO L87 Difference]: Start difference. First operand 143 states and 149 transitions. Second operand has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 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-15 14:07:51,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:07:51,199 INFO L93 Difference]: Finished difference Result 142 states and 147 transitions. [2021-12-15 14:07:51,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 14:07:51,200 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 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 110 [2021-12-15 14:07:51,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:07:51,200 INFO L225 Difference]: With dead ends: 142 [2021-12-15 14:07:51,201 INFO L226 Difference]: Without dead ends: 142 [2021-12-15 14:07:51,201 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2021-12-15 14:07:51,202 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 65 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:07:51,202 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 106 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:07:51,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-12-15 14:07:51,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2021-12-15 14:07:51,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 134 states have (on average 1.0970149253731343) internal successors, (147), 141 states have internal predecessors, (147), 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-15 14:07:51,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 147 transitions. [2021-12-15 14:07:51,205 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 147 transitions. Word has length 110 [2021-12-15 14:07:51,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:07:51,205 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 147 transitions. [2021-12-15 14:07:51,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 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-15 14:07:51,206 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 147 transitions. [2021-12-15 14:07:51,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-12-15 14:07:51,206 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:07:51,207 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:07:51,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-15 14:07:51,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-15 14:07:51,432 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-15 14:07:51,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:07:51,432 INFO L85 PathProgramCache]: Analyzing trace with hash -478004765, now seen corresponding path program 2 times [2021-12-15 14:07:51,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:07:51,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172884151] [2021-12-15 14:07:51,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:51,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:07:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:51,567 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-15 14:07:51,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:07:51,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172884151] [2021-12-15 14:07:51,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172884151] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:07:51,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463528363] [2021-12-15 14:07:51,567 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 14:07:51,567 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:07:51,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:07:51,584 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 14:07:51,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-15 14:07:51,713 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-15 14:07:51,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 14:07:51,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-15 14:07:51,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:07:51,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-15 14:07:52,037 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2021-12-15 14:07:52,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:07:52,532 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2021-12-15 14:07:52,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463528363] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:07:52,532 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:07:52,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2021-12-15 14:07:52,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710925081] [2021-12-15 14:07:52,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:07:52,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-15 14:07:52,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:07:52,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-15 14:07:52,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2021-12-15 14:07:52,533 INFO L87 Difference]: Start difference. First operand 142 states and 147 transitions. Second operand has 17 states, 16 states have (on average 5.4375) internal successors, (87), 17 states have internal predecessors, (87), 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-15 14:07:52,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:07:52,764 INFO L93 Difference]: Finished difference Result 142 states and 146 transitions. [2021-12-15 14:07:52,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-15 14:07:52,764 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.4375) internal successors, (87), 17 states have internal predecessors, (87), 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-15 14:07:52,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:07:52,765 INFO L225 Difference]: With dead ends: 142 [2021-12-15 14:07:52,765 INFO L226 Difference]: Without dead ends: 142 [2021-12-15 14:07:52,765 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2021-12-15 14:07:52,765 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 262 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:07:52,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [262 Valid, 123 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:07:52,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-12-15 14:07:52,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2021-12-15 14:07:52,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 134 states have (on average 1.0820895522388059) internal successors, (145), 140 states have internal predecessors, (145), 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-15 14:07:52,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 145 transitions. [2021-12-15 14:07:52,767 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 145 transitions. Word has length 111 [2021-12-15 14:07:52,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:07:52,768 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 145 transitions. [2021-12-15 14:07:52,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.4375) internal successors, (87), 17 states have internal predecessors, (87), 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-15 14:07:52,768 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2021-12-15 14:07:52,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-12-15 14:07:52,768 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:07:52,768 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:07:52,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-15 14:07:52,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-12-15 14:07:52,975 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-15 14:07:52,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:07:52,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1693145504, now seen corresponding path program 2 times [2021-12-15 14:07:52,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:07:52,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511617094] [2021-12-15 14:07:52,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:52,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:07:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:53,049 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-15 14:07:53,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:07:53,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511617094] [2021-12-15 14:07:53,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511617094] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:07:53,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34466628] [2021-12-15 14:07:53,051 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 14:07:53,051 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:07:53,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:07:53,052 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 14:07:53,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-15 14:07:53,189 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 14:07:53,189 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 14:07:53,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 14:07:53,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:07:53,346 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-15 14:07:53,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:07:53,493 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-15 14:07:53,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34466628] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:07:53,494 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:07:53,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2021-12-15 14:07:53,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729747797] [2021-12-15 14:07:53,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:07:53,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-15 14:07:53,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:07:53,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-15 14:07:53,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-12-15 14:07:53,495 INFO L87 Difference]: Start difference. First operand 141 states and 145 transitions. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 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-15 14:07:53,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:07:53,537 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2021-12-15 14:07:53,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-15 14:07:53,542 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 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 123 [2021-12-15 14:07:53,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:07:53,542 INFO L225 Difference]: With dead ends: 161 [2021-12-15 14:07:53,542 INFO L226 Difference]: Without dead ends: 161 [2021-12-15 14:07:53,543 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-12-15 14:07:53,543 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 40 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:07:53,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 124 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:07:53,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-12-15 14:07:53,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2021-12-15 14:07:53,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 154 states have (on average 1.0714285714285714) internal successors, (165), 160 states have internal predecessors, (165), 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-15 14:07:53,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 165 transitions. [2021-12-15 14:07:53,546 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 165 transitions. Word has length 123 [2021-12-15 14:07:53,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:07:53,547 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 165 transitions. [2021-12-15 14:07:53,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 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-15 14:07:53,547 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 165 transitions. [2021-12-15 14:07:53,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-12-15 14:07:53,548 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:07:53,548 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:07:53,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-15 14:07:53,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:07:53,765 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-15 14:07:53,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:07:53,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1282766496, now seen corresponding path program 3 times [2021-12-15 14:07:53,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:07:53,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389007839] [2021-12-15 14:07:53,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:53,766 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:07:53,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 14:07:53,843 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 14:07:53,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 14:07:53,983 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 14:07:53,983 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-15 14:07:53,985 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10REQUIRES_VIOLATION (16 of 17 remaining) [2021-12-15 14:07:53,986 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (15 of 17 remaining) [2021-12-15 14:07:53,987 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (14 of 17 remaining) [2021-12-15 14:07:53,987 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (13 of 17 remaining) [2021-12-15 14:07:53,987 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (12 of 17 remaining) [2021-12-15 14:07:53,987 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (11 of 17 remaining) [2021-12-15 14:07:53,987 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (10 of 17 remaining) [2021-12-15 14:07:53,987 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (9 of 17 remaining) [2021-12-15 14:07:53,988 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (8 of 17 remaining) [2021-12-15 14:07:53,988 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (7 of 17 remaining) [2021-12-15 14:07:53,988 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (6 of 17 remaining) [2021-12-15 14:07:53,988 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (5 of 17 remaining) [2021-12-15 14:07:53,988 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (4 of 17 remaining) [2021-12-15 14:07:53,988 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (3 of 17 remaining) [2021-12-15 14:07:53,988 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (2 of 17 remaining) [2021-12-15 14:07:53,989 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (1 of 17 remaining) [2021-12-15 14:07:53,989 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (0 of 17 remaining) [2021-12-15 14:07:53,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-15 14:07:53,993 INFO L732 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:07:53,997 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-15 14:07:54,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 02:07:54 BoogieIcfgContainer [2021-12-15 14:07:54,086 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-15 14:07:54,087 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-15 14:07:54,087 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-15 14:07:54,087 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-15 14:07:54,088 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 02:07:35" (3/4) ... [2021-12-15 14:07:54,089 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-15 14:07:54,149 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-15 14:07:54,149 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-15 14:07:54,150 INFO L158 Benchmark]: Toolchain (without parser) took 19570.60ms. Allocated memory was 88.1MB in the beginning and 197.1MB in the end (delta: 109.1MB). Free memory was 57.6MB in the beginning and 152.8MB in the end (delta: -95.2MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2021-12-15 14:07:54,150 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 88.1MB. Free memory is still 46.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 14:07:54,150 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.75ms. Allocated memory was 88.1MB in the beginning and 113.2MB in the end (delta: 25.2MB). Free memory was 57.4MB in the beginning and 88.7MB in the end (delta: -31.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 14:07:54,150 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.21ms. Allocated memory is still 113.2MB. Free memory was 88.7MB in the beginning and 87.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 14:07:54,151 INFO L158 Benchmark]: Boogie Preprocessor took 41.99ms. Allocated memory is still 113.2MB. Free memory was 87.0MB in the beginning and 85.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 14:07:54,151 INFO L158 Benchmark]: RCFGBuilder took 358.63ms. Allocated memory is still 113.2MB. Free memory was 85.7MB in the beginning and 72.3MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-15 14:07:54,157 INFO L158 Benchmark]: TraceAbstraction took 18837.08ms. Allocated memory was 113.2MB in the beginning and 197.1MB in the end (delta: 83.9MB). Free memory was 71.9MB in the beginning and 163.3MB in the end (delta: -91.3MB). Peak memory consumption was 102.5MB. Max. memory is 16.1GB. [2021-12-15 14:07:54,158 INFO L158 Benchmark]: Witness Printer took 62.53ms. Allocated memory is still 197.1MB. Free memory was 163.3MB in the beginning and 152.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-15 14:07:54,160 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.14ms. Allocated memory is still 88.1MB. Free memory is still 46.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.75ms. Allocated memory was 88.1MB in the beginning and 113.2MB in the end (delta: 25.2MB). Free memory was 57.4MB in the beginning and 88.7MB in the end (delta: -31.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.21ms. Allocated memory is still 113.2MB. Free memory was 88.7MB in the beginning and 87.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.99ms. Allocated memory is still 113.2MB. Free memory was 87.0MB in the beginning and 85.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 358.63ms. Allocated memory is still 113.2MB. Free memory was 85.7MB in the beginning and 72.3MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 18837.08ms. Allocated memory was 113.2MB in the beginning and 197.1MB in the end (delta: 83.9MB). Free memory was 71.9MB in the beginning and 163.3MB in the end (delta: -91.3MB). Peak memory consumption was 102.5MB. Max. memory is 16.1GB. * Witness Printer took 62.53ms. Allocated memory is still 197.1MB. Free memory was 163.3MB in the beginning and 152.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. 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 - CounterExampleResult [Line: 38]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L6] static int array[10]; [L17] static int numbers2[10]; [L36] static int numbers4[10]; VAL [array={2:0}, numbers2={3:0}, numbers4={4:0}] [L45] CALL getNumbers4() [L35] CALL, EXPR getNumbers3() [L25] CALL, EXPR getNumbers2() [L16] CALL, EXPR getNumbers() [L8] int i = 0; VAL [array={2:0}, i=0, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=0, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=0, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=1, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=1, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=1, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=2, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=2, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=2, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=3, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=3, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=3, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=4, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=4, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=4, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=5, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=5, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=5, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=6, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=6, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=6, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=7, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=7, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=7, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=8, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=8, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=8, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=9, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=9, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=9, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=10, numbers2={3:0}, numbers4={4:0}] [L8] COND FALSE !(i < 10) VAL [array={2:0}, i=10, numbers2={3:0}, numbers4={4:0}] [L12] return array; VAL [\result={2:0}, array={2:0}, i=10, numbers2={3:0}, numbers4={4:0}] [L16] RET, EXPR getNumbers() [L16] int* numbers = getNumbers(); [L18] int i = 0; VAL [array={2:0}, i=0, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=0, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=0, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=0] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=0, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=0] [L18] ++i VAL [array={2:0}, i=1, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=1, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=1, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=1] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=1, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=1] [L18] ++i VAL [array={2:0}, i=2, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=2, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=2, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=2] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=2, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=2] [L18] ++i VAL [array={2:0}, i=3, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=3, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=3, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=3] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=3, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=3] [L18] ++i VAL [array={2:0}, i=4, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=4, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=4, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=4] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=4, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=4] [L18] ++i VAL [array={2:0}, i=5, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=5, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=5, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=5] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=5, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=5] [L18] ++i VAL [array={2:0}, i=6, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=6, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=6, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=6] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=6, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=6] [L18] ++i VAL [array={2:0}, i=7, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=7, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=7, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=7] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=7, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=7] [L18] ++i VAL [array={2:0}, i=8, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=8, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=8, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=8] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=8, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=8] [L18] ++i VAL [array={2:0}, i=9, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=9, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=9, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=9] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=9, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=9] [L18] ++i VAL [array={2:0}, i=10, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND FALSE !(i < 10) VAL [array={2:0}, i=10, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L21] return numbers2; VAL [\result={3:0}, array={2:0}, i=10, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L25] RET, EXPR getNumbers2() [L25] int* numbers = getNumbers2(); [L26] int numbers3[10]; [L27] int i = 0; VAL [array={2:0}, i=0, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=0, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=0, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=0] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=0, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=0] [L27] ++i VAL [array={2:0}, i=1, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=1, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=1, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=1] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=1, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=1] [L27] ++i VAL [array={2:0}, i=2, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=2, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=2, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=2] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=2, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=2] [L27] ++i VAL [array={2:0}, i=3, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=3, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=3, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=3] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=3, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=3] [L27] ++i VAL [array={2:0}, i=4, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=4, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=4, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=4] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=4, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=4] [L27] ++i VAL [array={2:0}, i=5, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=5, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=5, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=5] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=5, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=5] [L27] ++i VAL [array={2:0}, i=6, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=6, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=6, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=6] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=6, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=6] [L27] ++i VAL [array={2:0}, i=7, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=7, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=7, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=7] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=7, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=7] [L27] ++i VAL [array={2:0}, i=8, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=8, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=8, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=8] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=8, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=8] [L27] ++i VAL [array={2:0}, i=9, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=9, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=9, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=9] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=9, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=9] [L27] ++i VAL [array={2:0}, i=10, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND FALSE !(i < 10) VAL [array={2:0}, i=10, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L31] return numbers3; [L31] return numbers3; VAL [\result={11:0}, array={2:0}, i=10, numbers={3:0}, numbers2={3:0}, numbers4={4:0}] [L35] RET, EXPR getNumbers3() [L35] int* numbers = getNumbers3(); [L37] int i = 0; VAL [array={2:0}, i=0, numbers={11:0}, numbers2={3:0}, numbers4={4:0}] [L37] COND TRUE i < 10 VAL [array={2:0}, i=0, numbers={11:0}, numbers2={3:0}, numbers4={4:0}] [L38] numbers[i] - UnprovableResult [Line: 9]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 9]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 28]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 28]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 28]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 28]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 38]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 38]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 38]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 43]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 53 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 18.7s, OverallIterations: 25, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2617 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2617 mSDsluCounter, 2952 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 60 IncrementalHoareTripleChecker+Unchecked, 2070 mSDsCounter, 311 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2042 IncrementalHoareTripleChecker+Invalid, 2413 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 311 mSolverCounterUnsat, 882 mSDtfsCounter, 2042 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2012 GetRequests, 1736 SyntacticMatches, 3 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161occurred in iteration=24, InterpolantAutomatonStates: 182, 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, 24 MinimizatonAttempts, 89 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 10.5s InterpolantComputationTime, 2653 NumberOfCodeBlocks, 2431 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 3285 ConstructedInterpolants, 87 QuantifiedInterpolants, 28852 SizeOfPredicates, 30 NumberOfNonLiveVariables, 3560 ConjunctsInSsa, 180 ConjunctsInUnsatCore, 50 InterpolantComputations, 12 PerfectInterpolantSequences, 11282/12197 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 proved your program to be incorrect! [2021-12-15 14:07:54,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)