./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3a877d22 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2bd23b8476745cc5eeb44766af6c01d42c768ef8188ecd9b3f71230eca21db6b --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 10:44:10,451 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 10:44:10,453 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 10:44:10,499 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 10:44:10,500 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 10:44:10,506 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 10:44:10,508 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 10:44:10,513 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 10:44:10,516 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 10:44:10,536 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 10:44:10,536 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 10:44:10,537 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 10:44:10,537 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 10:44:10,539 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 10:44:10,540 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 10:44:10,541 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 10:44:10,542 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 10:44:10,543 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 10:44:10,544 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 10:44:10,548 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 10:44:10,551 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 10:44:10,551 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 10:44:10,552 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 10:44:10,553 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 10:44:10,555 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 10:44:10,556 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 10:44:10,556 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 10:44:10,557 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 10:44:10,558 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 10:44:10,558 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 10:44:10,559 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 10:44:10,560 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 10:44:10,561 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 10:44:10,561 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 10:44:10,562 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 10:44:10,563 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 10:44:10,563 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 10:44:10,564 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 10:44:10,564 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 10:44:10,564 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 10:44:10,579 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 10:44:10,580 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-15 10:44:10,608 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 10:44:10,623 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 10:44:10,624 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 10:44:10,624 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 10:44:10,624 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 10:44:10,625 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 10:44:10,625 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 10:44:10,625 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 10:44:10,625 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 10:44:10,626 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 10:44:10,626 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 10:44:10,626 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 10:44:10,626 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 10:44:10,627 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 10:44:10,627 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-15 10:44:10,627 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 10:44:10,627 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-15 10:44:10,627 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 10:44:10,627 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 10:44:10,627 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 10:44:10,628 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-15 10:44:10,628 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 10:44:10,628 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 10:44:10,628 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 10:44:10,628 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 10:44:10,628 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 10:44:10,629 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 10:44:10,629 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-15 10:44:10,630 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 10:44:10,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 10:44:10,630 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-15 10:44:10,630 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-15 10:44:10,630 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-15 10:44:10,630 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 10:44:10,631 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2bd23b8476745cc5eeb44766af6c01d42c768ef8188ecd9b3f71230eca21db6b [2021-12-15 10:44:10,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 10:44:10,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 10:44:10,836 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 10:44:10,837 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 10:44:10,853 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 10:44:10,854 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i [2021-12-15 10:44:10,952 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48eddd3ed/7271e05621a54827bd0ff6635507e07e/FLAG5d44e4c71 [2021-12-15 10:44:11,402 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 10:44:11,402 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i [2021-12-15 10:44:11,424 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48eddd3ed/7271e05621a54827bd0ff6635507e07e/FLAG5d44e4c71 [2021-12-15 10:44:11,776 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48eddd3ed/7271e05621a54827bd0ff6635507e07e [2021-12-15 10:44:11,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 10:44:11,789 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 10:44:11,791 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 10:44:11,791 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 10:44:11,793 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 10:44:11,795 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:44:11" (1/1) ... [2021-12-15 10:44:11,796 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@675d738b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:44:11, skipping insertion in model container [2021-12-15 10:44:11,797 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:44:11" (1/1) ... [2021-12-15 10:44:11,803 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 10:44:11,844 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 10:44:12,142 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22673,22686] [2021-12-15 10:44:12,148 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22743,22756] [2021-12-15 10:44:12,149 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22807,22820] [2021-12-15 10:44:12,151 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22902,22915] [2021-12-15 10:44:12,152 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22974,22987] [2021-12-15 10:44:12,153 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[23113,23126] [2021-12-15 10:44:12,154 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[23187,23200] [2021-12-15 10:44:12,161 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 10:44:12,167 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 10:44:12,197 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22673,22686] [2021-12-15 10:44:12,200 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22743,22756] [2021-12-15 10:44:12,201 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22807,22820] [2021-12-15 10:44:12,204 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22902,22915] [2021-12-15 10:44:12,206 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22974,22987] [2021-12-15 10:44:12,207 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[23113,23126] [2021-12-15 10:44:12,208 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[23187,23200] [2021-12-15 10:44:12,213 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 10:44:12,235 INFO L208 MainTranslator]: Completed translation [2021-12-15 10:44:12,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:44:12 WrapperNode [2021-12-15 10:44:12,236 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 10:44:12,237 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 10:44:12,237 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 10:44:12,237 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 10:44:12,242 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:44:12" (1/1) ... [2021-12-15 10:44:12,265 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:44:12" (1/1) ... [2021-12-15 10:44:12,295 INFO L137 Inliner]: procedures = 119, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 157 [2021-12-15 10:44:12,296 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 10:44:12,297 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 10:44:12,299 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 10:44:12,299 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 10:44:12,306 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:44:12" (1/1) ... [2021-12-15 10:44:12,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:44:12" (1/1) ... [2021-12-15 10:44:12,321 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:44:12" (1/1) ... [2021-12-15 10:44:12,322 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:44:12" (1/1) ... [2021-12-15 10:44:12,337 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:44:12" (1/1) ... [2021-12-15 10:44:12,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:44:12" (1/1) ... [2021-12-15 10:44:12,350 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:44:12" (1/1) ... [2021-12-15 10:44:12,358 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 10:44:12,359 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 10:44:12,359 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 10:44:12,359 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 10:44:12,360 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:44:12" (1/1) ... [2021-12-15 10:44:12,371 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 10:44:12,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:44:12,390 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-15 10:44:12,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-15 10:44:12,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 10:44:12,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 10:44:12,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 10:44:12,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 10:44:12,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-15 10:44:12,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-15 10:44:12,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 10:44:12,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 10:44:12,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 10:44:12,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 10:44:12,534 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 10:44:12,535 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 10:44:12,858 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 10:44:12,862 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 10:44:12,864 INFO L301 CfgBuilder]: Removed 17 assume(true) statements. [2021-12-15 10:44:12,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:44:12 BoogieIcfgContainer [2021-12-15 10:44:12,867 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 10:44:12,868 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 10:44:12,868 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 10:44:12,871 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 10:44:12,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 10:44:11" (1/3) ... [2021-12-15 10:44:12,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cab4d89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:44:12, skipping insertion in model container [2021-12-15 10:44:12,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:44:12" (2/3) ... [2021-12-15 10:44:12,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cab4d89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:44:12, skipping insertion in model container [2021-12-15 10:44:12,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:44:12" (3/3) ... [2021-12-15 10:44:12,874 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-2.i [2021-12-15 10:44:12,880 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 10:44:12,881 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2021-12-15 10:44:12,912 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 10:44:12,918 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-15 10:44:12,919 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-12-15 10:44:12,933 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 46 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:44:12,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-15 10:44:12,937 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:44:12,937 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-15 10:44:12,938 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-12-15 10:44:12,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:44:12,946 INFO L85 PathProgramCache]: Analyzing trace with hash 891600134, now seen corresponding path program 1 times [2021-12-15 10:44:12,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:44:12,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000434038] [2021-12-15 10:44:12,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:44:12,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:44:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:44:13,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:44:13,141 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:44:13,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000434038] [2021-12-15 10:44:13,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000434038] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:44:13,143 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:44:13,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 10:44:13,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111003700] [2021-12-15 10:44:13,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:44:13,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-15 10:44:13,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:44:13,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-15 10:44:13,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 10:44:13,171 INFO L87 Difference]: Start difference. First operand has 47 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 46 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-15 10:44:13,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:44:13,184 INFO L93 Difference]: Finished difference Result 92 states and 150 transitions. [2021-12-15 10:44:13,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 10:44:13,186 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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-15 10:44:13,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:44:13,191 INFO L225 Difference]: With dead ends: 92 [2021-12-15 10:44:13,191 INFO L226 Difference]: Without dead ends: 41 [2021-12-15 10:44:13,193 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 10:44:13,196 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 10:44:13,196 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 10:44:13,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-12-15 10:44:13,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2021-12-15 10:44:13,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 40 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:44:13,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2021-12-15 10:44:13,220 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 6 [2021-12-15 10:44:13,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:44:13,221 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2021-12-15 10:44:13,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-15 10:44:13,221 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2021-12-15 10:44:13,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-15 10:44:13,221 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:44:13,222 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:44:13,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 10:44:13,222 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-12-15 10:44:13,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:44:13,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1806905862, now seen corresponding path program 1 times [2021-12-15 10:44:13,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:44:13,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842314917] [2021-12-15 10:44:13,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:44:13,223 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:44:13,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:44:13,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:44:13,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:44:13,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842314917] [2021-12-15 10:44:13,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842314917] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:44:13,287 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:44:13,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 10:44:13,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279216606] [2021-12-15 10:44:13,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:44:13,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 10:44:13,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:44:13,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 10:44:13,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 10:44:13,289 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:44:13,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:44:13,350 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2021-12-15 10:44:13,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 10:44:13,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-15 10:44:13,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:44:13,351 INFO L225 Difference]: With dead ends: 47 [2021-12-15 10:44:13,351 INFO L226 Difference]: Without dead ends: 45 [2021-12-15 10:44:13,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 10:44:13,352 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 51 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 10:44:13,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 47 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 10:44:13,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-12-15 10:44:13,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2021-12-15 10:44:13,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 38 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:44:13,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2021-12-15 10:44:13,357 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 7 [2021-12-15 10:44:13,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:44:13,358 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2021-12-15 10:44:13,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:44:13,358 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2021-12-15 10:44:13,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-15 10:44:13,358 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:44:13,358 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:44:13,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 10:44:13,359 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-12-15 10:44:13,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:44:13,359 INFO L85 PathProgramCache]: Analyzing trace with hash 179566605, now seen corresponding path program 1 times [2021-12-15 10:44:13,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:44:13,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682366483] [2021-12-15 10:44:13,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:44:13,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:44:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:44:13,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:44:13,474 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:44:13,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682366483] [2021-12-15 10:44:13,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682366483] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:44:13,475 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:44:13,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 10:44:13,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603442754] [2021-12-15 10:44:13,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:44:13,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 10:44:13,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:44:13,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 10:44:13,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 10:44:13,477 INFO L87 Difference]: Start difference. First operand 39 states and 42 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-15 10:44:13,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:44:13,532 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2021-12-15 10:44:13,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 10:44:13,533 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-15 10:44:13,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:44:13,534 INFO L225 Difference]: With dead ends: 39 [2021-12-15 10:44:13,534 INFO L226 Difference]: Without dead ends: 37 [2021-12-15 10:44:13,534 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 10:44:13,535 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 13 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 79 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-15 10:44:13,535 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 79 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 10:44:13,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-12-15 10:44:13,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2021-12-15 10:44:13,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.25) internal successors, (40), 36 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:44:13,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2021-12-15 10:44:13,540 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 8 [2021-12-15 10:44:13,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:44:13,540 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2021-12-15 10:44:13,540 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-15 10:44:13,541 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2021-12-15 10:44:13,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-15 10:44:13,542 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:44:13,542 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:44:13,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-15 10:44:13,543 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-12-15 10:44:13,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:44:13,543 INFO L85 PathProgramCache]: Analyzing trace with hash 711412120, now seen corresponding path program 1 times [2021-12-15 10:44:13,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:44:13,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356917753] [2021-12-15 10:44:13,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:44:13,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:44:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:44:13,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:44:13,650 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:44:13,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356917753] [2021-12-15 10:44:13,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356917753] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:44:13,650 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:44:13,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 10:44:13,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352232593] [2021-12-15 10:44:13,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:44:13,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 10:44:13,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:44:13,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 10:44:13,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 10:44:13,653 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:44:13,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:44:13,764 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2021-12-15 10:44:13,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 10:44:13,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-15 10:44:13,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:44:13,765 INFO L225 Difference]: With dead ends: 62 [2021-12-15 10:44:13,766 INFO L226 Difference]: Without dead ends: 60 [2021-12-15 10:44:13,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-15 10:44:13,767 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 39 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 10:44:13,767 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 91 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 10:44:13,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-12-15 10:44:13,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 44. [2021-12-15 10:44:13,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 43 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:44:13,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2021-12-15 10:44:13,772 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 10 [2021-12-15 10:44:13,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:44:13,772 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2021-12-15 10:44:13,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:44:13,773 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2021-12-15 10:44:13,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-15 10:44:13,773 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:44:13,773 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:44:13,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-15 10:44:13,774 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-12-15 10:44:13,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:44:13,774 INFO L85 PathProgramCache]: Analyzing trace with hash -2056579816, now seen corresponding path program 1 times [2021-12-15 10:44:13,775 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:44:13,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613767612] [2021-12-15 10:44:13,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:44:13,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:44:13,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:44:13,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:44:13,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:44:13,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613767612] [2021-12-15 10:44:13,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613767612] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:44:13,889 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:44:13,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 10:44:13,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743795271] [2021-12-15 10:44:13,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:44:13,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 10:44:13,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:44:13,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 10:44:13,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 10:44:13,911 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 4 states, 4 states have (on average 2.75) 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-15 10:44:14,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:44:14,038 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2021-12-15 10:44:14,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 10:44:14,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) 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 11 [2021-12-15 10:44:14,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:44:14,040 INFO L225 Difference]: With dead ends: 44 [2021-12-15 10:44:14,041 INFO L226 Difference]: Without dead ends: 42 [2021-12-15 10:44:14,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 10:44:14,043 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 8 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 10:44:14,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 68 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 10:44:14,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-12-15 10:44:14,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2021-12-15 10:44:14,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 41 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-15 10:44:14,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2021-12-15 10:44:14,062 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 11 [2021-12-15 10:44:14,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:44:14,062 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2021-12-15 10:44:14,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) 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-15 10:44:14,062 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2021-12-15 10:44:14,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-15 10:44:14,063 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:44:14,063 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:44:14,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-15 10:44:14,064 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-12-15 10:44:14,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:44:14,064 INFO L85 PathProgramCache]: Analyzing trace with hash -688119236, now seen corresponding path program 1 times [2021-12-15 10:44:14,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:44:14,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39589998] [2021-12-15 10:44:14,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:44:14,065 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:44:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:44:14,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:44:14,177 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:44:14,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39589998] [2021-12-15 10:44:14,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39589998] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:44:14,177 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:44:14,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 10:44:14,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279897073] [2021-12-15 10:44:14,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:44:14,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 10:44:14,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:44:14,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 10:44:14,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 10:44:14,178 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:44:14,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:44:14,215 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2021-12-15 10:44:14,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 10:44:14,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2021-12-15 10:44:14,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:44:14,218 INFO L225 Difference]: With dead ends: 42 [2021-12-15 10:44:14,218 INFO L226 Difference]: Without dead ends: 40 [2021-12-15 10:44:14,218 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-15 10:44:14,219 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 36 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 10:44:14,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 38 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 10:44:14,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-12-15 10:44:14,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2021-12-15 10:44:14,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 39 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:44:14,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2021-12-15 10:44:14,222 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 13 [2021-12-15 10:44:14,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:44:14,222 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2021-12-15 10:44:14,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:44:14,222 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2021-12-15 10:44:14,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-15 10:44:14,222 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:44:14,222 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:44:14,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-15 10:44:14,222 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-12-15 10:44:14,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:44:14,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1285114177, now seen corresponding path program 1 times [2021-12-15 10:44:14,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:44:14,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512011571] [2021-12-15 10:44:14,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:44:14,223 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:44:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:44:14,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:44:14,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:44:14,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512011571] [2021-12-15 10:44:14,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512011571] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:44:14,333 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:44:14,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 10:44:14,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134841632] [2021-12-15 10:44:14,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:44:14,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 10:44:14,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:44:14,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 10:44:14,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 10:44:14,336 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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-15 10:44:14,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:44:14,408 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2021-12-15 10:44:14,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 10:44:14,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-15 10:44:14,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:44:14,409 INFO L225 Difference]: With dead ends: 55 [2021-12-15 10:44:14,409 INFO L226 Difference]: Without dead ends: 43 [2021-12-15 10:44:14,409 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-15 10:44:14,409 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 10:44:14,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 77 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 10:44:14,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-12-15 10:44:14,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2021-12-15 10:44:14,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 41 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-15 10:44:14,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2021-12-15 10:44:14,413 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 14 [2021-12-15 10:44:14,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:44:14,413 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2021-12-15 10:44:14,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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-15 10:44:14,413 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2021-12-15 10:44:14,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-15 10:44:14,413 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:44:14,413 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:44:14,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-15 10:44:14,413 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-12-15 10:44:14,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:44:14,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1621160418, now seen corresponding path program 1 times [2021-12-15 10:44:14,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:44:14,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831627054] [2021-12-15 10:44:14,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:44:14,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:44:14,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:44:14,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:44:14,478 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:44:14,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831627054] [2021-12-15 10:44:14,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831627054] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:44:14,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278491489] [2021-12-15 10:44:14,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:44:14,479 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:44:14,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:44:14,480 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 10:44:14,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-15 10:44:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:44:14,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-15 10:44:14,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:44:14,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:44:14,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:44:14,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:44:14,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2021-12-15 10:44:14,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:44:14,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:44:14,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:44:14,726 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2021-12-15 10:44:15,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 10:44:15,013 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 10:44:15,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2021-12-15 10:44:15,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:44:15,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:44:15,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:44:15,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278491489] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:44:15,113 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:44:15,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2021-12-15 10:44:15,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384700351] [2021-12-15 10:44:15,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:44:15,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 10:44:15,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:44:15,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 10:44:15,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-15 10:44:15,115 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:44:15,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:44:15,221 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2021-12-15 10:44:15,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 10:44:15,222 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-15 10:44:15,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:44:15,222 INFO L225 Difference]: With dead ends: 59 [2021-12-15 10:44:15,222 INFO L226 Difference]: Without dead ends: 37 [2021-12-15 10:44:15,222 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-12-15 10:44:15,223 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 39 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 10:44:15,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 77 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 10:44:15,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-12-15 10:44:15,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2021-12-15 10:44:15,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 36 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:44:15,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2021-12-15 10:44:15,226 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 17 [2021-12-15 10:44:15,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:44:15,226 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2021-12-15 10:44:15,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:44:15,227 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2021-12-15 10:44:15,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-15 10:44:15,227 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:44:15,227 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:44:15,262 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-15 10:44:15,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:44:15,436 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-12-15 10:44:15,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:44:15,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1036168340, now seen corresponding path program 1 times [2021-12-15 10:44:15,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:44:15,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744910241] [2021-12-15 10:44:15,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:44:15,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:44:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:44:15,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:44:15,736 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:44:15,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744910241] [2021-12-15 10:44:15,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744910241] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:44:15,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916312413] [2021-12-15 10:44:15,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:44:15,737 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:44:15,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:44:15,738 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 10:44:15,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-15 10:44:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:44:15,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 46 conjunts are in the unsatisfiable core [2021-12-15 10:44:15,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:44:15,883 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 10:44:15,883 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-15 10:44:15,892 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-15 10:44:15,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:44:15,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2021-12-15 10:44:15,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:44:15,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:44:15,944 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 10:44:15,944 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-12-15 10:44:15,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2021-12-15 10:44:15,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2021-12-15 10:44:15,958 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 18 treesize of output 16 [2021-12-15 10:44:15,975 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-15 10:44:15,975 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-15 10:44:16,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:44:16,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:44:16,026 INFO L354 Elim1Store]: treesize reduction 137, result has 7.4 percent of original size [2021-12-15 10:44:16,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 38 [2021-12-15 10:44:16,036 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-15 10:44:16,036 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 10:44:16,070 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-15 10:44:16,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:44:16,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:44:16,116 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 10:44:16,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2021-12-15 10:44:16,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 51 [2021-12-15 10:44:16,123 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 24 treesize of output 22 [2021-12-15 10:44:16,292 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 10:44:16,292 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 101 [2021-12-15 10:44:16,297 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 178 [2021-12-15 10:44:16,302 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 178 treesize of output 170 [2021-12-15 10:44:21,818 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_18 Int) (v_arrayElimCell_17 Int) (v_ArrVal_934 (Array Int Int)) (v_ArrVal_925 (Array Int Int)) (v_ArrVal_939 (Array Int Int)) (v_ArrVal_923 Int) (v_arrayElimCell_15 Int)) (let ((.cse1 (= v_arrayElimCell_18 v_arrayElimCell_15)) (.cse0 (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_17))) (or (and .cse0 .cse1 (forall ((v_ArrVal_936 (Array Int Int)) (v_arrayElimCell_16 Int)) (= (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_923)) v_arrayElimCell_17 v_ArrVal_925) v_arrayElimCell_18 v_ArrVal_934) v_arrayElimCell_15 v_ArrVal_936) v_arrayElimCell_16 v_ArrVal_939) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~BLACK))) (let ((.cse2 (not .cse0))) (and (or .cse2 (not .cse1)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_923))) (.cse4 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (or (and (= (select (select (store (store .cse3 v_arrayElimCell_17 v_ArrVal_934) v_arrayElimCell_15 v_ArrVal_939) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4) ~unnamed1~0~BLACK) .cse2) (and .cse0 (= (select (select (store (store (store .cse3 v_arrayElimCell_17 v_ArrVal_925) v_arrayElimCell_18 v_ArrVal_934) v_arrayElimCell_15 v_ArrVal_939) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4) ~unnamed1~0~BLACK)))))) (not (= 0 (select (store |c_#valid| v_arrayElimCell_17 1) v_arrayElimCell_15))) (not (= 0 (select |c_#valid| v_arrayElimCell_17)))))) is different from false [2021-12-15 10:44:26,224 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 10:44:26,228 INFO L354 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2021-12-15 10:44:26,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 121 treesize of output 1 [2021-12-15 10:44:26,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-15 10:44:26,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916312413] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:44:26,230 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:44:26,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2021-12-15 10:44:26,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633831519] [2021-12-15 10:44:26,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:44:26,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-15 10:44:26,231 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:44:26,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-15 10:44:26,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=101, Unknown=1, NotChecked=20, Total=156 [2021-12-15 10:44:26,232 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:44:26,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:44:26,512 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2021-12-15 10:44:26,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 10:44:26,519 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-15 10:44:26,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:44:26,521 INFO L225 Difference]: With dead ends: 49 [2021-12-15 10:44:26,521 INFO L226 Difference]: Without dead ends: 47 [2021-12-15 10:44:26,521 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=172, Unknown=2, NotChecked=28, Total=272 [2021-12-15 10:44:26,522 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 126 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 10:44:26,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 93 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 88 Invalid, 0 Unknown, 55 Unchecked, 0.2s Time] [2021-12-15 10:44:26,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-12-15 10:44:26,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 35. [2021-12-15 10:44:26,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:44:26,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2021-12-15 10:44:26,526 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 21 [2021-12-15 10:44:26,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:44:26,526 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2021-12-15 10:44:26,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:44:26,527 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2021-12-15 10:44:26,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-15 10:44:26,528 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:44:26,528 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:44:26,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-15 10:44:26,751 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,SelfDestructingSolverStorable8 [2021-12-15 10:44:26,752 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-12-15 10:44:26,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:44:26,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1438350182, now seen corresponding path program 1 times [2021-12-15 10:44:26,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:44:26,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166911339] [2021-12-15 10:44:26,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:44:26,753 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:44:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:44:26,992 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:44:26,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:44:26,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166911339] [2021-12-15 10:44:26,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166911339] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:44:26,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752964564] [2021-12-15 10:44:26,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:44:26,994 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:44:26,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:44:27,016 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 10:44:27,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-15 10:44:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:44:27,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 84 conjunts are in the unsatisfiable core [2021-12-15 10:44:27,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:44:27,211 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 10:44:27,211 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-15 10:44:27,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2021-12-15 10:44:27,264 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2021-12-15 10:44:27,279 INFO L354 Elim1Store]: treesize reduction 50, result has 9.1 percent of original size [2021-12-15 10:44:27,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 78 [2021-12-15 10:44:27,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:44:27,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:44:27,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:44:27,286 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 10:44:27,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2021-12-15 10:44:27,301 INFO L354 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2021-12-15 10:44:27,301 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2021-12-15 10:44:27,305 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 30 treesize of output 28 [2021-12-15 10:44:27,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:44:27,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:44:27,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:44:27,391 INFO L354 Elim1Store]: treesize reduction 59, result has 25.3 percent of original size [2021-12-15 10:44:27,391 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 82 [2021-12-15 10:44:27,397 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 51 [2021-12-15 10:44:27,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:44:27,420 INFO L354 Elim1Store]: treesize reduction 115, result has 8.7 percent of original size [2021-12-15 10:44:27,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 92 [2021-12-15 10:44:27,425 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 66 treesize of output 60 [2021-12-15 10:44:27,428 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2021-12-15 10:44:27,443 INFO L354 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2021-12-15 10:44:27,443 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 46 [2021-12-15 10:44:27,778 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 10:44:27,778 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 53 [2021-12-15 10:44:27,820 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 10:44:27,821 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 23 [2021-12-15 10:44:27,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:44:27,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:44:27,936 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 10:44:27,936 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 125 [2021-12-15 10:44:27,942 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 10:44:27,943 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 107 [2021-12-15 10:44:28,439 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_1258 (Array Int Int)) (v_ArrVal_1244 (Array Int Int)) (v_ArrVal_1255 (Array Int Int)) (v_ArrVal_1242 (Array Int Int)) (v_ArrVal_1252 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_10)) (.cse2 (select v_arrayElimArr_10 |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse3 (select (select (store .cse1 .cse2 v_ArrVal_1252) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~null~0#1.base| (select (let ((.cse0 (store (store .cse1 .cse2 v_ArrVal_1255) .cse3 v_ArrVal_1242))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_9) .cse2 v_ArrVal_1244) .cse3 v_ArrVal_1258) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (not (= (select v_arrayElimArr_9 |c_ULTIMATE.start_main_~end~0#1.offset|) 0)) (and (forall ((v_ArrVal_1239 (Array Int Int))) (= |c_ULTIMATE.start_main_~null~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_9) (select v_arrayElimArr_10 |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1239) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (= |c_ULTIMATE.start_main_~null~0#1.base| .cse3)) (not (= 0 (select |c_#valid| .cse2))))))) is different from false [2021-12-15 10:44:28,465 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 10:44:28,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 642 treesize of output 514 [2021-12-15 10:44:28,472 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 10:44:28,472 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 514 treesize of output 370 [2021-12-15 10:44:32,316 INFO L354 Elim1Store]: treesize reduction 4493, result has 32.0 percent of original size [2021-12-15 10:44:32,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 23 new quantified variables, introduced 190 case distinctions, treesize of input 3270255 treesize of output 2832761 [2021-12-15 10:44:38,905 WARN L227 SmtUtils]: Spent 6.58s on a formula simplification that was a NOOP. DAG size: 3896 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-15 10:44:39,378 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 10:44:39,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5628249 treesize of output 4982600