./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-token-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e8d55036 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/sll-token-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 3438cae56d160b7d84eadaf1a799e28d3e56fe8aa8ad4206f8bf5c7c0818717b --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 19:40:28,415 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 19:40:28,417 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 19:40:28,447 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 19:40:28,447 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 19:40:28,449 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 19:40:28,452 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 19:40:28,454 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 19:40:28,455 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 19:40:28,458 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 19:40:28,459 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 19:40:28,461 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 19:40:28,461 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 19:40:28,462 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 19:40:28,464 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 19:40:28,464 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 19:40:28,465 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 19:40:28,466 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 19:40:28,467 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 19:40:28,470 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 19:40:28,471 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 19:40:28,472 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 19:40:28,473 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 19:40:28,473 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 19:40:28,479 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 19:40:28,479 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 19:40:28,479 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 19:40:28,480 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 19:40:28,481 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 19:40:28,481 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 19:40:28,481 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 19:40:28,482 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 19:40:28,483 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 19:40:28,483 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 19:40:28,484 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 19:40:28,484 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 19:40:28,484 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 19:40:28,485 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 19:40:28,485 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 19:40:28,486 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 19:40:28,486 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 19:40:28,487 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 19:40:28,508 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 19:40:28,508 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 19:40:28,508 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 19:40:28,508 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 19:40:28,509 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 19:40:28,509 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 19:40:28,509 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 19:40:28,510 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 19:40:28,510 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 19:40:28,510 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 19:40:28,510 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 19:40:28,511 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 19:40:28,511 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 19:40:28,511 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 19:40:28,511 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 19:40:28,511 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 19:40:28,511 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 19:40:28,511 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 19:40:28,511 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 19:40:28,512 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 19:40:28,512 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 19:40:28,512 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 19:40:28,512 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 19:40:28,512 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 19:40:28,512 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:40:28,512 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 19:40:28,513 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 19:40:28,513 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 19:40:28,513 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 19:40:28,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 19:40:28,513 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 19:40:28,513 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 19:40:28,513 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 19:40:28,514 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 19:40:28,514 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 19:40:28,514 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 3438cae56d160b7d84eadaf1a799e28d3e56fe8aa8ad4206f8bf5c7c0818717b [2023-02-15 19:40:28,719 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 19:40:28,734 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 19:40:28,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 19:40:28,737 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 19:40:28,737 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 19:40:28,738 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-token-2.i [2023-02-15 19:40:29,647 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 19:40:29,803 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 19:40:29,804 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-2.i [2023-02-15 19:40:29,811 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/821f113e1/7b9472c548824c3e8cf77f6796d98f5c/FLAG1004dbe04 [2023-02-15 19:40:29,828 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/821f113e1/7b9472c548824c3e8cf77f6796d98f5c [2023-02-15 19:40:29,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 19:40:29,831 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 19:40:29,833 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 19:40:29,833 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 19:40:29,835 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 19:40:29,836 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:40:29" (1/1) ... [2023-02-15 19:40:29,836 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@305beab2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:40:29, skipping insertion in model container [2023-02-15 19:40:29,837 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:40:29" (1/1) ... [2023-02-15 19:40:29,841 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 19:40:29,871 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 19:40:30,059 WARN L237 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/sll-token-2.i[22162,22175] [2023-02-15 19:40:30,063 WARN L237 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/sll-token-2.i[22311,22324] [2023-02-15 19:40:30,064 WARN L237 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/sll-token-2.i[22402,22415] [2023-02-15 19:40:30,065 WARN L237 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/sll-token-2.i[22484,22497] [2023-02-15 19:40:30,065 WARN L237 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/sll-token-2.i[22562,22575] [2023-02-15 19:40:30,066 WARN L237 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/sll-token-2.i[22708,22721] [2023-02-15 19:40:30,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:40:30,078 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 19:40:30,112 WARN L237 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/sll-token-2.i[22162,22175] [2023-02-15 19:40:30,114 WARN L237 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/sll-token-2.i[22311,22324] [2023-02-15 19:40:30,114 WARN L237 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/sll-token-2.i[22402,22415] [2023-02-15 19:40:30,115 WARN L237 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/sll-token-2.i[22484,22497] [2023-02-15 19:40:30,116 WARN L237 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/sll-token-2.i[22562,22575] [2023-02-15 19:40:30,116 WARN L237 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/sll-token-2.i[22708,22721] [2023-02-15 19:40:30,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:40:30,133 INFO L208 MainTranslator]: Completed translation [2023-02-15 19:40:30,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:40:30 WrapperNode [2023-02-15 19:40:30,133 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 19:40:30,134 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 19:40:30,134 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 19:40:30,134 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 19:40:30,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:40:30" (1/1) ... [2023-02-15 19:40:30,148 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:40:30" (1/1) ... [2023-02-15 19:40:30,161 INFO L138 Inliner]: procedures = 119, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 123 [2023-02-15 19:40:30,161 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 19:40:30,162 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 19:40:30,162 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 19:40:30,162 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 19:40:30,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:40:30" (1/1) ... [2023-02-15 19:40:30,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:40:30" (1/1) ... [2023-02-15 19:40:30,169 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:40:30" (1/1) ... [2023-02-15 19:40:30,169 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:40:30" (1/1) ... [2023-02-15 19:40:30,174 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:40:30" (1/1) ... [2023-02-15 19:40:30,177 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:40:30" (1/1) ... [2023-02-15 19:40:30,178 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:40:30" (1/1) ... [2023-02-15 19:40:30,179 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:40:30" (1/1) ... [2023-02-15 19:40:30,181 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 19:40:30,181 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 19:40:30,181 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 19:40:30,181 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 19:40:30,182 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:40:30" (1/1) ... [2023-02-15 19:40:30,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:40:30,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:40:30,213 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) [2023-02-15 19:40:30,216 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 [2023-02-15 19:40:30,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 19:40:30,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 19:40:30,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 19:40:30,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 19:40:30,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 19:40:30,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 19:40:30,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 19:40:30,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 19:40:30,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 19:40:30,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 19:40:30,344 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 19:40:30,351 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 19:40:30,513 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 19:40:30,520 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 19:40:30,520 INFO L300 CfgBuilder]: Removed 15 assume(true) statements. [2023-02-15 19:40:30,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:40:30 BoogieIcfgContainer [2023-02-15 19:40:30,523 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 19:40:30,525 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 19:40:30,525 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 19:40:30,527 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 19:40:30,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 07:40:29" (1/3) ... [2023-02-15 19:40:30,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@720ebb76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:40:30, skipping insertion in model container [2023-02-15 19:40:30,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:40:30" (2/3) ... [2023-02-15 19:40:30,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@720ebb76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:40:30, skipping insertion in model container [2023-02-15 19:40:30,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:40:30" (3/3) ... [2023-02-15 19:40:30,531 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-token-2.i [2023-02-15 19:40:30,545 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 19:40:30,545 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-02-15 19:40:30,579 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 19:40:30,583 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@196b1cdc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 19:40:30,584 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-02-15 19:40:30,588 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 43 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:40:30,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 19:40:30,592 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:40:30,593 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 19:40:30,593 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-02-15 19:40:30,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:40:30,598 INFO L85 PathProgramCache]: Analyzing trace with hash 890337990, now seen corresponding path program 1 times [2023-02-15 19:40:30,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:40:30,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712431859] [2023-02-15 19:40:30,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:40:30,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:40:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:40:30,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:40:30,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:40:30,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712431859] [2023-02-15 19:40:30,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712431859] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:40:30,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:40:30,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 19:40:30,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969576477] [2023-02-15 19:40:30,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:40:30,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 19:40:30,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:40:30,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 19:40:30,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 19:40:30,794 INFO L87 Difference]: Start difference. First operand has 44 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 43 states have internal predecessors, (67), 0 states have call successors, (0), 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) [2023-02-15 19:40:30,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:40:30,810 INFO L93 Difference]: Finished difference Result 86 states and 132 transitions. [2023-02-15 19:40:30,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 19:40:30,812 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 [2023-02-15 19:40:30,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:40:30,817 INFO L225 Difference]: With dead ends: 86 [2023-02-15 19:40:30,817 INFO L226 Difference]: Without dead ends: 39 [2023-02-15 19:40:30,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 19:40:30,822 INFO L413 NwaCegarLoop]: 46 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, 46 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 [2023-02-15 19:40:30,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:40:30,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-02-15 19:40:30,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-02-15 19:40:30,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 38 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) [2023-02-15 19:40:30,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2023-02-15 19:40:30,843 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 6 [2023-02-15 19:40:30,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:40:30,843 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2023-02-15 19:40:30,843 INFO L496 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) [2023-02-15 19:40:30,843 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2023-02-15 19:40:30,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 19:40:30,844 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:40:30,844 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 19:40:30,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 19:40:30,845 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-02-15 19:40:30,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:40:30,845 INFO L85 PathProgramCache]: Analyzing trace with hash 889571369, now seen corresponding path program 1 times [2023-02-15 19:40:30,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:40:30,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974444179] [2023-02-15 19:40:30,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:40:30,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:40:30,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:40:30,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:40:30,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:40:30,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974444179] [2023-02-15 19:40:30,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974444179] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:40:30,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:40:30,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:40:30,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201189444] [2023-02-15 19:40:30,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:40:30,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:40:30,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:40:30,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:40:30,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:40:30,970 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) [2023-02-15 19:40:31,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:40:31,020 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2023-02-15 19:40:31,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:40:31,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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 [2023-02-15 19:40:31,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:40:31,022 INFO L225 Difference]: With dead ends: 39 [2023-02-15 19:40:31,022 INFO L226 Difference]: Without dead ends: 37 [2023-02-15 19:40:31,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:40:31,023 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:40:31,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 56 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:40:31,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-02-15 19:40:31,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-02-15 19:40:31,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.21875) internal successors, (39), 36 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:40:31,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2023-02-15 19:40:31,029 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 6 [2023-02-15 19:40:31,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:40:31,029 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2023-02-15 19:40:31,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) [2023-02-15 19:40:31,029 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2023-02-15 19:40:31,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 19:40:31,030 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:40:31,030 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:40:31,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 19:40:31,030 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-02-15 19:40:31,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:40:31,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1806865149, now seen corresponding path program 1 times [2023-02-15 19:40:31,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:40:31,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538035947] [2023-02-15 19:40:31,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:40:31,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:40:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:40:31,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:40:31,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:40:31,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538035947] [2023-02-15 19:40:31,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538035947] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:40:31,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:40:31,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 19:40:31,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857504858] [2023-02-15 19:40:31,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:40:31,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 19:40:31,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:40:31,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 19:40:31,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 19:40:31,175 INFO L87 Difference]: Start difference. First operand 37 states and 39 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) [2023-02-15 19:40:31,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:40:31,229 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2023-02-15 19:40:31,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 19:40:31,230 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 [2023-02-15 19:40:31,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:40:31,231 INFO L225 Difference]: With dead ends: 63 [2023-02-15 19:40:31,232 INFO L226 Difference]: Without dead ends: 61 [2023-02-15 19:40:31,233 INFO L412 NwaCegarLoop]: 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 [2023-02-15 19:40:31,234 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 76 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:40:31,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 48 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:40:31,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-02-15 19:40:31,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 35. [2023-02-15 19:40:31,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 34 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:40:31,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2023-02-15 19:40:31,243 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 7 [2023-02-15 19:40:31,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:40:31,244 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2023-02-15 19:40:31,244 INFO L496 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) [2023-02-15 19:40:31,244 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2023-02-15 19:40:31,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 19:40:31,245 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:40:31,246 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:40:31,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 19:40:31,246 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-02-15 19:40:31,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:40:31,248 INFO L85 PathProgramCache]: Analyzing trace with hash -913382283, now seen corresponding path program 1 times [2023-02-15 19:40:31,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:40:31,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757453925] [2023-02-15 19:40:31,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:40:31,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:40:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:40:31,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:40:31,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:40:31,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757453925] [2023-02-15 19:40:31,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757453925] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:40:31,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:40:31,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 19:40:31,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152473438] [2023-02-15 19:40:31,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:40:31,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 19:40:31,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:40:31,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 19:40:31,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 19:40:31,355 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:40:31,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:40:31,423 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2023-02-15 19:40:31,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 19:40:31,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-15 19:40:31,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:40:31,424 INFO L225 Difference]: With dead ends: 35 [2023-02-15 19:40:31,424 INFO L226 Difference]: Without dead ends: 33 [2023-02-15 19:40:31,425 INFO L412 NwaCegarLoop]: 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 [2023-02-15 19:40:31,428 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 3 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:40:31,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 90 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:40:31,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-02-15 19:40:31,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-02-15 19:40:31,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 32 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:40:31,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2023-02-15 19:40:31,436 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 12 [2023-02-15 19:40:31,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:40:31,436 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2023-02-15 19:40:31,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:40:31,437 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2023-02-15 19:40:31,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 19:40:31,437 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:40:31,437 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:40:31,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 19:40:31,438 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-02-15 19:40:31,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:40:31,439 INFO L85 PathProgramCache]: Analyzing trace with hash -913344547, now seen corresponding path program 1 times [2023-02-15 19:40:31,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:40:31,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312693564] [2023-02-15 19:40:31,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:40:31,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:40:31,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:40:31,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:40:31,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:40:31,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312693564] [2023-02-15 19:40:31,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312693564] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:40:31,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:40:31,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 19:40:31,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782723138] [2023-02-15 19:40:31,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:40:31,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 19:40:31,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:40:31,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 19:40:31,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 19:40:31,747 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:40:31,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:40:31,906 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2023-02-15 19:40:31,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 19:40:31,907 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-15 19:40:31,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:40:31,909 INFO L225 Difference]: With dead ends: 50 [2023-02-15 19:40:31,909 INFO L226 Difference]: Without dead ends: 48 [2023-02-15 19:40:31,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-02-15 19:40:31,910 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 43 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:40:31,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 93 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:40:31,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-02-15 19:40:31,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2023-02-15 19:40:31,921 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) [2023-02-15 19:40:31,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2023-02-15 19:40:31,923 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 12 [2023-02-15 19:40:31,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:40:31,923 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2023-02-15 19:40:31,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:40:31,924 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2023-02-15 19:40:31,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 19:40:31,924 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:40:31,924 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:40:31,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 19:40:31,925 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-02-15 19:40:31,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:40:31,925 INFO L85 PathProgramCache]: Analyzing trace with hash -313255267, now seen corresponding path program 1 times [2023-02-15 19:40:31,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:40:31,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504612193] [2023-02-15 19:40:31,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:40:31,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:40:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:40:32,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:40:32,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:40:32,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504612193] [2023-02-15 19:40:32,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504612193] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:40:32,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:40:32,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 19:40:32,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697160548] [2023-02-15 19:40:32,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:40:32,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 19:40:32,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:40:32,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 19:40:32,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 19:40:32,134 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:40:32,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:40:32,226 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2023-02-15 19:40:32,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 19:40:32,226 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2023-02-15 19:40:32,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:40:32,227 INFO L225 Difference]: With dead ends: 66 [2023-02-15 19:40:32,227 INFO L226 Difference]: Without dead ends: 64 [2023-02-15 19:40:32,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-15 19:40:32,227 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 29 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:40:32,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 135 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:40:32,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-02-15 19:40:32,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2023-02-15 19:40:32,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 47 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:40:32,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2023-02-15 19:40:32,233 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 16 [2023-02-15 19:40:32,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:40:32,233 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2023-02-15 19:40:32,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:40:32,233 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2023-02-15 19:40:32,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 19:40:32,234 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:40:32,234 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:40:32,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 19:40:32,234 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-02-15 19:40:32,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:40:32,235 INFO L85 PathProgramCache]: Analyzing trace with hash -648614522, now seen corresponding path program 1 times [2023-02-15 19:40:32,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:40:32,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145863200] [2023-02-15 19:40:32,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:40:32,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:40:32,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:40:32,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:40:32,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:40:32,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145863200] [2023-02-15 19:40:32,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145863200] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:40:32,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881020654] [2023-02-15 19:40:32,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:40:32,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:40:32,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:40:32,413 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) [2023-02-15 19:40:32,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 19:40:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:40:32,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-15 19:40:32,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:40:32,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 19:40:32,538 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:40:32,583 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:40:32,583 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:40:32,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:40:32,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2023-02-15 19:40:32,597 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 18 [2023-02-15 19:40:32,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:40:32,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:40:32,704 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 19 treesize of output 23 [2023-02-15 19:40:32,718 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-02-15 19:40:32,719 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:40:32,752 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:40:32,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:40:32,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:40:32,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:40:32,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881020654] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-15 19:40:32,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:40:32,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 11 [2023-02-15 19:40:32,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61531333] [2023-02-15 19:40:32,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:40:32,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 19:40:32,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:40:32,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 19:40:32,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-02-15 19:40:32,892 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:40:33,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:40:33,207 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2023-02-15 19:40:33,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 19:40:33,207 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2023-02-15 19:40:33,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:40:33,208 INFO L225 Difference]: With dead ends: 60 [2023-02-15 19:40:33,208 INFO L226 Difference]: Without dead ends: 58 [2023-02-15 19:40:33,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=134, Unknown=1, NotChecked=0, Total=182 [2023-02-15 19:40:33,209 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 25 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 19:40:33,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 132 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 76 Invalid, 3 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 19:40:33,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-02-15 19:40:33,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2023-02-15 19:40:33,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 49 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:40:33,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2023-02-15 19:40:33,214 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 16 [2023-02-15 19:40:33,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:40:33,214 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2023-02-15 19:40:33,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:40:33,215 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2023-02-15 19:40:33,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 19:40:33,215 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:40:33,215 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:40:33,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 19:40:33,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:40:33,416 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-02-15 19:40:33,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:40:33,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1909855756, now seen corresponding path program 1 times [2023-02-15 19:40:33,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:40:33,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027649192] [2023-02-15 19:40:33,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:40:33,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:40:33,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:40:33,560 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:40:33,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:40:33,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027649192] [2023-02-15 19:40:33,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027649192] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:40:33,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:40:33,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 19:40:33,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205599574] [2023-02-15 19:40:33,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:40:33,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 19:40:33,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:40:33,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 19:40:33,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-15 19:40:33,562 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:40:33,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:40:33,637 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2023-02-15 19:40:33,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 19:40:33,637 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-15 19:40:33,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:40:33,637 INFO L225 Difference]: With dead ends: 76 [2023-02-15 19:40:33,638 INFO L226 Difference]: Without dead ends: 50 [2023-02-15 19:40:33,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-02-15 19:40:33,638 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 12 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:40:33,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 135 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:40:33,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-15 19:40:33,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-02-15 19:40:33,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 47 states have (on average 1.148936170212766) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:40:33,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2023-02-15 19:40:33,644 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 18 [2023-02-15 19:40:33,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:40:33,644 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2023-02-15 19:40:33,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:40:33,644 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2023-02-15 19:40:33,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-15 19:40:33,645 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:40:33,645 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:40:33,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 19:40:33,645 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-02-15 19:40:33,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:40:33,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1000772550, now seen corresponding path program 1 times [2023-02-15 19:40:33,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:40:33,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779766518] [2023-02-15 19:40:33,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:40:33,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:40:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:40:33,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:40:33,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:40:33,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779766518] [2023-02-15 19:40:33,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779766518] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:40:33,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702450074] [2023-02-15 19:40:33,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:40:33,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:40:33,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:40:33,808 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) [2023-02-15 19:40:33,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 19:40:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:40:33,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-15 19:40:33,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:40:33,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 19:40:33,899 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:40:33,930 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:40:33,930 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:40:33,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:40:33,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2023-02-15 19:40:33,941 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 18 [2023-02-15 19:40:33,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:40:33,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:40:33,990 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 19 treesize of output 23 [2023-02-15 19:40:34,001 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-02-15 19:40:34,001 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:40:34,017 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:40:34,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:40:34,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:40:34,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:40:34,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702450074] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-15 19:40:34,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:40:34,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2023-02-15 19:40:34,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384281933] [2023-02-15 19:40:34,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:40:34,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 19:40:34,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:40:34,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 19:40:34,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-02-15 19:40:34,098 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:40:34,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:40:34,431 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2023-02-15 19:40:34,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 19:40:34,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-02-15 19:40:34,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:40:34,432 INFO L225 Difference]: With dead ends: 68 [2023-02-15 19:40:34,432 INFO L226 Difference]: Without dead ends: 52 [2023-02-15 19:40:34,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=159, Unknown=1, NotChecked=0, Total=210 [2023-02-15 19:40:34,433 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 19 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 19:40:34,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 111 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 19:40:34,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-02-15 19:40:34,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2023-02-15 19:40:34,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 47 states have (on average 1.127659574468085) internal successors, (53), 49 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:40:34,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2023-02-15 19:40:34,438 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 20 [2023-02-15 19:40:34,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:40:34,438 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2023-02-15 19:40:34,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:40:34,438 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2023-02-15 19:40:34,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 19:40:34,439 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:40:34,439 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:40:34,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 19:40:34,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-02-15 19:40:34,639 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-02-15 19:40:34,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:40:34,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1552465966, now seen corresponding path program 1 times [2023-02-15 19:40:34,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:40:34,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864284801] [2023-02-15 19:40:34,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:40:34,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:40:34,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:40:34,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:40:34,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:40:34,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864284801] [2023-02-15 19:40:34,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864284801] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:40:34,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:40:34,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 19:40:34,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194631748] [2023-02-15 19:40:34,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:40:34,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 19:40:34,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:40:34,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 19:40:34,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 19:40:34,674 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:40:34,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:40:34,708 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2023-02-15 19:40:34,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 19:40:34,708 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2023-02-15 19:40:34,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:40:34,709 INFO L225 Difference]: With dead ends: 50 [2023-02-15 19:40:34,709 INFO L226 Difference]: Without dead ends: 31 [2023-02-15 19:40:34,709 INFO L412 NwaCegarLoop]: 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 [2023-02-15 19:40:34,710 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:40:34,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 91 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:40:34,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-15 19:40:34,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-02-15 19:40:34,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:40:34,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2023-02-15 19:40:34,714 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 22 [2023-02-15 19:40:34,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:40:34,714 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2023-02-15 19:40:34,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:40:34,714 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2023-02-15 19:40:34,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 19:40:34,715 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:40:34,715 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:40:34,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 19:40:34,715 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-02-15 19:40:34,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:40:34,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1970202869, now seen corresponding path program 1 times [2023-02-15 19:40:34,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:40:34,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832932923] [2023-02-15 19:40:34,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:40:34,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:40:34,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:40:35,066 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:40:35,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:40:35,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832932923] [2023-02-15 19:40:35,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832932923] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:40:35,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790979536] [2023-02-15 19:40:35,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:40:35,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:40:35,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:40:35,069 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) [2023-02-15 19:40:35,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 19:40:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:40:35,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 49 conjunts are in the unsatisfiable core [2023-02-15 19:40:35,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:40:35,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 19:40:35,182 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 14 [2023-02-15 19:40:35,190 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 19:40:35,190 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 19:40:35,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 19:40:35,209 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:40:35,209 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:40:35,215 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 14 treesize of output 14 [2023-02-15 19:40:35,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 19:40:35,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:40:35,294 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2023-02-15 19:40:35,295 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 71 treesize of output 68 [2023-02-15 19:40:35,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:40:35,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:40:35,302 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 21 treesize of output 25 [2023-02-15 19:40:35,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2023-02-15 19:40:35,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:40:35,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-15 19:40:35,321 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-02-15 19:40:35,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-02-15 19:40:35,388 INFO L350 Elim1Store]: Elim1 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 29 treesize of output 17 [2023-02-15 19:40:35,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2023-02-15 19:40:35,431 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:40:35,433 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:40:35,433 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 10 [2023-02-15 19:40:35,436 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:40:35,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:40:35,469 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:40:35,470 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 45 treesize of output 51 [2023-02-15 19:40:35,478 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:40:35,479 INFO L350 Elim1Store]: Elim1 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 86 treesize of output 85 [2023-02-15 19:40:35,483 INFO L350 Elim1Store]: Elim1 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 31 treesize of output 17 [2023-02-15 19:40:35,617 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:40:35,617 INFO L350 Elim1Store]: Elim1 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 95 treesize of output 88 [2023-02-15 19:40:35,623 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:40:35,623 INFO L350 Elim1Store]: Elim1 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 107 treesize of output 108 [2023-02-15 19:40:35,631 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:40:35,632 INFO L350 Elim1Store]: Elim1 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 402 treesize of output 281 [2023-02-15 19:40:35,637 INFO L350 Elim1Store]: Elim1 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 263 treesize of output 259 [2023-02-15 19:40:35,643 INFO L350 Elim1Store]: Elim1 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 259 treesize of output 251 [2023-02-15 19:40:35,648 INFO L350 Elim1Store]: Elim1 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 251 treesize of output 247 [2023-02-15 19:40:35,654 INFO L350 Elim1Store]: Elim1 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 247 treesize of output 239 [2023-02-15 19:40:35,669 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:40:35,669 INFO L350 Elim1Store]: Elim1 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 286 treesize of output 289 [2023-02-15 19:40:35,677 INFO L350 Elim1Store]: Elim1 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 273 treesize of output 269 [2023-02-15 19:40:35,682 INFO L350 Elim1Store]: Elim1 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 269 treesize of output 267 [2023-02-15 19:40:36,121 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:40:36,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790979536] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:40:36,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:40:36,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 14 [2023-02-15 19:40:36,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528960533] [2023-02-15 19:40:36,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:40:36,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 19:40:36,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:40:36,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 19:40:36,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-02-15 19:40:36,123 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 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) [2023-02-15 19:40:36,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:40:36,271 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2023-02-15 19:40:36,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 19:40:36,271 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-15 19:40:36,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:40:36,271 INFO L225 Difference]: With dead ends: 66 [2023-02-15 19:40:36,272 INFO L226 Difference]: Without dead ends: 50 [2023-02-15 19:40:36,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2023-02-15 19:40:36,272 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 29 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:40:36,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 118 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:40:36,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-15 19:40:36,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2023-02-15 19:40:36,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 45 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) [2023-02-15 19:40:36,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2023-02-15 19:40:36,278 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 22 [2023-02-15 19:40:36,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:40:36,278 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2023-02-15 19:40:36,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 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) [2023-02-15 19:40:36,278 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2023-02-15 19:40:36,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 19:40:36,278 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:40:36,278 INFO L195 NwaCegarLoop]: 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] [2023-02-15 19:40:36,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-15 19:40:36,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:40:36,484 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-02-15 19:40:36,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:40:36,484 INFO L85 PathProgramCache]: Analyzing trace with hash -882557003, now seen corresponding path program 1 times [2023-02-15 19:40:36,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:40:36,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642017411] [2023-02-15 19:40:36,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:40:36,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:40:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:40:36,912 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:40:36,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:40:36,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642017411] [2023-02-15 19:40:36,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642017411] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:40:36,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429817244] [2023-02-15 19:40:36,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:40:36,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:40:36,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:40:36,914 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:40:36,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 19:40:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:40:37,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 61 conjunts are in the unsatisfiable core [2023-02-15 19:40:37,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:40:37,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 19:40:37,022 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 14 [2023-02-15 19:40:37,030 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 19:40:37,030 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 19:40:37,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 19:40:37,048 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:40:37,048 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:40:37,054 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 14 treesize of output 14 [2023-02-15 19:40:37,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 19:40:37,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:40:37,131 INFO L321 Elim1Store]: treesize reduction 31, result has 31.1 percent of original size [2023-02-15 19:40:37,131 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 50 treesize of output 51 [2023-02-15 19:40:37,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:40:37,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:40:37,138 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 24 treesize of output 28 [2023-02-15 19:40:37,139 INFO L350 Elim1Store]: Elim1 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 12 treesize of output 11 [2023-02-15 19:40:37,146 INFO L350 Elim1Store]: Elim1 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 12 treesize of output 11 [2023-02-15 19:40:37,157 INFO L321 Elim1Store]: treesize reduction 8, result has 78.4 percent of original size [2023-02-15 19:40:37,157 INFO L350 Elim1Store]: Elim1 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 28 treesize of output 38 [2023-02-15 19:40:37,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-02-15 19:40:37,323 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2023-02-15 19:40:37,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 47 [2023-02-15 19:40:37,329 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 19:40:37,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2023-02-15 19:40:37,340 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:40:37,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:40:37,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:40:37,402 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:40:37,403 INFO L350 Elim1Store]: Elim1 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 95 treesize of output 93 [2023-02-15 19:40:37,407 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:40:37,407 INFO L350 Elim1Store]: Elim1 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 102 treesize of output 100 [2023-02-15 19:40:37,411 INFO L350 Elim1Store]: Elim1 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 247 treesize of output 169 [2023-02-15 19:40:37,603 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:40:37,604 INFO L350 Elim1Store]: Elim1 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 165 treesize of output 150 [2023-02-15 19:40:37,611 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:40:37,611 INFO L350 Elim1Store]: Elim1 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 141 treesize of output 126 [2023-02-15 19:40:37,678 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:40:37,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 2088 treesize of output 1593 [2023-02-15 19:40:38,332 INFO L321 Elim1Store]: treesize reduction 294, result has 60.5 percent of original size [2023-02-15 19:40:38,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 10188 treesize of output 9653 [2023-02-15 19:40:38,550 INFO L350 Elim1Store]: Elim1 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 8584 treesize of output 8176 [2023-02-15 19:40:38,717 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:40:38,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 8196 treesize of output 7902 [2023-02-15 19:40:38,954 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:40:38,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 7828 treesize of output 6678 [2023-02-15 19:40:39,101 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:40:39,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 6730 treesize of output 6270 [2023-02-15 19:40:39,339 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:40:39,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 6836 treesize of output 6794 [2023-02-15 19:40:39,455 INFO L350 Elim1Store]: Elim1 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 6786 treesize of output 6690 [2023-02-15 19:40:39,623 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:40:39,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 6712 treesize of output 6290 [2023-02-15 19:40:39,817 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:40:39,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 5804 treesize of output 5724