./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/960521-1-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/960521-1-3.i -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 c10f64ae1701d633846cd3dbd537781b9e2aef0b0b5befdebbc22e76d228933b --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 20:18:24,817 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 20:18:24,823 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 20:18:24,849 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 20:18:24,849 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 20:18:24,852 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 20:18:24,854 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 20:18:24,856 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 20:18:24,858 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 20:18:24,862 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 20:18:24,862 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 20:18:24,863 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 20:18:24,864 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 20:18:24,866 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 20:18:24,867 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 20:18:24,871 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 20:18:24,871 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 20:18:24,872 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 20:18:24,875 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 20:18:24,881 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 20:18:24,881 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 20:18:24,882 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 20:18:24,883 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 20:18:24,884 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 20:18:24,885 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 20:18:24,886 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 20:18:24,886 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 20:18:24,887 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 20:18:24,887 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 20:18:24,888 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 20:18:24,888 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 20:18:24,889 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 20:18:24,889 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 20:18:24,890 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 20:18:24,891 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 20:18:24,891 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 20:18:24,892 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 20:18:24,892 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 20:18:24,892 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 20:18:24,892 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 20:18:24,893 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 20:18:24,894 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-18 20:18:24,914 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 20:18:24,916 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 20:18:24,917 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 20:18:24,917 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 20:18:24,918 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 20:18:24,918 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 20:18:24,918 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 20:18:24,918 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 20:18:24,919 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 20:18:24,919 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 20:18:24,920 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-18 20:18:24,920 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-18 20:18:24,920 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 20:18:24,920 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-18 20:18:24,920 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 20:18:24,920 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-18 20:18:24,921 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-18 20:18:24,921 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-18 20:18:24,921 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 20:18:24,921 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-18 20:18:24,921 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-18 20:18:24,921 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 20:18:24,921 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 20:18:24,922 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 20:18:24,922 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 20:18:24,922 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 20:18:24,922 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 20:18:24,922 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 20:18:24,922 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-18 20:18:24,923 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-18 20:18:24,923 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 20:18:24,923 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 -> c10f64ae1701d633846cd3dbd537781b9e2aef0b0b5befdebbc22e76d228933b [2021-12-18 20:18:25,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 20:18:25,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 20:18:25,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 20:18:25,126 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 20:18:25,127 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 20:18:25,128 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/960521-1-3.i [2021-12-18 20:18:25,181 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0580f5a80/a19b30af0ff74a01a77e0a40bb74fce7/FLAG6a0a3fb8c [2021-12-18 20:18:25,612 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 20:18:25,613 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/960521-1-3.i [2021-12-18 20:18:25,626 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0580f5a80/a19b30af0ff74a01a77e0a40bb74fce7/FLAG6a0a3fb8c [2021-12-18 20:18:25,636 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0580f5a80/a19b30af0ff74a01a77e0a40bb74fce7 [2021-12-18 20:18:25,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 20:18:25,643 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 20:18:25,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 20:18:25,645 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 20:18:25,647 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 20:18:25,648 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:18:25" (1/1) ... [2021-12-18 20:18:25,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64d9e8be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:18:25, skipping insertion in model container [2021-12-18 20:18:25,649 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:18:25" (1/1) ... [2021-12-18 20:18:25,653 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 20:18:25,681 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 20:18:25,863 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 20:18:25,868 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 20:18:25,892 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 20:18:25,908 INFO L208 MainTranslator]: Completed translation [2021-12-18 20:18:25,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:18:25 WrapperNode [2021-12-18 20:18:25,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 20:18:25,909 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 20:18:25,909 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 20:18:25,910 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 20:18:25,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:18:25" (1/1) ... [2021-12-18 20:18:25,929 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:18:25" (1/1) ... [2021-12-18 20:18:25,942 INFO L137 Inliner]: procedures = 121, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2021-12-18 20:18:25,942 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 20:18:25,943 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 20:18:25,943 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 20:18:25,943 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 20:18:25,947 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:18:25" (1/1) ... [2021-12-18 20:18:25,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:18:25" (1/1) ... [2021-12-18 20:18:25,949 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:18:25" (1/1) ... [2021-12-18 20:18:25,949 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:18:25" (1/1) ... [2021-12-18 20:18:25,953 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:18:25" (1/1) ... [2021-12-18 20:18:25,956 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:18:25" (1/1) ... [2021-12-18 20:18:25,956 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:18:25" (1/1) ... [2021-12-18 20:18:25,958 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 20:18:25,958 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 20:18:25,958 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 20:18:25,959 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 20:18:25,959 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:18:25" (1/1) ... [2021-12-18 20:18:25,975 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 20:18:25,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:18:25,998 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-18 20:18:26,020 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-18 20:18:26,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-18 20:18:26,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-18 20:18:26,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 20:18:26,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 20:18:26,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 20:18:26,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-18 20:18:26,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 20:18:26,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 20:18:26,120 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 20:18:26,121 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 20:18:26,264 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 20:18:26,281 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 20:18:26,282 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-18 20:18:26,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:18:26 BoogieIcfgContainer [2021-12-18 20:18:26,283 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 20:18:26,287 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 20:18:26,288 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 20:18:26,290 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 20:18:26,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:18:25" (1/3) ... [2021-12-18 20:18:26,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b4338df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:18:26, skipping insertion in model container [2021-12-18 20:18:26,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:18:25" (2/3) ... [2021-12-18 20:18:26,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b4338df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:18:26, skipping insertion in model container [2021-12-18 20:18:26,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:18:26" (3/3) ... [2021-12-18 20:18:26,293 INFO L111 eAbstractionObserver]: Analyzing ICFG 960521-1-3.i [2021-12-18 20:18:26,297 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 20:18:26,298 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2021-12-18 20:18:26,341 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 20:18:26,347 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-18 20:18:26,347 INFO L340 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2021-12-18 20:18:26,360 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 29 states have (on average 1.896551724137931) internal successors, (55), 50 states have internal predecessors, (55), 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-18 20:18:26,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-18 20:18:26,379 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:18:26,379 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-18 20:18:26,380 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:18:26,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:18:26,384 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-18 20:18:26,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:18:26,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267815190] [2021-12-18 20:18:26,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:18:26,394 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:18:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:18:26,533 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-18 20:18:26,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:18:26,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267815190] [2021-12-18 20:18:26,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267815190] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:18:26,535 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:18:26,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 20:18:26,536 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373438627] [2021-12-18 20:18:26,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:18:26,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 20:18:26,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:18:26,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 20:18:26,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:18:26,564 INFO L87 Difference]: Start difference. First operand has 51 states, 29 states have (on average 1.896551724137931) internal successors, (55), 50 states have internal predecessors, (55), 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 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-18 20:18:26,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:18:26,608 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2021-12-18 20:18:26,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 20:18:26,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2021-12-18 20:18:26,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:18:26,616 INFO L225 Difference]: With dead ends: 50 [2021-12-18 20:18:26,616 INFO L226 Difference]: Without dead ends: 48 [2021-12-18 20:18:26,618 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-18 20:18:26,621 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 2 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 20:18:26,622 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 81 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 20:18:26,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-12-18 20:18:26,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2021-12-18 20:18:26,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 47 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:18:26,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2021-12-18 20:18:26,650 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 3 [2021-12-18 20:18:26,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:18:26,650 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2021-12-18 20:18:26,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-18 20:18:26,651 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2021-12-18 20:18:26,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-18 20:18:26,651 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:18:26,651 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-18 20:18:26,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-18 20:18:26,652 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:18:26,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:18:26,653 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-18 20:18:26,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:18:26,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847997335] [2021-12-18 20:18:26,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:18:26,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:18:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:18:26,728 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-18 20:18:26,728 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:18:26,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847997335] [2021-12-18 20:18:26,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847997335] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:18:26,729 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:18:26,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 20:18:26,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908554180] [2021-12-18 20:18:26,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:18:26,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 20:18:26,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:18:26,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 20:18:26,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:18:26,732 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-18 20:18:26,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:18:26,750 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2021-12-18 20:18:26,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 20:18:26,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2021-12-18 20:18:26,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:18:26,752 INFO L225 Difference]: With dead ends: 47 [2021-12-18 20:18:26,752 INFO L226 Difference]: Without dead ends: 47 [2021-12-18 20:18:26,752 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-18 20:18:26,753 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 20:18:26,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 87 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 20:18:26,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-12-18 20:18:26,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2021-12-18 20:18:26,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 28 states have (on average 1.75) internal successors, (49), 46 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-18 20:18:26,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2021-12-18 20:18:26,758 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 3 [2021-12-18 20:18:26,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:18:26,758 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2021-12-18 20:18:26,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-18 20:18:26,759 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2021-12-18 20:18:26,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-18 20:18:26,759 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:18:26,760 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-18 20:18:26,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-18 20:18:26,760 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:18:26,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:18:26,761 INFO L85 PathProgramCache]: Analyzing trace with hash 889446312, now seen corresponding path program 1 times [2021-12-18 20:18:26,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:18:26,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931399109] [2021-12-18 20:18:26,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:18:26,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:18:26,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:18:26,806 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-18 20:18:26,812 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:18:26,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931399109] [2021-12-18 20:18:26,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931399109] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:18:26,812 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:18:26,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 20:18:26,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112843123] [2021-12-18 20:18:26,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:18:26,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 20:18:26,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:18:26,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 20:18:26,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-18 20:18:26,814 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-18 20:18:26,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:18:26,855 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2021-12-18 20:18:26,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 20:18:26,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2021-12-18 20:18:26,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:18:26,856 INFO L225 Difference]: With dead ends: 44 [2021-12-18 20:18:26,857 INFO L226 Difference]: Without dead ends: 44 [2021-12-18 20:18:26,857 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-18 20:18:26,858 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 28 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 20:18:26,859 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 51 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 20:18:26,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-12-18 20:18:26,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2021-12-18 20:18:26,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 43 states have internal predecessors, (46), 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-18 20:18:26,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2021-12-18 20:18:26,866 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 6 [2021-12-18 20:18:26,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:18:26,866 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2021-12-18 20:18:26,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-18 20:18:26,866 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2021-12-18 20:18:26,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-18 20:18:26,867 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:18:26,867 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-18 20:18:26,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-18 20:18:26,868 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:18:26,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:18:26,869 INFO L85 PathProgramCache]: Analyzing trace with hash 889446313, now seen corresponding path program 1 times [2021-12-18 20:18:26,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:18:26,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448699205] [2021-12-18 20:18:26,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:18:26,869 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:18:26,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:18:26,962 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-18 20:18:26,963 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:18:26,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448699205] [2021-12-18 20:18:26,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448699205] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:18:26,963 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:18:26,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 20:18:26,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761981462] [2021-12-18 20:18:26,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:18:26,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 20:18:26,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:18:26,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 20:18:26,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 20:18:26,966 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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-18 20:18:27,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:18:27,023 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2021-12-18 20:18:27,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 20:18:27,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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 6 [2021-12-18 20:18:27,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:18:27,024 INFO L225 Difference]: With dead ends: 51 [2021-12-18 20:18:27,024 INFO L226 Difference]: Without dead ends: 51 [2021-12-18 20:18:27,025 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 20:18:27,025 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 56 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:18:27,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 64 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:18:27,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-12-18 20:18:27,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2021-12-18 20:18:27,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 44 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-18 20:18:27,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2021-12-18 20:18:27,029 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 6 [2021-12-18 20:18:27,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:18:27,029 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2021-12-18 20:18:27,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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-18 20:18:27,030 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2021-12-18 20:18:27,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-18 20:18:27,030 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:18:27,030 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:18:27,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-18 20:18:27,031 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:18:27,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:18:27,031 INFO L85 PathProgramCache]: Analyzing trace with hash 59362067, now seen corresponding path program 1 times [2021-12-18 20:18:27,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:18:27,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925794821] [2021-12-18 20:18:27,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:18:27,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:18:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:18:27,057 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-18 20:18:27,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:18:27,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925794821] [2021-12-18 20:18:27,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925794821] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:18:27,058 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:18:27,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 20:18:27,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203003012] [2021-12-18 20:18:27,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:18:27,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 20:18:27,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:18:27,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 20:18:27,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-18 20:18:27,060 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-18 20:18:27,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:18:27,082 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2021-12-18 20:18:27,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 20:18:27,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2021-12-18 20:18:27,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:18:27,083 INFO L225 Difference]: With dead ends: 50 [2021-12-18 20:18:27,083 INFO L226 Difference]: Without dead ends: 50 [2021-12-18 20:18:27,084 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-18 20:18:27,084 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 53 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 20:18:27,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 66 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 20:18:27,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-12-18 20:18:27,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2021-12-18 20:18:27,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 44 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:18:27,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2021-12-18 20:18:27,087 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 8 [2021-12-18 20:18:27,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:18:27,088 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2021-12-18 20:18:27,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-18 20:18:27,088 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2021-12-18 20:18:27,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-18 20:18:27,088 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:18:27,088 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:18:27,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-18 20:18:27,089 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:18:27,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:18:27,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1841820687, now seen corresponding path program 1 times [2021-12-18 20:18:27,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:18:27,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248609978] [2021-12-18 20:18:27,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:18:27,090 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:18:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:18:27,161 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-18 20:18:27,162 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:18:27,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248609978] [2021-12-18 20:18:27,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248609978] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:18:27,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128519929] [2021-12-18 20:18:27,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:18:27,163 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:18:27,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:18:27,168 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-18 20:18:27,169 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-18 20:18:27,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:18:27,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-18 20:18:27,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:18:27,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:18:27,266 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-12-18 20:18:27,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-18 20:18:27,339 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-18 20:18:27,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:18:27,415 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-18 20:18:27,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128519929] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:18:27,415 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:18:27,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2021-12-18 20:18:27,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016531206] [2021-12-18 20:18:27,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:18:27,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-18 20:18:27,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:18:27,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-18 20:18:27,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2021-12-18 20:18:27,417 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 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-18 20:18:27,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:18:27,586 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2021-12-18 20:18:27,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 20:18:27,587 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 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 9 [2021-12-18 20:18:27,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:18:27,590 INFO L225 Difference]: With dead ends: 92 [2021-12-18 20:18:27,590 INFO L226 Difference]: Without dead ends: 92 [2021-12-18 20:18:27,591 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2021-12-18 20:18:27,593 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 292 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:18:27,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 137 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:18:27,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-18 20:18:27,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 57. [2021-12-18 20:18:27,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 56 states have internal predecessors, (61), 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-18 20:18:27,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2021-12-18 20:18:27,606 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 9 [2021-12-18 20:18:27,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:18:27,606 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2021-12-18 20:18:27,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 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-18 20:18:27,606 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2021-12-18 20:18:27,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-18 20:18:27,607 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:18:27,607 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1] [2021-12-18 20:18:27,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-18 20:18:27,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-18 20:18:27,824 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:18:27,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:18:27,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1941957673, now seen corresponding path program 2 times [2021-12-18 20:18:27,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:18:27,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813005146] [2021-12-18 20:18:27,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:18:27,825 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:18:27,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:18:27,990 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:18:27,990 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:18:27,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813005146] [2021-12-18 20:18:27,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813005146] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:18:27,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525473678] [2021-12-18 20:18:27,991 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 20:18:27,991 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:18:27,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:18:27,992 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-18 20:18:27,993 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-18 20:18:28,034 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 20:18:28,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 20:18:28,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-18 20:18:28,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:18:28,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:18:28,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-12-18 20:18:28,056 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-18 20:18:28,208 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:18:28,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:18:28,372 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:18:28,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525473678] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:18:28,373 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:18:28,373 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2021-12-18 20:18:28,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371983501] [2021-12-18 20:18:28,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:18:28,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-18 20:18:28,374 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:18:28,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-18 20:18:28,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2021-12-18 20:18:28,375 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 21 states, 20 states have (on average 2.6) internal successors, (52), 21 states have internal predecessors, (52), 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-18 20:18:28,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:18:28,862 INFO L93 Difference]: Finished difference Result 224 states and 230 transitions. [2021-12-18 20:18:28,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 20:18:28,862 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.6) internal successors, (52), 21 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-18 20:18:28,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:18:28,863 INFO L225 Difference]: With dead ends: 224 [2021-12-18 20:18:28,863 INFO L226 Difference]: Without dead ends: 224 [2021-12-18 20:18:28,864 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=271, Invalid=599, Unknown=0, NotChecked=0, Total=870 [2021-12-18 20:18:28,864 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 766 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 20:18:28,864 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [766 Valid, 300 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 20:18:28,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-12-18 20:18:28,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 84. [2021-12-18 20:18:28,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 83 states have internal predecessors, (94), 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-18 20:18:28,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2021-12-18 20:18:28,868 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 18 [2021-12-18 20:18:28,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:18:28,868 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2021-12-18 20:18:28,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.6) internal successors, (52), 21 states have internal predecessors, (52), 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-18 20:18:28,868 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2021-12-18 20:18:28,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-18 20:18:28,869 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:18:28,869 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1] [2021-12-18 20:18:28,890 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-18 20:18:29,069 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-18 20:18:29,069 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:18:29,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:18:29,070 INFO L85 PathProgramCache]: Analyzing trace with hash 820795113, now seen corresponding path program 3 times [2021-12-18 20:18:29,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:18:29,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693573253] [2021-12-18 20:18:29,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:18:29,070 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:18:29,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:18:29,349 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:18:29,349 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:18:29,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693573253] [2021-12-18 20:18:29,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693573253] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:18:29,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096270418] [2021-12-18 20:18:29,349 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-18 20:18:29,349 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:18:29,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:18:29,350 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-18 20:18:29,383 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-18 20:18:29,434 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-18 20:18:29,434 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 20:18:29,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-18 20:18:29,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:18:29,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:18:29,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-12-18 20:18:29,454 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-18 20:18:29,633 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-12-18 20:18:29,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:18:29,920 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-12-18 20:18:29,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096270418] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:18:29,921 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:18:29,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5, 5] total 22 [2021-12-18 20:18:29,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979559879] [2021-12-18 20:18:29,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:18:29,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-18 20:18:29,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:18:29,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-18 20:18:29,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=347, Unknown=0, NotChecked=0, Total=506 [2021-12-18 20:18:29,922 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 23 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-18 20:18:30,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:18:30,535 INFO L93 Difference]: Finished difference Result 327 states and 336 transitions. [2021-12-18 20:18:30,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-18 20:18:30,536 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 23 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) Word has length 36 [2021-12-18 20:18:30,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:18:30,537 INFO L225 Difference]: With dead ends: 327 [2021-12-18 20:18:30,537 INFO L226 Difference]: Without dead ends: 327 [2021-12-18 20:18:30,537 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=570, Unknown=0, NotChecked=0, Total=870 [2021-12-18 20:18:30,538 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 1788 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1788 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 20:18:30,538 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1788 Valid, 368 Invalid, 1143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-18 20:18:30,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-12-18 20:18:30,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 88. [2021-12-18 20:18:30,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 75 states have (on average 1.3066666666666666) internal successors, (98), 87 states have internal predecessors, (98), 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-18 20:18:30,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2021-12-18 20:18:30,542 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 36 [2021-12-18 20:18:30,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:18:30,542 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2021-12-18 20:18:30,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 23 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-18 20:18:30,542 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2021-12-18 20:18:30,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-18 20:18:30,543 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:18:30,543 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:18:30,562 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-18 20:18:30,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:18:30,755 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:18:30,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:18:30,756 INFO L85 PathProgramCache]: Analyzing trace with hash 15618195, now seen corresponding path program 1 times [2021-12-18 20:18:30,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:18:30,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932179211] [2021-12-18 20:18:30,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:18:30,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:18:30,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:18:30,791 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-12-18 20:18:30,791 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:18:30,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932179211] [2021-12-18 20:18:30,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932179211] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:18:30,791 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:18:30,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 20:18:30,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258223856] [2021-12-18 20:18:30,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:18:30,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 20:18:30,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:18:30,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 20:18:30,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 20:18:30,793 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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-18 20:18:30,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:18:30,816 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2021-12-18 20:18:30,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 20:18:30,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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 44 [2021-12-18 20:18:30,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:18:30,818 INFO L225 Difference]: With dead ends: 86 [2021-12-18 20:18:30,818 INFO L226 Difference]: Without dead ends: 86 [2021-12-18 20:18:30,818 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 20:18:30,819 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 16 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 20:18:30,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 59 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 20:18:30,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-12-18 20:18:30,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2021-12-18 20:18:30,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 85 states have internal predecessors, (92), 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-18 20:18:30,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2021-12-18 20:18:30,822 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 44 [2021-12-18 20:18:30,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:18:30,822 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2021-12-18 20:18:30,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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-18 20:18:30,822 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2021-12-18 20:18:30,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-18 20:18:30,823 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:18:30,823 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:18:30,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-18 20:18:30,823 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:18:30,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:18:30,824 INFO L85 PathProgramCache]: Analyzing trace with hash 15618196, now seen corresponding path program 1 times [2021-12-18 20:18:30,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:18:30,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814873162] [2021-12-18 20:18:30,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:18:30,824 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:18:30,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:18:30,959 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:18:30,960 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:18:30,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814873162] [2021-12-18 20:18:30,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814873162] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:18:30,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112479639] [2021-12-18 20:18:30,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:18:30,960 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:18:30,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:18:30,963 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-18 20:18:30,965 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-18 20:18:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:18:31,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-18 20:18:31,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:18:31,267 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:18:31,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:18:31,519 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:18:31,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112479639] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:18:31,519 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:18:31,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 43 [2021-12-18 20:18:31,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368689647] [2021-12-18 20:18:31,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:18:31,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-12-18 20:18:31,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:18:31,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-12-18 20:18:31,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=787, Invalid=1019, Unknown=0, NotChecked=0, Total=1806 [2021-12-18 20:18:31,522 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 43 states, 43 states have (on average 2.8372093023255816) internal successors, (122), 43 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-18 20:18:31,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:18:31,985 INFO L93 Difference]: Finished difference Result 536 states and 550 transitions. [2021-12-18 20:18:31,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-12-18 20:18:31,986 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.8372093023255816) internal successors, (122), 43 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) Word has length 44 [2021-12-18 20:18:31,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:18:31,988 INFO L225 Difference]: With dead ends: 536 [2021-12-18 20:18:31,988 INFO L226 Difference]: Without dead ends: 536 [2021-12-18 20:18:31,989 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1037 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1190, Invalid=1890, Unknown=0, NotChecked=0, Total=3080 [2021-12-18 20:18:31,989 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 1606 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1606 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 20:18:31,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1606 Valid, 415 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 20:18:31,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2021-12-18 20:18:31,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 152. [2021-12-18 20:18:31,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 141 states have (on average 1.177304964539007) internal successors, (166), 151 states have internal predecessors, (166), 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-18 20:18:31,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 166 transitions. [2021-12-18 20:18:31,993 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 166 transitions. Word has length 44 [2021-12-18 20:18:31,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:18:31,994 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 166 transitions. [2021-12-18 20:18:31,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.8372093023255816) internal successors, (122), 43 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-18 20:18:31,994 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 166 transitions. [2021-12-18 20:18:31,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-12-18 20:18:31,995 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:18:31,995 INFO L514 BasicCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:18:32,014 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-18 20:18:32,209 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-18 20:18:32,210 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:18:32,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:18:32,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1639898028, now seen corresponding path program 2 times [2021-12-18 20:18:32,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:18:32,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887555390] [2021-12-18 20:18:32,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:18:32,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:18:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:18:32,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:18:32,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:18:32,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887555390] [2021-12-18 20:18:32,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887555390] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:18:32,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301198890] [2021-12-18 20:18:32,543 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 20:18:32,543 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:18:32,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:18:32,544 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-18 20:18:32,545 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-18 20:18:32,599 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-18 20:18:32,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 20:18:32,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-18 20:18:32,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:18:32,628 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 20:18:32,628 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 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-18 20:18:32,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1001 trivial. 0 not checked. [2021-12-18 20:18:32,967 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:18:32,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301198890] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:18:32,968 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 20:18:32,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [30] total 32 [2021-12-18 20:18:32,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523260141] [2021-12-18 20:18:32,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:18:32,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 20:18:32,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:18:32,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 20:18:32,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=414, Invalid=578, Unknown=0, NotChecked=0, Total=992 [2021-12-18 20:18:32,970 INFO L87 Difference]: Start difference. First operand 152 states and 166 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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-18 20:18:32,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:18:32,990 INFO L93 Difference]: Finished difference Result 128 states and 140 transitions. [2021-12-18 20:18:32,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 20:18:32,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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 86 [2021-12-18 20:18:32,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:18:32,991 INFO L225 Difference]: With dead ends: 128 [2021-12-18 20:18:32,991 INFO L226 Difference]: Without dead ends: 128 [2021-12-18 20:18:32,992 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=414, Invalid=578, Unknown=0, NotChecked=0, Total=992 [2021-12-18 20:18:32,992 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 12 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 20:18:32,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 8 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 20:18:32,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-12-18 20:18:32,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2021-12-18 20:18:32,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 126 states have (on average 1.1111111111111112) internal successors, (140), 127 states have internal predecessors, (140), 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-18 20:18:32,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2021-12-18 20:18:32,995 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 86 [2021-12-18 20:18:32,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:18:32,995 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2021-12-18 20:18:32,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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-18 20:18:32,996 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2021-12-18 20:18:33,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-12-18 20:18:33,002 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:18:33,002 INFO L514 BasicCegarLoop]: trace histogram [26, 26, 26, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:18:33,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-18 20:18:33,211 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-18 20:18:33,211 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:18:33,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:18:33,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1050815861, now seen corresponding path program 1 times [2021-12-18 20:18:33,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:18:33,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946365976] [2021-12-18 20:18:33,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:18:33,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:18:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:18:33,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1003 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-18 20:18:33,578 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:18:33,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946365976] [2021-12-18 20:18:33,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946365976] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:18:33,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801967449] [2021-12-18 20:18:33,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:18:33,579 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:18:33,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:18:33,580 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-18 20:18:33,581 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-18 20:18:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:18:33,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-18 20:18:33,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:18:34,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1003 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-18 20:18:34,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:18:35,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1003 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-18 20:18:35,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801967449] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:18:35,166 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:18:35,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 85 [2021-12-18 20:18:35,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684399273] [2021-12-18 20:18:35,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:18:35,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2021-12-18 20:18:35,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:18:35,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2021-12-18 20:18:35,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3139, Invalid=4001, Unknown=0, NotChecked=0, Total=7140 [2021-12-18 20:18:35,169 INFO L87 Difference]: Start difference. First operand 128 states and 140 transitions. Second operand has 85 states, 85 states have (on average 2.9411764705882355) internal successors, (250), 85 states have internal predecessors, (250), 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-18 20:18:36,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:18:36,467 INFO L93 Difference]: Finished difference Result 461 states and 462 transitions. [2021-12-18 20:18:36,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2021-12-18 20:18:36,471 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 85 states have (on average 2.9411764705882355) internal successors, (250), 85 states have internal predecessors, (250), 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 89 [2021-12-18 20:18:36,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:18:36,475 INFO L225 Difference]: With dead ends: 461 [2021-12-18 20:18:36,475 INFO L226 Difference]: Without dead ends: 461 [2021-12-18 20:18:36,477 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4425 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=4732, Invalid=7700, Unknown=0, NotChecked=0, Total=12432 [2021-12-18 20:18:36,478 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 1563 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1563 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 445 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 20:18:36,478 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1563 Valid, 76 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [445 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-18 20:18:36,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2021-12-18 20:18:36,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 254. [2021-12-18 20:18:36,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 252 states have (on average 1.1111111111111112) internal successors, (280), 253 states have internal predecessors, (280), 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-18 20:18:36,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 280 transitions. [2021-12-18 20:18:36,482 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 280 transitions. Word has length 89 [2021-12-18 20:18:36,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:18:36,482 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 280 transitions. [2021-12-18 20:18:36,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 2.9411764705882355) internal successors, (250), 85 states have internal predecessors, (250), 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-18 20:18:36,483 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 280 transitions. [2021-12-18 20:18:36,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-12-18 20:18:36,487 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:18:36,488 INFO L514 BasicCegarLoop]: trace histogram [54, 54, 54, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:18:36,506 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-18 20:18:36,695 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-18 20:18:36,695 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:18:36,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:18:36,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1332910603, now seen corresponding path program 2 times [2021-12-18 20:18:36,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:18:36,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491384089] [2021-12-18 20:18:36,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:18:36,696 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:18:36,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:18:37,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4349 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-18 20:18:37,812 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:18:37,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491384089] [2021-12-18 20:18:37,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491384089] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:18:37,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867911915] [2021-12-18 20:18:37,812 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 20:18:37,812 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:18:37,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:18:37,815 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-18 20:18:37,815 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-18 20:18:37,962 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 20:18:37,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 20:18:37,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 57 conjunts are in the unsatisfiable core [2021-12-18 20:18:37,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:18:39,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4349 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-18 20:18:39,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:18:42,495 INFO L134 CoverageAnalysis]: Checked inductivity of 4349 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-18 20:18:42,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867911915] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:18:42,496 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:18:42,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 169 [2021-12-18 20:18:42,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036493470] [2021-12-18 20:18:42,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:18:42,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 169 states [2021-12-18 20:18:42,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:18:42,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2021-12-18 20:18:42,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12547, Invalid=15845, Unknown=0, NotChecked=0, Total=28392 [2021-12-18 20:18:42,505 INFO L87 Difference]: Start difference. First operand 254 states and 280 transitions. Second operand has 169 states, 169 states have (on average 2.970414201183432) internal successors, (502), 169 states have internal predecessors, (502), 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-18 20:18:48,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:18:48,200 INFO L93 Difference]: Finished difference Result 937 states and 938 transitions. [2021-12-18 20:18:48,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2021-12-18 20:18:48,201 INFO L78 Accepts]: Start accepts. Automaton has has 169 states, 169 states have (on average 2.970414201183432) internal successors, (502), 169 states have internal predecessors, (502), 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 173 [2021-12-18 20:18:48,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:18:48,203 INFO L225 Difference]: With dead ends: 937 [2021-12-18 20:18:48,203 INFO L226 Difference]: Without dead ends: 937 [2021-12-18 20:18:48,207 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18257 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=18872, Invalid=31080, Unknown=0, NotChecked=0, Total=49952 [2021-12-18 20:18:48,209 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 2977 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 734 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2977 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 1779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 734 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-18 20:18:48,209 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2977 Valid, 136 Invalid, 1779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [734 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-18 20:18:48,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2021-12-18 20:18:48,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 506. [2021-12-18 20:18:48,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 504 states have (on average 1.1111111111111112) internal successors, (560), 505 states have internal predecessors, (560), 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-18 20:18:48,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 560 transitions. [2021-12-18 20:18:48,216 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 560 transitions. Word has length 173 [2021-12-18 20:18:48,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:18:48,217 INFO L470 AbstractCegarLoop]: Abstraction has 506 states and 560 transitions. [2021-12-18 20:18:48,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 169 states, 169 states have (on average 2.970414201183432) internal successors, (502), 169 states have internal predecessors, (502), 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-18 20:18:48,218 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 560 transitions. [2021-12-18 20:18:48,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2021-12-18 20:18:48,220 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:18:48,220 INFO L514 BasicCegarLoop]: trace histogram [110, 110, 110, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:18:48,240 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-18 20:18:48,436 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-18 20:18:48,437 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:18:48,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:18:48,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1249634571, now seen corresponding path program 3 times [2021-12-18 20:18:48,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:18:48,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791435135] [2021-12-18 20:18:48,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:18:48,438 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:18:48,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:18:52,523 INFO L134 CoverageAnalysis]: Checked inductivity of 18097 backedges. 0 proven. 18095 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-18 20:18:52,523 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:18:52,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791435135] [2021-12-18 20:18:52,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791435135] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:18:52,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394323593] [2021-12-18 20:18:52,524 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-18 20:18:52,524 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:18:52,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:18:52,525 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-18 20:18:52,526 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-18 20:18:52,644 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-18 20:18:52,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 20:18:52,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-18 20:18:52,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:18:52,664 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 20:18:52,664 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 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-18 20:18:54,038 INFO L134 CoverageAnalysis]: Checked inductivity of 18097 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18095 trivial. 0 not checked. [2021-12-18 20:18:54,038 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:18:54,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394323593] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:18:54,038 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 20:18:54,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [114] total 118 [2021-12-18 20:18:54,039 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555246466] [2021-12-18 20:18:54,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:18:54,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 20:18:54,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:18:54,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 20:18:54,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6345, Invalid=7461, Unknown=0, NotChecked=0, Total=13806 [2021-12-18 20:18:54,040 INFO L87 Difference]: Start difference. First operand 506 states and 560 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:18:54,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:18:54,071 INFO L93 Difference]: Finished difference Result 505 states and 506 transitions. [2021-12-18 20:18:54,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 20:18:54,071 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 341 [2021-12-18 20:18:54,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:18:54,073 INFO L225 Difference]: With dead ends: 505 [2021-12-18 20:18:54,073 INFO L226 Difference]: Without dead ends: 505 [2021-12-18 20:18:54,074 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=6345, Invalid=7461, Unknown=0, NotChecked=0, Total=13806 [2021-12-18 20:18:54,074 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 14 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 20:18:54,074 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 6 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 20:18:54,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-12-18 20:18:54,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2021-12-18 20:18:54,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 504 states have (on average 1.003968253968254) internal successors, (506), 504 states have internal predecessors, (506), 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-18 20:18:54,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 506 transitions. [2021-12-18 20:18:54,079 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 506 transitions. Word has length 341 [2021-12-18 20:18:54,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:18:54,080 INFO L470 AbstractCegarLoop]: Abstraction has 505 states and 506 transitions. [2021-12-18 20:18:54,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:18:54,080 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 506 transitions. [2021-12-18 20:18:54,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2021-12-18 20:18:54,085 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:18:54,085 INFO L514 BasicCegarLoop]: trace histogram [110, 110, 110, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:18:54,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-18 20:18:54,301 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-18 20:18:54,302 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:18:54,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:18:54,302 INFO L85 PathProgramCache]: Analyzing trace with hash -385350866, now seen corresponding path program 1 times [2021-12-18 20:18:54,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:18:54,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661464438] [2021-12-18 20:18:54,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:18:54,303 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:18:54,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:18:58,384 INFO L134 CoverageAnalysis]: Checked inductivity of 22605 backedges. 0 proven. 18095 refuted. 0 times theorem prover too weak. 4510 trivial. 0 not checked. [2021-12-18 20:18:58,385 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:18:58,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661464438] [2021-12-18 20:18:58,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661464438] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:18:58,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601001416] [2021-12-18 20:18:58,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:18:58,385 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:18:58,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:18:58,386 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-18 20:18:58,387 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-18 20:18:58,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:18:58,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 1893 conjuncts, 113 conjunts are in the unsatisfiable core [2021-12-18 20:18:58,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:19:03,952 INFO L134 CoverageAnalysis]: Checked inductivity of 22605 backedges. 0 proven. 18095 refuted. 0 times theorem prover too weak. 4510 trivial. 0 not checked. [2021-12-18 20:19:03,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:19:06,012 INFO L134 CoverageAnalysis]: Checked inductivity of 22605 backedges. 0 proven. 18095 refuted. 0 times theorem prover too weak. 4510 trivial. 0 not checked. [2021-12-18 20:19:06,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601001416] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:19:06,012 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:19:06,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [114, 114, 114] total 243 [2021-12-18 20:19:06,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384519996] [2021-12-18 20:19:06,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:19:06,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 243 states [2021-12-18 20:19:06,015 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:19:06,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 243 interpolants. [2021-12-18 20:19:06,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23154, Invalid=35652, Unknown=0, NotChecked=0, Total=58806 [2021-12-18 20:19:06,021 INFO L87 Difference]: Start difference. First operand 505 states and 506 transitions. Second operand has 243 states, 243 states have (on average 3.0) internal successors, (729), 243 states have internal predecessors, (729), 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-18 20:19:13,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:19:13,170 INFO L93 Difference]: Finished difference Result 823 states and 824 transitions. [2021-12-18 20:19:13,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2021-12-18 20:19:13,171 INFO L78 Accepts]: Start accepts. Automaton has has 243 states, 243 states have (on average 3.0) internal successors, (729), 243 states have internal predecessors, (729), 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 504 [2021-12-18 20:19:13,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:19:13,173 INFO L225 Difference]: With dead ends: 823 [2021-12-18 20:19:13,173 INFO L226 Difference]: Without dead ends: 823 [2021-12-18 20:19:13,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1137 GetRequests, 878 SyntacticMatches, 1 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30957 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=25415, Invalid=41925, Unknown=0, NotChecked=0, Total=67340 [2021-12-18 20:19:13,176 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 2554 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 997 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2554 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 2146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 997 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-18 20:19:13,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2554 Valid, 63 Invalid, 2146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [997 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-18 20:19:13,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2021-12-18 20:19:13,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 727. [2021-12-18 20:19:13,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 726 states have (on average 1.002754820936639) internal successors, (728), 726 states have internal predecessors, (728), 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-18 20:19:13,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 728 transitions. [2021-12-18 20:19:13,183 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 728 transitions. Word has length 504 [2021-12-18 20:19:13,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:19:13,183 INFO L470 AbstractCegarLoop]: Abstraction has 727 states and 728 transitions. [2021-12-18 20:19:13,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 243 states, 243 states have (on average 3.0) internal successors, (729), 243 states have internal predecessors, (729), 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-18 20:19:13,184 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 728 transitions. [2021-12-18 20:19:13,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 727 [2021-12-18 20:19:13,187 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:19:13,187 INFO L514 BasicCegarLoop]: trace histogram [128, 128, 128, 111, 111, 111, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:19:13,205 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-18 20:19:13,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-18 20:19:13,404 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:19:13,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:19:13,404 INFO L85 PathProgramCache]: Analyzing trace with hash 972365294, now seen corresponding path program 2 times [2021-12-18 20:19:13,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:19:13,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762915246] [2021-12-18 20:19:13,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:19:13,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:19:13,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:19:17,190 INFO L134 CoverageAnalysis]: Checked inductivity of 42938 backedges. 0 proven. 18426 refuted. 0 times theorem prover too weak. 24512 trivial. 0 not checked. [2021-12-18 20:19:17,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:19:17,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762915246] [2021-12-18 20:19:17,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762915246] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:19:17,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923855408] [2021-12-18 20:19:17,190 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 20:19:17,190 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:19:17,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:19:17,192 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-18 20:19:17,192 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-18 20:19:17,644 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 20:19:17,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 20:19:17,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 2707 conjuncts, 113 conjunts are in the unsatisfiable core [2021-12-18 20:19:17,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:19:18,627 INFO L134 CoverageAnalysis]: Checked inductivity of 42938 backedges. 0 proven. 18426 refuted. 0 times theorem prover too weak. 24512 trivial. 0 not checked. [2021-12-18 20:19:18,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:19:20,365 INFO L134 CoverageAnalysis]: Checked inductivity of 42938 backedges. 0 proven. 18426 refuted. 0 times theorem prover too weak. 24512 trivial. 0 not checked. [2021-12-18 20:19:20,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923855408] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:19:20,365 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:19:20,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [114, 114, 114] total 130 [2021-12-18 20:19:20,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588441583] [2021-12-18 20:19:20,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:19:20,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 130 states [2021-12-18 20:19:20,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:19:20,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2021-12-18 20:19:20,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2021-12-18 20:19:20,370 INFO L87 Difference]: Start difference. First operand 727 states and 728 transitions. Second operand has 130 states, 130 states have (on average 3.046153846153846) internal successors, (396), 130 states have internal predecessors, (396), 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-18 20:19:22,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:19:22,972 INFO L93 Difference]: Finished difference Result 775 states and 776 transitions. [2021-12-18 20:19:22,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2021-12-18 20:19:22,972 INFO L78 Accepts]: Start accepts. Automaton has has 130 states, 130 states have (on average 3.046153846153846) internal successors, (396), 130 states have internal predecessors, (396), 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 726 [2021-12-18 20:19:22,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:19:22,975 INFO L225 Difference]: With dead ends: 775 [2021-12-18 20:19:22,975 INFO L226 Difference]: Without dead ends: 775 [2021-12-18 20:19:22,976 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1564 GetRequests, 1435 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2021-12-18 20:19:22,976 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 1192 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 475 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1192 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 475 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-18 20:19:22,977 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1192 Valid, 39 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [475 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-18 20:19:22,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2021-12-18 20:19:22,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 775. [2021-12-18 20:19:22,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 774 states have (on average 1.0025839793281655) internal successors, (776), 774 states have internal predecessors, (776), 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-18 20:19:22,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 776 transitions. [2021-12-18 20:19:22,985 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 776 transitions. Word has length 726 [2021-12-18 20:19:22,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:19:22,985 INFO L470 AbstractCegarLoop]: Abstraction has 775 states and 776 transitions. [2021-12-18 20:19:22,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 130 states, 130 states have (on average 3.046153846153846) internal successors, (396), 130 states have internal predecessors, (396), 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-18 20:19:22,986 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 776 transitions. [2021-12-18 20:19:22,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 775 [2021-12-18 20:19:22,989 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:19:22,989 INFO L514 BasicCegarLoop]: trace histogram [128, 128, 128, 127, 127, 127, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:19:23,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-12-18 20:19:23,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-18 20:19:23,207 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:19:23,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:19:23,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1306820846, now seen corresponding path program 3 times [2021-12-18 20:19:23,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:19:23,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799217516] [2021-12-18 20:19:23,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:19:23,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:19:23,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-18 20:19:23,554 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-18 20:19:23,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-18 20:19:24,002 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-18 20:19:24,002 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-18 20:19:24,003 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr7REQUIRES_VIOLATION (20 of 21 remaining) [2021-12-18 20:19:24,004 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (19 of 21 remaining) [2021-12-18 20:19:24,004 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (18 of 21 remaining) [2021-12-18 20:19:24,005 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (17 of 21 remaining) [2021-12-18 20:19:24,005 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (16 of 21 remaining) [2021-12-18 20:19:24,005 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (15 of 21 remaining) [2021-12-18 20:19:24,005 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (14 of 21 remaining) [2021-12-18 20:19:24,005 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (13 of 21 remaining) [2021-12-18 20:19:24,005 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (12 of 21 remaining) [2021-12-18 20:19:24,006 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE (11 of 21 remaining) [2021-12-18 20:19:24,006 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (10 of 21 remaining) [2021-12-18 20:19:24,006 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (9 of 21 remaining) [2021-12-18 20:19:24,006 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (8 of 21 remaining) [2021-12-18 20:19:24,006 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE (7 of 21 remaining) [2021-12-18 20:19:24,006 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE (6 of 21 remaining) [2021-12-18 20:19:24,006 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE (5 of 21 remaining) [2021-12-18 20:19:24,006 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (4 of 21 remaining) [2021-12-18 20:19:24,007 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (3 of 21 remaining) [2021-12-18 20:19:24,007 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (2 of 21 remaining) [2021-12-18 20:19:24,007 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE (1 of 21 remaining) [2021-12-18 20:19:24,007 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (0 of 21 remaining) [2021-12-18 20:19:24,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-18 20:19:24,009 INFO L732 BasicCegarLoop]: Path program histogram: [3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2021-12-18 20:19:24,013 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-18 20:19:24,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:19:24 BoogieIcfgContainer [2021-12-18 20:19:24,169 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-18 20:19:24,169 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-18 20:19:24,169 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-18 20:19:24,170 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-18 20:19:24,170 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:18:26" (3/4) ... [2021-12-18 20:19:24,171 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-18 20:19:24,324 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-18 20:19:24,324 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-18 20:19:24,325 INFO L158 Benchmark]: Toolchain (without parser) took 58681.54ms. Allocated memory was 92.3MB in the beginning and 698.4MB in the end (delta: 606.1MB). Free memory was 58.6MB in the beginning and 597.0MB in the end (delta: -538.3MB). Peak memory consumption was 441.2MB. Max. memory is 16.1GB. [2021-12-18 20:19:24,325 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 92.3MB. Free memory was 46.9MB in the beginning and 46.9MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 20:19:24,326 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.08ms. Allocated memory is still 92.3MB. Free memory was 58.5MB in the beginning and 61.3MB in the end (delta: -2.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-18 20:19:24,326 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.86ms. Allocated memory is still 92.3MB. Free memory was 61.3MB in the beginning and 59.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 20:19:24,326 INFO L158 Benchmark]: Boogie Preprocessor took 15.22ms. Allocated memory is still 92.3MB. Free memory was 59.6MB in the beginning and 58.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-18 20:19:24,326 INFO L158 Benchmark]: RCFGBuilder took 324.98ms. Allocated memory was 92.3MB in the beginning and 119.5MB in the end (delta: 27.3MB). Free memory was 58.1MB in the beginning and 96.8MB in the end (delta: -38.8MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2021-12-18 20:19:24,326 INFO L158 Benchmark]: TraceAbstraction took 57881.41ms. Allocated memory was 119.5MB in the beginning and 698.4MB in the end (delta: 578.8MB). Free memory was 96.3MB in the beginning and 235.2MB in the end (delta: -138.9MB). Peak memory consumption was 438.6MB. Max. memory is 16.1GB. [2021-12-18 20:19:24,328 INFO L158 Benchmark]: Witness Printer took 155.11ms. Allocated memory is still 698.4MB. Free memory was 235.2MB in the beginning and 597.0MB in the end (delta: -361.8MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2021-12-18 20:19:24,331 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 92.3MB. Free memory was 46.9MB in the beginning and 46.9MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.08ms. Allocated memory is still 92.3MB. Free memory was 58.5MB in the beginning and 61.3MB in the end (delta: -2.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.86ms. Allocated memory is still 92.3MB. Free memory was 61.3MB in the beginning and 59.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 15.22ms. Allocated memory is still 92.3MB. Free memory was 59.6MB in the beginning and 58.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 324.98ms. Allocated memory was 92.3MB in the beginning and 119.5MB in the end (delta: 27.3MB). Free memory was 58.1MB in the beginning and 96.8MB in the end (delta: -38.8MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * TraceAbstraction took 57881.41ms. Allocated memory was 119.5MB in the beginning and 698.4MB in the end (delta: 578.8MB). Free memory was 96.3MB in the beginning and 235.2MB in the end (delta: -138.9MB). Peak memory consumption was 438.6MB. Max. memory is 16.1GB. * Witness Printer took 155.11ms. Allocated memory is still 698.4MB. Free memory was 235.2MB in the beginning and 597.0MB in the end (delta: -361.8MB). Peak memory consumption was 13.6MB. 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: 540]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L523] int *a, *b; [L524] int n; VAL [a={0:0}, b={0:0}, n=0] [L535] n = 128 [L536] a = malloc (n * sizeof(*a)) [L537] b = malloc (n * sizeof(*b)) [L538] EXPR b++ VAL [a={-3:0}, b={-2:4}, b++={-2:0}, n=128] [L538] *b++ = 0 VAL [a={-3:0}, b={-2:4}, b++={-2:0}, n=128] [L539] CALL foo () [L527] int i; [L528] i = 0 VAL [a={-3:0}, b={-2:4}, i=0, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=0, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=0, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=1, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=1, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=1, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=2, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=2, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=2, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=3, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=3, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=3, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=4, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=4, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=4, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=5, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=5, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=5, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=6, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=6, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=6, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=7, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=7, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=7, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=8, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=8, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=8, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=9, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=9, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=9, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=10, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=10, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=10, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=11, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=11, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=11, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=12, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=12, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=12, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=13, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=13, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=13, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=14, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=14, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=14, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=15, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=15, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=15, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=16, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=16, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=16, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=17, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=17, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=17, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=18, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=18, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=18, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=19, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=19, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=19, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=20, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=20, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=20, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=21, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=21, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=21, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=22, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=22, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=22, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=23, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=23, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=23, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=24, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=24, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=24, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=25, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=25, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=25, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=26, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=26, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=26, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=27, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=27, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=27, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=28, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=28, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=28, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=29, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=29, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=29, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=30, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=30, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=30, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=31, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=31, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=31, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=32, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=32, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=32, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=33, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=33, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=33, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=34, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=34, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=34, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=35, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=35, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=35, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=36, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=36, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=36, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=37, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=37, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=37, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=38, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=38, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=38, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=39, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=39, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=39, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=40, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=40, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=40, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=41, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=41, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=41, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=42, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=42, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=42, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=43, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=43, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=43, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=44, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=44, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=44, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=45, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=45, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=45, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=46, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=46, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=46, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=47, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=47, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=47, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=48, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=48, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=48, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=49, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=49, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=49, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=50, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=50, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=50, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=51, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=51, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=51, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=52, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=52, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=52, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=53, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=53, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=53, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=54, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=54, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=54, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=55, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=55, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=55, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=56, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=56, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=56, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=57, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=57, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=57, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=58, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=58, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=58, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=59, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=59, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=59, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=60, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=60, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=60, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=61, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=61, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=61, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=62, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=62, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=62, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=63, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=63, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=63, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=64, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=64, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=64, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=65, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=65, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=65, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=66, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=66, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=66, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=67, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=67, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=67, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=68, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=68, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=68, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=69, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=69, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=69, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=70, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=70, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=70, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=71, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=71, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=71, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=72, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=72, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=72, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=73, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=73, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=73, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=74, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=74, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=74, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=75, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=75, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=75, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=76, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=76, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=76, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=77, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=77, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=77, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=78, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=78, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=78, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=79, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=79, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=79, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=80, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=80, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=80, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=81, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=81, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=81, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=82, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=82, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=82, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=83, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=83, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=83, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=84, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=84, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=84, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=85, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=85, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=85, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=86, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=86, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=86, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=87, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=87, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=87, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=88, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=88, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=88, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=89, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=89, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=89, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=90, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=90, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=90, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=91, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=91, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=91, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=92, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=92, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=92, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=93, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=93, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=93, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=94, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=94, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=94, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=95, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=95, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=95, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=96, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=96, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=96, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=97, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=97, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=97, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=98, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=98, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=98, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=99, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=99, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=99, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=100, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=100, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=100, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=101, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=101, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=101, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=102, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=102, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=102, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=103, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=103, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=103, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=104, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=104, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=104, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=105, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=105, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=105, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=106, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=106, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=106, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=107, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=107, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=107, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=108, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=108, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=108, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=109, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=109, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=109, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=110, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=110, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=110, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=111, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=111, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=111, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=112, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=112, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=112, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=113, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=113, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=113, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=114, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=114, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=114, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=115, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=115, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=115, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=116, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=116, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=116, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=117, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=117, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=117, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=118, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=118, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=118, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=119, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=119, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=119, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=120, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=120, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=120, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=121, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=121, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=121, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=122, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=122, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=122, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=123, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=123, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=123, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=124, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=124, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=124, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=125, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=125, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=125, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=126, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=126, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=126, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=127, n=128] [L528] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=127, n=128] [L529] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=127, n=128] [L528] i++ VAL [a={-3:0}, b={-2:4}, i=128, n=128] [L528] COND FALSE !(i < n) VAL [a={-3:0}, b={-2:4}, i=128, n=128] [L530] i = 0 VAL [a={-3:0}, b={-2:4}, i=0, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=0, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=0, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=1, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=1, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=1, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=2, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=2, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=2, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=3, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=3, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=3, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=4, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=4, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=4, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=5, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=5, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=5, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=6, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=6, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=6, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=7, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=7, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=7, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=8, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=8, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=8, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=9, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=9, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=9, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=10, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=10, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=10, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=11, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=11, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=11, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=12, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=12, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=12, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=13, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=13, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=13, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=14, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=14, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=14, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=15, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=15, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=15, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=16, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=16, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=16, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=17, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=17, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=17, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=18, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=18, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=18, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=19, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=19, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=19, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=20, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=20, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=20, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=21, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=21, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=21, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=22, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=22, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=22, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=23, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=23, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=23, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=24, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=24, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=24, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=25, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=25, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=25, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=26, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=26, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=26, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=27, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=27, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=27, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=28, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=28, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=28, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=29, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=29, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=29, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=30, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=30, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=30, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=31, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=31, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=31, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=32, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=32, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=32, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=33, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=33, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=33, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=34, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=34, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=34, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=35, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=35, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=35, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=36, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=36, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=36, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=37, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=37, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=37, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=38, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=38, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=38, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=39, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=39, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=39, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=40, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=40, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=40, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=41, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=41, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=41, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=42, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=42, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=42, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=43, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=43, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=43, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=44, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=44, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=44, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=45, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=45, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=45, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=46, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=46, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=46, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=47, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=47, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=47, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=48, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=48, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=48, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=49, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=49, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=49, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=50, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=50, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=50, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=51, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=51, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=51, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=52, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=52, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=52, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=53, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=53, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=53, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=54, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=54, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=54, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=55, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=55, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=55, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=56, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=56, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=56, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=57, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=57, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=57, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=58, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=58, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=58, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=59, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=59, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=59, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=60, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=60, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=60, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=61, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=61, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=61, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=62, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=62, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=62, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=63, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=63, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=63, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=64, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=64, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=64, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=65, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=65, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=65, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=66, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=66, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=66, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=67, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=67, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=67, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=68, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=68, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=68, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=69, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=69, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=69, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=70, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=70, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=70, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=71, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=71, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=71, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=72, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=72, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=72, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=73, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=73, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=73, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=74, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=74, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=74, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=75, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=75, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=75, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=76, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=76, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=76, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=77, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=77, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=77, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=78, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=78, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=78, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=79, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=79, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=79, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=80, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=80, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=80, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=81, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=81, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=81, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=82, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=82, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=82, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=83, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=83, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=83, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=84, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=84, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=84, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=85, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=85, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=85, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=86, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=86, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=86, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=87, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=87, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=87, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=88, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=88, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=88, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=89, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=89, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=89, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=90, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=90, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=90, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=91, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=91, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=91, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=92, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=92, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=92, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=93, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=93, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=93, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=94, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=94, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=94, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=95, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=95, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=95, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=96, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=96, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=96, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=97, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=97, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=97, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=98, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=98, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=98, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=99, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=99, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=99, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=100, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=100, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=100, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=101, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=101, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=101, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=102, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=102, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=102, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=103, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=103, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=103, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=104, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=104, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=104, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=105, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=105, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=105, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=106, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=106, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=106, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=107, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=107, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=107, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=108, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=108, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=108, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=109, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=109, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=109, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=110, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=110, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=110, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=111, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=111, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=111, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=112, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=112, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=112, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=113, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=113, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=113, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=114, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=114, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=114, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=115, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=115, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=115, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=116, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=116, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=116, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=117, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=117, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=117, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=118, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=118, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=118, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=119, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=119, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=119, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=120, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=120, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=120, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=121, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=121, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=121, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=122, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=122, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=122, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=123, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=123, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=123, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=124, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=124, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=124, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=125, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=125, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=125, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=126, n=128] [L530] COND TRUE i < 128 - 1 VAL [a={-3:0}, b={-2:4}, i=126, n=128] [L531] b[i] = -1 VAL [a={-3:0}, b={-2:4}, i=126, n=128] [L530] i++ VAL [a={-3:0}, b={-2:4}, i=127, n=128] [L530] COND FALSE !(i < 128 - 1) VAL [a={-3:0}, b={-2:4}, i=127, n=128] [L539] RET foo () [L540] b[-2] - UnprovableResult [Line: 538]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 529]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 529]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 531]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 531]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 540]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 543]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 533]: 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, 51 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 57.7s, OverallIterations: 17, TraceHistogramMax: 128, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 18.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12920 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12920 mSDsluCounter, 1956 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1575 mSDsCounter, 3048 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5722 IncrementalHoareTripleChecker+Invalid, 8770 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3048 mSolverCounterUnsat, 381 mSDtfsCounter, 5722 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4260 GetRequests, 3259 SyntacticMatches, 2 SemanticMatches, 999 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55980 ImplicationChecksByTransitivity, 29.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=775occurred in iteration=16, InterpolantAutomatonStates: 533, 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, 16 MinimizatonAttempts, 1543 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 33.4s InterpolantComputationTime, 4896 NumberOfCodeBlocks, 4464 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 5687 ConstructedInterpolants, 0 QuantifiedInterpolants, 25312 SizeOfPredicates, 29 NumberOfNonLiveVariables, 6329 ConjunctsInSsa, 399 ConjunctsInUnsatCore, 34 InterpolantComputations, 8 PerfectInterpolantSequences, 106659/252270 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-18 20:19:24,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 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)