./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_szymanski.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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/seq-pthread/cs_szymanski.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 8c5cb1d1ec86f1df708ae47d652aad74925d4eb7bf3fc3a2c37d76896a5071e8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 18:44:51,045 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 18:44:51,046 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 18:44:51,079 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 18:44:51,080 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 18:44:51,081 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 18:44:51,082 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 18:44:51,084 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 18:44:51,085 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 18:44:51,089 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 18:44:51,090 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 18:44:51,091 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 18:44:51,091 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 18:44:51,092 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 18:44:51,093 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 18:44:51,093 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 18:44:51,094 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 18:44:51,095 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 18:44:51,096 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 18:44:51,097 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 18:44:51,097 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 18:44:51,098 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 18:44:51,099 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 18:44:51,100 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 18:44:51,100 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 18:44:51,102 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 18:44:51,102 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 18:44:51,102 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 18:44:51,103 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 18:44:51,103 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 18:44:51,104 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 18:44:51,104 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 18:44:51,105 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 18:44:51,105 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 18:44:51,106 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 18:44:51,106 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 18:44:51,107 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 18:44:51,108 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 18:44:51,108 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 18:44:51,109 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 18:44:51,110 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 18:44:51,110 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 18:44:51,112 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 18:44:51,131 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 18:44:51,131 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 18:44:51,131 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 18:44:51,132 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 18:44:51,132 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 18:44:51,132 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 18:44:51,133 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 18:44:51,133 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 18:44:51,133 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 18:44:51,133 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 18:44:51,133 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 18:44:51,134 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 18:44:51,134 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 18:44:51,134 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 18:44:51,134 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 18:44:51,134 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 18:44:51,134 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 18:44:51,134 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 18:44:51,135 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 18:44:51,135 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 18:44:51,135 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 18:44:51,135 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 18:44:51,135 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 18:44:51,135 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 18:44:51,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 18:44:51,136 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 18:44:51,136 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 18:44:51,136 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 18:44:51,136 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 18:44:51,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 18:44:51,137 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 18:44:51,137 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 18:44:51,137 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 18:44:51,137 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8c5cb1d1ec86f1df708ae47d652aad74925d4eb7bf3fc3a2c37d76896a5071e8 [2022-07-19 18:44:51,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 18:44:51,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 18:44:51,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 18:44:51,300 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 18:44:51,301 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 18:44:51,301 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_szymanski.i [2022-07-19 18:44:51,336 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/514e66d74/c9ee757d46ba4242b8bbd28b29b08617/FLAG14ec57a23 [2022-07-19 18:44:51,749 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 18:44:51,749 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_szymanski.i [2022-07-19 18:44:51,767 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/514e66d74/c9ee757d46ba4242b8bbd28b29b08617/FLAG14ec57a23 [2022-07-19 18:44:52,112 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/514e66d74/c9ee757d46ba4242b8bbd28b29b08617 [2022-07-19 18:44:52,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 18:44:52,115 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 18:44:52,116 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 18:44:52,116 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 18:44:52,118 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 18:44:52,118 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 06:44:52" (1/1) ... [2022-07-19 18:44:52,119 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6695e87c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:44:52, skipping insertion in model container [2022-07-19 18:44:52,119 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 06:44:52" (1/1) ... [2022-07-19 18:44:52,123 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 18:44:52,149 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 18:44:52,411 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_szymanski.i[23606,23619] [2022-07-19 18:44:52,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 18:44:52,517 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 18:44:52,546 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_szymanski.i[23606,23619] [2022-07-19 18:44:52,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 18:44:52,626 INFO L208 MainTranslator]: Completed translation [2022-07-19 18:44:52,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:44:52 WrapperNode [2022-07-19 18:44:52,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 18:44:52,627 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 18:44:52,628 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 18:44:52,628 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 18:44:52,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:44:52" (1/1) ... [2022-07-19 18:44:52,661 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:44:52" (1/1) ... [2022-07-19 18:44:52,703 INFO L137 Inliner]: procedures = 145, calls = 289, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 395 [2022-07-19 18:44:52,705 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 18:44:52,705 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 18:44:52,706 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 18:44:52,706 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 18:44:52,711 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:44:52" (1/1) ... [2022-07-19 18:44:52,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:44:52" (1/1) ... [2022-07-19 18:44:52,717 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:44:52" (1/1) ... [2022-07-19 18:44:52,717 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:44:52" (1/1) ... [2022-07-19 18:44:52,729 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:44:52" (1/1) ... [2022-07-19 18:44:52,732 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:44:52" (1/1) ... [2022-07-19 18:44:52,734 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:44:52" (1/1) ... [2022-07-19 18:44:52,736 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 18:44:52,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 18:44:52,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 18:44:52,737 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 18:44:52,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:44:52" (1/1) ... [2022-07-19 18:44:52,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 18:44:52,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 18:44:52,772 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) [2022-07-19 18:44:52,778 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 [2022-07-19 18:44:52,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 18:44:52,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 18:44:52,799 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-19 18:44:52,799 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-19 18:44:52,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 18:44:52,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 18:44:52,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 18:44:52,806 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2022-07-19 18:44:52,806 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2022-07-19 18:44:52,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 18:44:52,806 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2022-07-19 18:44:52,806 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2022-07-19 18:44:52,806 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-19 18:44:52,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-19 18:44:52,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 18:44:52,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 18:44:52,807 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2022-07-19 18:44:52,807 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2022-07-19 18:44:52,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 18:44:52,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 18:44:52,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 18:44:52,933 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 18:44:52,935 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 18:44:55,394 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 18:44:55,401 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 18:44:55,404 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-19 18:44:55,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 06:44:55 BoogieIcfgContainer [2022-07-19 18:44:55,406 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 18:44:55,408 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 18:44:55,408 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 18:44:55,410 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 18:44:55,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 06:44:52" (1/3) ... [2022-07-19 18:44:55,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@719df3fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 06:44:55, skipping insertion in model container [2022-07-19 18:44:55,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:44:52" (2/3) ... [2022-07-19 18:44:55,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@719df3fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 06:44:55, skipping insertion in model container [2022-07-19 18:44:55,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 06:44:55" (3/3) ... [2022-07-19 18:44:55,414 INFO L111 eAbstractionObserver]: Analyzing ICFG cs_szymanski.i [2022-07-19 18:44:55,424 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 18:44:55,424 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 18:44:55,472 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 18:44:55,477 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@679348f3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4be3e2ce [2022-07-19 18:44:55,477 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 18:44:55,481 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 73 states have internal predecessors, (96), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-19 18:44:55,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-19 18:44:55,495 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:44:55,495 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:44:55,496 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:44:55,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:44:55,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1875977801, now seen corresponding path program 1 times [2022-07-19 18:44:55,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:44:55,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631436424] [2022-07-19 18:44:55,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:44:55,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:44:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:56,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 18:44:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:56,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 18:44:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:56,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 18:44:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:56,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 18:44:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:56,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 18:44:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:56,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 18:44:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:56,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-19 18:44:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:56,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 18:44:56,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:56,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-19 18:44:56,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:56,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 18:44:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:56,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 18:44:56,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:56,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 18:44:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:56,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 18:44:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:56,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 18:44:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:56,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 18:44:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:56,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 18:44:56,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:56,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-19 18:44:56,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:56,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 18:44:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:56,283 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-07-19 18:44:56,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:44:56,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631436424] [2022-07-19 18:44:56,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631436424] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 18:44:56,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 18:44:56,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 18:44:56,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140845189] [2022-07-19 18:44:56,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 18:44:56,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 18:44:56,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:44:56,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 18:44:56,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 18:44:56,313 INFO L87 Difference]: Start difference. First operand has 111 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 73 states have internal predecessors, (96), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-19 18:44:56,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:44:56,380 INFO L93 Difference]: Finished difference Result 224 states and 356 transitions. [2022-07-19 18:44:56,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 18:44:56,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2022-07-19 18:44:56,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:44:56,393 INFO L225 Difference]: With dead ends: 224 [2022-07-19 18:44:56,393 INFO L226 Difference]: Without dead ends: 111 [2022-07-19 18:44:56,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 18:44:56,402 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 4 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 18:44:56,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 304 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 18:44:56,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-19 18:44:56,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2022-07-19 18:44:56,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 70 states have (on average 1.2714285714285714) internal successors, (89), 70 states have internal predecessors, (89), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-19 18:44:56,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2022-07-19 18:44:56,455 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 120 [2022-07-19 18:44:56,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:44:56,455 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2022-07-19 18:44:56,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-19 18:44:56,456 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2022-07-19 18:44:56,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-19 18:44:56,460 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:44:56,460 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:44:56,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 18:44:56,460 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:44:56,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:44:56,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1912175905, now seen corresponding path program 1 times [2022-07-19 18:44:56,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:44:56,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56178646] [2022-07-19 18:44:56,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:44:56,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:44:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:56,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 18:44:56,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:56,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 18:44:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:56,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 18:44:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:56,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 18:44:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:56,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 18:44:56,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:56,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 18:44:56,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:56,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 18:44:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:56,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 18:44:56,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:56,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-19 18:44:56,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:56,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 18:44:56,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:56,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 18:44:56,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:56,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 18:44:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:56,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-19 18:44:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:56,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-19 18:44:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:56,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-19 18:44:56,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:56,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-19 18:44:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:56,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-19 18:44:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:56,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 18:44:56,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:56,804 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-07-19 18:44:56,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:44:56,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56178646] [2022-07-19 18:44:56,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56178646] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 18:44:56,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 18:44:56,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 18:44:56,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40813577] [2022-07-19 18:44:56,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 18:44:56,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 18:44:56,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:44:56,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 18:44:56,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 18:44:56,807 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-19 18:44:56,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:44:56,828 INFO L93 Difference]: Finished difference Result 215 states and 306 transitions. [2022-07-19 18:44:56,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 18:44:56,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 123 [2022-07-19 18:44:56,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:44:56,830 INFO L225 Difference]: With dead ends: 215 [2022-07-19 18:44:56,830 INFO L226 Difference]: Without dead ends: 110 [2022-07-19 18:44:56,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 18:44:56,832 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 18:44:56,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 297 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 18:44:56,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-07-19 18:44:56,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2022-07-19 18:44:56,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 71 states have (on average 1.267605633802817) internal successors, (90), 71 states have internal predecessors, (90), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-19 18:44:56,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 154 transitions. [2022-07-19 18:44:56,840 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 154 transitions. Word has length 123 [2022-07-19 18:44:56,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:44:56,840 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 154 transitions. [2022-07-19 18:44:56,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-19 18:44:56,841 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 154 transitions. [2022-07-19 18:44:56,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-19 18:44:56,844 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:44:56,844 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:44:56,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 18:44:56,844 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:44:56,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:44:56,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1930143839, now seen corresponding path program 1 times [2022-07-19 18:44:56,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:44:56,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463072464] [2022-07-19 18:44:56,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:44:56,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:44:57,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:57,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 18:44:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:57,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 18:44:57,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:57,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 18:44:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:57,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 18:44:57,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:57,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 18:44:57,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:57,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 18:44:57,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:57,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 18:44:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:57,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 18:44:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:57,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 18:44:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:57,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 18:44:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:57,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 18:44:57,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:57,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 18:44:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:57,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 18:44:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:57,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 18:44:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:57,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 18:44:57,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:57,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 18:44:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:57,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 18:44:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:57,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-19 18:44:57,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:57,108 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-07-19 18:44:57,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:44:57,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463072464] [2022-07-19 18:44:57,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463072464] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 18:44:57,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401522132] [2022-07-19 18:44:57,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:44:57,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:44:57,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 18:44:57,111 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) [2022-07-19 18:44:57,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 18:44:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:58,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 4528 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 18:44:58,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:44:58,482 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-07-19 18:44:58,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 18:44:58,566 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-07-19 18:44:58,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401522132] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 18:44:58,566 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 18:44:58,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-19 18:44:58,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484365512] [2022-07-19 18:44:58,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 18:44:58,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 18:44:58,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:44:58,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 18:44:58,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-19 18:44:58,568 INFO L87 Difference]: Start difference. First operand 109 states and 154 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2022-07-19 18:44:58,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:44:58,599 INFO L93 Difference]: Finished difference Result 219 states and 311 transitions. [2022-07-19 18:44:58,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 18:44:58,600 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 125 [2022-07-19 18:44:58,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:44:58,601 INFO L225 Difference]: With dead ends: 219 [2022-07-19 18:44:58,601 INFO L226 Difference]: Without dead ends: 113 [2022-07-19 18:44:58,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 283 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-19 18:44:58,602 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 3 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 18:44:58,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 297 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 18:44:58,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-19 18:44:58,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-07-19 18:44:58,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 75 states have internal predecessors, (94), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-19 18:44:58,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 158 transitions. [2022-07-19 18:44:58,610 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 158 transitions. Word has length 125 [2022-07-19 18:44:58,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:44:58,610 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 158 transitions. [2022-07-19 18:44:58,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2022-07-19 18:44:58,610 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 158 transitions. [2022-07-19 18:44:58,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-19 18:44:58,612 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:44:58,612 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:44:58,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-19 18:44:58,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:44:58,839 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:44:58,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:44:58,840 INFO L85 PathProgramCache]: Analyzing trace with hash -28203099, now seen corresponding path program 2 times [2022-07-19 18:44:58,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:44:58,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975270338] [2022-07-19 18:44:58,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:44:58,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:44:59,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:59,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 18:44:59,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:59,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 18:44:59,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:59,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 18:44:59,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:59,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 18:44:59,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:59,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 18:44:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:59,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 18:44:59,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:59,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 18:44:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:59,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-19 18:44:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:59,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 18:44:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:59,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 18:44:59,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:59,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 18:44:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:59,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-19 18:44:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:59,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-19 18:44:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:59,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-19 18:44:59,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:59,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-19 18:44:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:59,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-19 18:44:59,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:59,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 18:44:59,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:59,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-19 18:44:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:59,253 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2022-07-19 18:44:59,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:44:59,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975270338] [2022-07-19 18:44:59,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975270338] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 18:44:59,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784947122] [2022-07-19 18:44:59,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 18:44:59,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:44:59,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 18:44:59,259 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) [2022-07-19 18:44:59,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 18:45:01,110 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-19 18:45:01,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 18:45:01,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 4196 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 18:45:01,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:45:01,315 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 622 trivial. 0 not checked. [2022-07-19 18:45:01,315 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 18:45:01,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784947122] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 18:45:01,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 18:45:01,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-19 18:45:01,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588101594] [2022-07-19 18:45:01,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 18:45:01,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 18:45:01,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:45:01,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 18:45:01,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 18:45:01,317 INFO L87 Difference]: Start difference. First operand 113 states and 158 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-19 18:45:01,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:45:01,338 INFO L93 Difference]: Finished difference Result 211 states and 302 transitions. [2022-07-19 18:45:01,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 18:45:01,339 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2022-07-19 18:45:01,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:45:01,341 INFO L225 Difference]: With dead ends: 211 [2022-07-19 18:45:01,341 INFO L226 Difference]: Without dead ends: 169 [2022-07-19 18:45:01,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-19 18:45:01,343 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 77 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 18:45:01,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 528 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 18:45:01,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-07-19 18:45:01,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2022-07-19 18:45:01,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 113 states have (on average 1.2920353982300885) internal successors, (146), 113 states have internal predecessors, (146), 45 states have call successors, (45), 10 states have call predecessors, (45), 10 states have return successors, (49), 45 states have call predecessors, (49), 45 states have call successors, (49) [2022-07-19 18:45:01,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 240 transitions. [2022-07-19 18:45:01,357 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 240 transitions. Word has length 129 [2022-07-19 18:45:01,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:45:01,357 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 240 transitions. [2022-07-19 18:45:01,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-19 18:45:01,357 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 240 transitions. [2022-07-19 18:45:01,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-07-19 18:45:01,359 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:45:01,360 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:45:01,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 18:45:01,582 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,SelfDestructingSolverStorable3 [2022-07-19 18:45:01,583 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:45:01,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:45:01,583 INFO L85 PathProgramCache]: Analyzing trace with hash -993819535, now seen corresponding path program 1 times [2022-07-19 18:45:01,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:45:01,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722249136] [2022-07-19 18:45:01,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:45:01,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:45:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:02,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 18:45:02,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:02,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:02,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:02,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:02,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 18:45:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:02,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 18:45:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:02,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:02,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:02,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 18:45:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:02,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 18:45:02,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:02,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:02,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:02,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 18:45:02,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:02,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-19 18:45:02,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:02,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:02,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 18:45:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:02,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 18:45:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:02,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 18:45:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:02,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-19 18:45:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:02,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-19 18:45:02,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:02,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-19 18:45:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:02,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-19 18:45:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:02,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-19 18:45:02,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:02,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-19 18:45:02,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:02,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-19 18:45:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:02,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-19 18:45:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:02,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-19 18:45:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:02,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-19 18:45:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:02,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-19 18:45:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:02,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-19 18:45:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:02,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-19 18:45:02,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:02,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-19 18:45:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:02,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-19 18:45:02,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:02,234 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 979 trivial. 0 not checked. [2022-07-19 18:45:02,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:45:02,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722249136] [2022-07-19 18:45:02,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722249136] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 18:45:02,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706776472] [2022-07-19 18:45:02,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:45:02,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:45:02,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 18:45:02,253 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) [2022-07-19 18:45:02,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 18:45:03,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:03,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 4997 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 18:45:03,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:45:04,004 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 979 trivial. 0 not checked. [2022-07-19 18:45:04,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 18:45:04,146 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 979 trivial. 0 not checked. [2022-07-19 18:45:04,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706776472] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 18:45:04,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 18:45:04,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 10 [2022-07-19 18:45:04,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440317680] [2022-07-19 18:45:04,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 18:45:04,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 18:45:04,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:45:04,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 18:45:04,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-07-19 18:45:04,151 INFO L87 Difference]: Start difference. First operand 169 states and 240 transitions. Second operand has 10 states, 10 states have (on average 10.2) internal successors, (102), 6 states have internal predecessors, (102), 2 states have call successors, (62), 6 states have call predecessors, (62), 2 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2022-07-19 18:45:06,201 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 18:45:08,224 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 18:45:08,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:45:08,666 INFO L93 Difference]: Finished difference Result 354 states and 502 transitions. [2022-07-19 18:45:08,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 18:45:08,667 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.2) internal successors, (102), 6 states have internal predecessors, (102), 2 states have call successors, (62), 6 states have call predecessors, (62), 2 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) Word has length 206 [2022-07-19 18:45:08,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:45:08,669 INFO L225 Difference]: With dead ends: 354 [2022-07-19 18:45:08,669 INFO L226 Difference]: Without dead ends: 197 [2022-07-19 18:45:08,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 467 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-07-19 18:45:08,670 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 79 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 139 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-19 18:45:08,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 351 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 268 Invalid, 2 Unknown, 0 Unchecked, 4.4s Time] [2022-07-19 18:45:08,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-07-19 18:45:08,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 192. [2022-07-19 18:45:08,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 134 states have (on average 1.2611940298507462) internal successors, (169), 136 states have internal predecessors, (169), 45 states have call successors, (45), 10 states have call predecessors, (45), 12 states have return successors, (53), 45 states have call predecessors, (53), 45 states have call successors, (53) [2022-07-19 18:45:08,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 267 transitions. [2022-07-19 18:45:08,693 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 267 transitions. Word has length 206 [2022-07-19 18:45:08,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:45:08,693 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 267 transitions. [2022-07-19 18:45:08,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.2) internal successors, (102), 6 states have internal predecessors, (102), 2 states have call successors, (62), 6 states have call predecessors, (62), 2 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2022-07-19 18:45:08,693 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 267 transitions. [2022-07-19 18:45:08,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-07-19 18:45:08,698 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:45:08,698 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 9, 9, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:45:08,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 18:45:08,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:45:08,911 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:45:08,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:45:08,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1193364367, now seen corresponding path program 2 times [2022-07-19 18:45:08,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:45:08,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819594311] [2022-07-19 18:45:08,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:45:08,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:45:09,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:09,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 18:45:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:09,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:10,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:10,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 18:45:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:10,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 18:45:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:10,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:10,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:10,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 18:45:10,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:10,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 18:45:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:10,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:10,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 18:45:10,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:10,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-19 18:45:10,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:10,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:10,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:10,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-19 18:45:10,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:10,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-19 18:45:10,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:10,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-19 18:45:10,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:10,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-19 18:45:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:10,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-19 18:45:10,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:10,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-19 18:45:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:10,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-19 18:45:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:10,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-19 18:45:10,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:10,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-19 18:45:10,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:10,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-19 18:45:10,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:10,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-19 18:45:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:10,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-19 18:45:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:10,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-19 18:45:10,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:10,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-19 18:45:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:10,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-19 18:45:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:10,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-07-19 18:45:10,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:10,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-07-19 18:45:10,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:10,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-07-19 18:45:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:10,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1078 trivial. 0 not checked. [2022-07-19 18:45:10,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:45:10,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819594311] [2022-07-19 18:45:10,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819594311] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 18:45:10,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003930745] [2022-07-19 18:45:10,147 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 18:45:10,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:45:10,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 18:45:10,167 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) [2022-07-19 18:45:10,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 18:45:12,397 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-19 18:45:12,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 18:45:12,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 4282 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-19 18:45:12,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:45:12,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2022-07-19 18:45:12,455 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 18:45:12,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003930745] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 18:45:12,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 18:45:12,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2022-07-19 18:45:12,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008915308] [2022-07-19 18:45:12,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 18:45:12,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 18:45:12,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:45:12,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 18:45:12,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-07-19 18:45:12,458 INFO L87 Difference]: Start difference. First operand 192 states and 267 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2022-07-19 18:45:12,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:45:12,476 INFO L93 Difference]: Finished difference Result 344 states and 482 transitions. [2022-07-19 18:45:12,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 18:45:12,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 224 [2022-07-19 18:45:12,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:45:12,480 INFO L225 Difference]: With dead ends: 344 [2022-07-19 18:45:12,481 INFO L226 Difference]: Without dead ends: 192 [2022-07-19 18:45:12,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-07-19 18:45:12,484 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 18:45:12,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 298 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 18:45:12,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-07-19 18:45:12,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2022-07-19 18:45:12,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 134 states have (on average 1.2537313432835822) internal successors, (168), 136 states have internal predecessors, (168), 45 states have call successors, (45), 10 states have call predecessors, (45), 12 states have return successors, (53), 45 states have call predecessors, (53), 45 states have call successors, (53) [2022-07-19 18:45:12,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 266 transitions. [2022-07-19 18:45:12,513 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 266 transitions. Word has length 224 [2022-07-19 18:45:12,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:45:12,514 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 266 transitions. [2022-07-19 18:45:12,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2022-07-19 18:45:12,514 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 266 transitions. [2022-07-19 18:45:12,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-07-19 18:45:12,519 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:45:12,519 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 9, 9, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:45:12,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 18:45:12,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:45:12,734 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:45:12,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:45:12,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1496592282, now seen corresponding path program 1 times [2022-07-19 18:45:12,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:45:12,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986552452] [2022-07-19 18:45:12,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:45:12,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:45:13,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:13,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 18:45:13,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:13,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:13,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:13,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 18:45:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:13,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:13,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:13,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:13,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 18:45:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:13,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 18:45:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:13,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:13,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:13,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 18:45:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:13,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 18:45:13,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:13,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:13,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:13,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 18:45:13,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:13,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-19 18:45:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:13,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:13,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-19 18:45:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:13,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-19 18:45:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:13,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-19 18:45:13,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:13,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-19 18:45:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:13,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-19 18:45:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:13,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-19 18:45:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:13,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-19 18:45:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:13,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-19 18:45:13,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:13,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-19 18:45:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:13,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-19 18:45:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:13,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-19 18:45:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:13,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-19 18:45:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:13,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-19 18:45:13,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:13,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-19 18:45:13,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:13,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-19 18:45:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:13,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-19 18:45:13,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:13,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-19 18:45:13,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:13,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-07-19 18:45:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:13,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1203 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1197 trivial. 0 not checked. [2022-07-19 18:45:13,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:45:13,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986552452] [2022-07-19 18:45:13,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986552452] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 18:45:13,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080069688] [2022-07-19 18:45:13,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:45:13,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:45:13,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 18:45:13,840 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 18:45:13,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 18:45:16,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:16,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 5430 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-19 18:45:16,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:45:16,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1203 backedges. 374 proven. 21 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2022-07-19 18:45:16,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 18:45:16,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1203 backedges. 17 proven. 19 refuted. 0 times theorem prover too weak. 1167 trivial. 0 not checked. [2022-07-19 18:45:16,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080069688] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 18:45:16,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 18:45:16,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 9] total 26 [2022-07-19 18:45:16,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535023204] [2022-07-19 18:45:16,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 18:45:16,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-19 18:45:16,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:45:16,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-19 18:45:16,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=529, Unknown=0, NotChecked=0, Total=650 [2022-07-19 18:45:16,729 INFO L87 Difference]: Start difference. First operand 192 states and 266 transitions. Second operand has 26 states, 26 states have (on average 4.538461538461538) internal successors, (118), 21 states have internal predecessors, (118), 15 states have call successors, (62), 12 states have call predecessors, (62), 12 states have return successors, (61), 15 states have call predecessors, (61), 15 states have call successors, (61) [2022-07-19 18:45:18,748 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 18:45:20,768 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 18:45:22,784 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 18:45:24,802 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 18:45:29,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:45:29,692 INFO L93 Difference]: Finished difference Result 1037 states and 1615 transitions. [2022-07-19 18:45:29,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-07-19 18:45:29,692 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.538461538461538) internal successors, (118), 21 states have internal predecessors, (118), 15 states have call successors, (62), 12 states have call predecessors, (62), 12 states have return successors, (61), 15 states have call predecessors, (61), 15 states have call successors, (61) Word has length 244 [2022-07-19 18:45:29,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:45:29,697 INFO L225 Difference]: With dead ends: 1037 [2022-07-19 18:45:29,697 INFO L226 Difference]: Without dead ends: 878 [2022-07-19 18:45:29,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 675 GetRequests, 568 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3902 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1769, Invalid=9787, Unknown=0, NotChecked=0, Total=11556 [2022-07-19 18:45:29,701 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 1102 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 2656 mSolverCounterSat, 1383 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1114 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 4043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1383 IncrementalHoareTripleChecker+Valid, 2656 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2022-07-19 18:45:29,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1114 Valid, 1094 Invalid, 4043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1383 Valid, 2656 Invalid, 4 Unknown, 0 Unchecked, 10.4s Time] [2022-07-19 18:45:29,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2022-07-19 18:45:29,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 547. [2022-07-19 18:45:29,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 376 states have (on average 1.25) internal successors, (470), 381 states have internal predecessors, (470), 108 states have call successors, (108), 50 states have call predecessors, (108), 62 states have return successors, (178), 115 states have call predecessors, (178), 108 states have call successors, (178) [2022-07-19 18:45:29,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 756 transitions. [2022-07-19 18:45:29,761 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 756 transitions. Word has length 244 [2022-07-19 18:45:29,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:45:29,761 INFO L495 AbstractCegarLoop]: Abstraction has 547 states and 756 transitions. [2022-07-19 18:45:29,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.538461538461538) internal successors, (118), 21 states have internal predecessors, (118), 15 states have call successors, (62), 12 states have call predecessors, (62), 12 states have return successors, (61), 15 states have call predecessors, (61), 15 states have call successors, (61) [2022-07-19 18:45:29,762 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 756 transitions. [2022-07-19 18:45:29,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-07-19 18:45:29,767 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:45:29,767 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 9, 9, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:45:29,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-19 18:45:29,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:45:29,982 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:45:29,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:45:29,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1922354694, now seen corresponding path program 1 times [2022-07-19 18:45:29,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:45:29,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318617051] [2022-07-19 18:45:29,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:45:29,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:45:50,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:51,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 18:45:51,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:51,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:51,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:51,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:51,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 18:45:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:51,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:51,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:51,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 18:45:51,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:51,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 18:45:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:51,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:51,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:51,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 18:45:51,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:51,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 18:45:51,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:51,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:51,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:52,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 18:45:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:52,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-19 18:45:52,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:52,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:52,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:52,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-19 18:45:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:52,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-19 18:45:52,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:52,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-19 18:45:52,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:52,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-19 18:45:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:52,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-19 18:45:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:52,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-19 18:45:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:52,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-19 18:45:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:52,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-19 18:45:52,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:52,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-19 18:45:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:52,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-19 18:45:52,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:52,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-19 18:45:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:52,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-19 18:45:52,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:52,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-19 18:45:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:52,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-19 18:45:52,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:52,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-19 18:45:52,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:52,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-19 18:45:52,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:52,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-19 18:45:52,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:52,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-07-19 18:45:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:52,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1203 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1195 trivial. 0 not checked. [2022-07-19 18:45:52,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:45:52,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318617051] [2022-07-19 18:45:52,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318617051] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 18:45:52,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007927097] [2022-07-19 18:45:52,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:45:52,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:45:52,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 18:45:52,131 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 18:45:52,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-19 18:45:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:55,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 5576 conjuncts, 133 conjunts are in the unsatisfiable core [2022-07-19 18:45:55,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:45:56,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-19 18:45:57,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:57,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:45:57,310 INFO L356 Elim1Store]: treesize reduction 156, result has 41.1 percent of original size [2022-07-19 18:45:57,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 442 treesize of output 597 [2022-07-19 18:45:57,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 18:45:57,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 18:45:57,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 18:45:57,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 18:45:57,905 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-19 18:46:11,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:11,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:11,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:11,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:11,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:11,245 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 18:46:11,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:11,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:11,253 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 18:46:11,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 29 [2022-07-19 18:46:11,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:11,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:14,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:14,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:14,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:14,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:14,614 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 18:46:14,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:14,626 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 18:46:14,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 32 [2022-07-19 18:46:14,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:14,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:14,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:14,687 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 18:46:14,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:14,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:14,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:14,704 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 18:46:14,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 38 [2022-07-19 18:46:14,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:14,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:14,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:15,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:15,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:15,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:16,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:16,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:17,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:17,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:18,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:18,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:18,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:19,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:19,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:19,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:19,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:19,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:20,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:20,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:20,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:20,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:20,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:20,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:21,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:21,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:21,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:21,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:21,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:21,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:22,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:22,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:22,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:22,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:22,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:22,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:22,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:22,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:23,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:23,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:23,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:23,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:24,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:24,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:24,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:24,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:25,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:25,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:25,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:25,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-19 18:46:25,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-19 18:46:25,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-19 18:46:26,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-19 18:46:26,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-19 18:46:26,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:26,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:26,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:26,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:26,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:26,364 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 18:46:26,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 851 treesize of output 851 [2022-07-19 18:46:26,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-19 18:46:26,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-19 18:46:26,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-19 18:46:26,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-19 18:46:26,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-19 18:46:26,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-19 18:46:26,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-19 18:46:26,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-19 18:46:26,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-19 18:46:26,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-19 18:46:26,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-19 18:46:26,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-19 18:46:27,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:27,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:27,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:27,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:27,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:27,447 INFO L356 Elim1Store]: treesize reduction 74, result has 32.1 percent of original size [2022-07-19 18:46:27,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 1007 treesize of output 973 [2022-07-19 18:46:27,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-19 18:46:27,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-19 18:46:27,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-19 18:46:27,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-19 18:46:27,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-19 18:46:27,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-19 18:46:27,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-19 18:46:28,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-19 18:46:28,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-19 18:46:28,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-19 18:46:28,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-19 18:46:28,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:28,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:28,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:28,233 INFO L356 Elim1Store]: treesize reduction 74, result has 32.1 percent of original size [2022-07-19 18:46:28,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 99 treesize of output 131 [2022-07-19 18:46:28,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:28,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:28,339 INFO L356 Elim1Store]: treesize reduction 84, result has 29.4 percent of original size [2022-07-19 18:46:28,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 97 treesize of output 131 [2022-07-19 18:46:28,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:28,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:28,466 INFO L356 Elim1Store]: treesize reduction 72, result has 45.9 percent of original size [2022-07-19 18:46:28,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 66 treesize of output 120 [2022-07-19 18:46:37,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-19 18:46:43,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-19 18:46:44,549 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-19 18:46:44,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 85 treesize of output 95 [2022-07-19 18:46:44,584 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-19 18:46:44,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 107 treesize of output 117 [2022-07-19 18:46:44,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-19 18:46:44,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-19 18:46:44,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-19 18:46:44,952 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-19 18:46:44,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-19 18:46:45,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:45,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 39 [2022-07-19 18:46:45,055 INFO L356 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2022-07-19 18:46:45,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 37 treesize of output 1 [2022-07-19 18:46:45,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-19 18:46:45,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-19 18:46:45,324 INFO L356 Elim1Store]: treesize reduction 46, result has 49.5 percent of original size [2022-07-19 18:46:45,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 145 treesize of output 254 [2022-07-19 18:46:46,120 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 18:46:46,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 126 treesize of output 130 [2022-07-19 18:46:46,281 INFO L356 Elim1Store]: treesize reduction 67, result has 1.5 percent of original size [2022-07-19 18:46:46,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 86 treesize of output 3 [2022-07-19 18:46:46,309 INFO L356 Elim1Store]: treesize reduction 79, result has 23.3 percent of original size [2022-07-19 18:46:46,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 46 [2022-07-19 18:46:46,487 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-19 18:46:46,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-19 18:46:46,528 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-19 18:46:46,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 treesize of output 24 [2022-07-19 18:46:46,566 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-19 18:46:46,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 85 treesize of output 95 [2022-07-19 18:46:46,590 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-19 18:46:46,627 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-19 18:46:46,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 67 treesize of output 79 [2022-07-19 18:46:46,744 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-19 18:46:46,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 35 treesize of output 47 [2022-07-19 18:46:46,924 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-19 18:46:46,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 84 [2022-07-19 18:46:46,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-07-19 18:46:47,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 18:46:47,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2022-07-19 18:46:47,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2022-07-19 18:46:47,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2022-07-19 18:46:47,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-19 18:46:47,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2022-07-19 18:46:47,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2022-07-19 18:46:47,446 INFO L356 Elim1Store]: treesize reduction 42, result has 23.6 percent of original size [2022-07-19 18:46:47,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 93 [2022-07-19 18:46:47,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2022-07-19 18:46:47,623 INFO L356 Elim1Store]: treesize reduction 200, result has 15.6 percent of original size [2022-07-19 18:46:47,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 8 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 9 new quantified variables, introduced 8 case distinctions, treesize of input 238 treesize of output 1045 [2022-07-19 18:46:47,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-19 18:46:47,885 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-19 18:46:47,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-19 18:46:48,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:46:48,087 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ClassCastException: class de.uni_freiburg.informatik.ultimate.logic.TermVariable cannot be cast to class de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm (de.uni_freiburg.informatik.ultimate.logic.TermVariable and de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @54e81b21) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.MultiDimensionalSelect.(MultiDimensionalSelect.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.ArrayIndexEqualityManager.constructNestedStoreUpdateConstraintForOnePosition(ArrayIndexEqualityManager.java:415) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.ArrayIndexEqualityManager.constructNestedStoreUpdateConstraint(ArrayIndexEqualityManager.java:449) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.constructWriteConstraints2(Elim1Store.java:995) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:314) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-19 18:46:48,089 INFO L158 Benchmark]: Toolchain (without parser) took 115974.02ms. Allocated memory was 96.5MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 64.2MB in the beginning and 720.7MB in the end (delta: -656.5MB). Peak memory consumption was 816.2MB. Max. memory is 16.1GB. [2022-07-19 18:46:48,089 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory was 50.4MB in the beginning and 50.3MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 18:46:48,089 INFO L158 Benchmark]: CACSL2BoogieTranslator took 511.17ms. Allocated memory is still 96.5MB. Free memory was 64.0MB in the beginning and 56.8MB in the end (delta: 7.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-19 18:46:48,089 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.65ms. Allocated memory is still 96.5MB. Free memory was 56.4MB in the beginning and 52.7MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 18:46:48,089 INFO L158 Benchmark]: Boogie Preprocessor took 31.11ms. Allocated memory is still 96.5MB. Free memory was 52.7MB in the beginning and 49.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 18:46:48,089 INFO L158 Benchmark]: RCFGBuilder took 2669.27ms. Allocated memory was 96.5MB in the beginning and 123.7MB in the end (delta: 27.3MB). Free memory was 49.2MB in the beginning and 66.4MB in the end (delta: -17.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2022-07-19 18:46:48,090 INFO L158 Benchmark]: TraceAbstraction took 112680.62ms. Allocated memory was 123.7MB in the beginning and 1.1GB in the end (delta: 989.9MB). Free memory was 65.3MB in the beginning and 720.7MB in the end (delta: -655.4MB). Peak memory consumption was 790.6MB. Max. memory is 16.1GB. [2022-07-19 18:46:48,090 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory was 50.4MB in the beginning and 50.3MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 511.17ms. Allocated memory is still 96.5MB. Free memory was 64.0MB in the beginning and 56.8MB in the end (delta: 7.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.65ms. Allocated memory is still 96.5MB. Free memory was 56.4MB in the beginning and 52.7MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.11ms. Allocated memory is still 96.5MB. Free memory was 52.7MB in the beginning and 49.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2669.27ms. Allocated memory was 96.5MB in the beginning and 123.7MB in the end (delta: 27.3MB). Free memory was 49.2MB in the beginning and 66.4MB in the end (delta: -17.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 112680.62ms. Allocated memory was 123.7MB in the beginning and 1.1GB in the end (delta: 989.9MB). Free memory was 65.3MB in the beginning and 720.7MB in the end (delta: -655.4MB). Peak memory consumption was 790.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.logic.TermVariable cannot be cast to class de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm (de.uni_freiburg.informatik.ultimate.logic.TermVariable and de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @54e81b21) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ClassCastException: class de.uni_freiburg.informatik.ultimate.logic.TermVariable cannot be cast to class de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm (de.uni_freiburg.informatik.ultimate.logic.TermVariable and de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @54e81b21): de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.MultiDimensionalSelect.(MultiDimensionalSelect.java:103) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-19 18:46:48,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_szymanski.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8c5cb1d1ec86f1df708ae47d652aad74925d4eb7bf3fc3a2c37d76896a5071e8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 18:46:49,985 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 18:46:49,987 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 18:46:50,024 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 18:46:50,025 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 18:46:50,026 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 18:46:50,030 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 18:46:50,033 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 18:46:50,035 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 18:46:50,039 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 18:46:50,040 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 18:46:50,042 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 18:46:50,042 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 18:46:50,044 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 18:46:50,045 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 18:46:50,050 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 18:46:50,051 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 18:46:50,052 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 18:46:50,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 18:46:50,060 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 18:46:50,062 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 18:46:50,063 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 18:46:50,065 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 18:46:50,066 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 18:46:50,068 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 18:46:50,079 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 18:46:50,079 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 18:46:50,079 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 18:46:50,080 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 18:46:50,080 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 18:46:50,081 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 18:46:50,081 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 18:46:50,083 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 18:46:50,084 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 18:46:50,085 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 18:46:50,085 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 18:46:50,085 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 18:46:50,086 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 18:46:50,086 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 18:46:50,086 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 18:46:50,087 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 18:46:50,088 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 18:46:50,088 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-19 18:46:50,108 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 18:46:50,109 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 18:46:50,109 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 18:46:50,110 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 18:46:50,111 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 18:46:50,111 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 18:46:50,112 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 18:46:50,112 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 18:46:50,112 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 18:46:50,113 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 18:46:50,113 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 18:46:50,114 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 18:46:50,114 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 18:46:50,114 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 18:46:50,114 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 18:46:50,114 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 18:46:50,114 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-19 18:46:50,114 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-19 18:46:50,114 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-19 18:46:50,115 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 18:46:50,115 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 18:46:50,115 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 18:46:50,116 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 18:46:50,116 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 18:46:50,116 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 18:46:50,116 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 18:46:50,116 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 18:46:50,116 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 18:46:50,116 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 18:46:50,117 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 18:46:50,117 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-19 18:46:50,117 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-19 18:46:50,117 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 18:46:50,117 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 18:46:50,118 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 18:46:50,118 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-19 18:46:50,118 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8c5cb1d1ec86f1df708ae47d652aad74925d4eb7bf3fc3a2c37d76896a5071e8 [2022-07-19 18:46:50,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 18:46:50,450 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 18:46:50,452 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 18:46:50,453 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 18:46:50,453 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 18:46:50,454 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_szymanski.i [2022-07-19 18:46:50,498 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19cf0e703/3a283dcf09f54a23a916ec2c097ccd26/FLAG6d91cf216 [2022-07-19 18:46:50,953 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 18:46:50,953 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_szymanski.i [2022-07-19 18:46:50,973 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19cf0e703/3a283dcf09f54a23a916ec2c097ccd26/FLAG6d91cf216 [2022-07-19 18:46:50,987 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19cf0e703/3a283dcf09f54a23a916ec2c097ccd26 [2022-07-19 18:46:50,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 18:46:50,991 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 18:46:50,993 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 18:46:50,994 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 18:46:50,997 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 18:46:50,997 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 06:46:50" (1/1) ... [2022-07-19 18:46:51,000 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33f4183f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:46:50, skipping insertion in model container [2022-07-19 18:46:51,000 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 06:46:50" (1/1) ... [2022-07-19 18:46:51,006 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 18:46:51,053 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 18:46:51,343 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_szymanski.i[23606,23619] [2022-07-19 18:46:51,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 18:46:51,452 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 18:46:51,483 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_szymanski.i[23606,23619] [2022-07-19 18:46:51,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 18:46:51,581 INFO L208 MainTranslator]: Completed translation [2022-07-19 18:46:51,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:46:51 WrapperNode [2022-07-19 18:46:51,582 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 18:46:51,583 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 18:46:51,583 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 18:46:51,583 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 18:46:51,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:46:51" (1/1) ... [2022-07-19 18:46:51,613 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:46:51" (1/1) ... [2022-07-19 18:46:51,666 INFO L137 Inliner]: procedures = 149, calls = 289, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 389 [2022-07-19 18:46:51,667 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 18:46:51,667 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 18:46:51,668 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 18:46:51,668 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 18:46:51,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:46:51" (1/1) ... [2022-07-19 18:46:51,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:46:51" (1/1) ... [2022-07-19 18:46:51,684 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:46:51" (1/1) ... [2022-07-19 18:46:51,684 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:46:51" (1/1) ... [2022-07-19 18:46:51,709 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:46:51" (1/1) ... [2022-07-19 18:46:51,713 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:46:51" (1/1) ... [2022-07-19 18:46:51,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:46:51" (1/1) ... [2022-07-19 18:46:51,720 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 18:46:51,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 18:46:51,721 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 18:46:51,721 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 18:46:51,722 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:46:51" (1/1) ... [2022-07-19 18:46:51,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 18:46:51,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 18:46:51,769 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) [2022-07-19 18:46:51,772 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 [2022-07-19 18:46:51,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-19 18:46:51,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-19 18:46:51,804 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-19 18:46:51,804 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-19 18:46:51,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 18:46:51,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 18:46:51,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 18:46:51,805 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2022-07-19 18:46:51,805 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2022-07-19 18:46:51,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 18:46:51,805 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2022-07-19 18:46:51,805 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2022-07-19 18:46:51,805 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-19 18:46:51,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-19 18:46:51,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-07-19 18:46:51,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 18:46:51,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-19 18:46:51,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 18:46:51,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-19 18:46:51,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-07-19 18:46:51,806 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2022-07-19 18:46:51,806 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2022-07-19 18:46:51,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 18:46:51,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 18:46:51,906 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 18:46:51,922 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 18:46:54,668 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 18:46:54,673 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 18:46:54,673 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-19 18:46:54,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 06:46:54 BoogieIcfgContainer [2022-07-19 18:46:54,675 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 18:46:54,681 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 18:46:54,681 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 18:46:54,683 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 18:46:54,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 06:46:50" (1/3) ... [2022-07-19 18:46:54,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8053b3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 06:46:54, skipping insertion in model container [2022-07-19 18:46:54,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:46:51" (2/3) ... [2022-07-19 18:46:54,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8053b3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 06:46:54, skipping insertion in model container [2022-07-19 18:46:54,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 06:46:54" (3/3) ... [2022-07-19 18:46:54,685 INFO L111 eAbstractionObserver]: Analyzing ICFG cs_szymanski.i [2022-07-19 18:46:54,696 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 18:46:54,697 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 18:46:54,734 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 18:46:54,739 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@74a0b21d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@538f72d4 [2022-07-19 18:46:54,739 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 18:46:54,743 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 73 states have internal predecessors, (96), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-19 18:46:54,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-19 18:46:54,755 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:46:54,755 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:46:54,756 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:46:54,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:46:54,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1875977801, now seen corresponding path program 1 times [2022-07-19 18:46:54,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 18:46:54,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1722005731] [2022-07-19 18:46:54,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:46:54,772 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 18:46:54,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 18:46:54,775 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 18:46:54,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-19 18:46:56,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:57,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 2760 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-19 18:46:57,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:46:57,126 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2022-07-19 18:46:57,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 18:46:57,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 18:46:57,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1722005731] [2022-07-19 18:46:57,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1722005731] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 18:46:57,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 18:46:57,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 18:46:57,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465098060] [2022-07-19 18:46:57,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 18:46:57,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 18:46:57,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 18:46:57,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 18:46:57,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 18:46:57,159 INFO L87 Difference]: Start difference. First operand has 111 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 73 states have internal predecessors, (96), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-19 18:46:57,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:46:57,196 INFO L93 Difference]: Finished difference Result 220 states and 348 transitions. [2022-07-19 18:46:57,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 18:46:57,199 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 120 [2022-07-19 18:46:57,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:46:57,219 INFO L225 Difference]: With dead ends: 220 [2022-07-19 18:46:57,219 INFO L226 Difference]: Without dead ends: 107 [2022-07-19 18:46:57,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 18:46:57,225 INFO L413 NwaCegarLoop]: 156 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, 156 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 [2022-07-19 18:46:57,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 18:46:57,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-19 18:46:57,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-07-19 18:46:57,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 69 states have internal predecessors, (88), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-19 18:46:57,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 152 transitions. [2022-07-19 18:46:57,273 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 152 transitions. Word has length 120 [2022-07-19 18:46:57,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:46:57,275 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 152 transitions. [2022-07-19 18:46:57,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-19 18:46:57,276 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 152 transitions. [2022-07-19 18:46:57,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-19 18:46:57,286 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:46:57,286 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:46:57,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-19 18:46:57,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 18:46:57,512 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:46:57,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:46:57,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1758045659, now seen corresponding path program 1 times [2022-07-19 18:46:57,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 18:46:57,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1739052186] [2022-07-19 18:46:57,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:46:57,513 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 18:46:57,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 18:46:57,517 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 18:46:57,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-19 18:46:59,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:46:59,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 2760 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 18:46:59,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:46:59,588 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-07-19 18:46:59,589 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 18:46:59,589 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 18:46:59,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1739052186] [2022-07-19 18:46:59,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1739052186] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 18:46:59,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 18:46:59,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 18:46:59,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487322494] [2022-07-19 18:46:59,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 18:46:59,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 18:46:59,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 18:46:59,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 18:46:59,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 18:46:59,591 INFO L87 Difference]: Start difference. First operand 107 states and 152 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-19 18:46:59,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:46:59,806 INFO L93 Difference]: Finished difference Result 212 states and 302 transitions. [2022-07-19 18:46:59,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 18:46:59,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2022-07-19 18:46:59,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:46:59,812 INFO L225 Difference]: With dead ends: 212 [2022-07-19 18:46:59,812 INFO L226 Difference]: Without dead ends: 111 [2022-07-19 18:46:59,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 18:46:59,814 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 4 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 18:46:59,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 296 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 18:46:59,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-19 18:46:59,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2022-07-19 18:46:59,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 70 states have (on average 1.2714285714285714) internal successors, (89), 70 states have internal predecessors, (89), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-19 18:46:59,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2022-07-19 18:46:59,830 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 120 [2022-07-19 18:46:59,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:46:59,830 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2022-07-19 18:46:59,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-19 18:46:59,830 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2022-07-19 18:46:59,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-19 18:46:59,832 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:46:59,832 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:46:59,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-19 18:47:00,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 18:47:00,052 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:47:00,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:47:00,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1912175905, now seen corresponding path program 1 times [2022-07-19 18:47:00,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 18:47:00,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [834526024] [2022-07-19 18:47:00,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:47:00,054 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 18:47:00,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 18:47:00,061 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 18:47:00,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-19 18:47:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:47:02,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 2797 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 18:47:02,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:47:02,344 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-07-19 18:47:02,355 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 18:47:02,355 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 18:47:02,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [834526024] [2022-07-19 18:47:02,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [834526024] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 18:47:02,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 18:47:02,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 18:47:02,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640071261] [2022-07-19 18:47:02,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 18:47:02,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 18:47:02,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 18:47:02,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 18:47:02,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 18:47:02,359 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-19 18:47:02,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:47:02,426 INFO L93 Difference]: Finished difference Result 215 states and 306 transitions. [2022-07-19 18:47:02,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 18:47:02,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 123 [2022-07-19 18:47:02,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:47:02,427 INFO L225 Difference]: With dead ends: 215 [2022-07-19 18:47:02,427 INFO L226 Difference]: Without dead ends: 110 [2022-07-19 18:47:02,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 18:47:02,428 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 18:47:02,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 297 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 18:47:02,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-07-19 18:47:02,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2022-07-19 18:47:02,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 71 states have (on average 1.267605633802817) internal successors, (90), 71 states have internal predecessors, (90), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-19 18:47:02,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 154 transitions. [2022-07-19 18:47:02,446 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 154 transitions. Word has length 123 [2022-07-19 18:47:02,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:47:02,446 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 154 transitions. [2022-07-19 18:47:02,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-19 18:47:02,446 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 154 transitions. [2022-07-19 18:47:02,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-19 18:47:02,447 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:47:02,447 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:47:02,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-19 18:47:02,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 18:47:02,648 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:47:02,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:47:02,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1930143839, now seen corresponding path program 1 times [2022-07-19 18:47:02,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 18:47:02,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2132284182] [2022-07-19 18:47:02,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:47:02,649 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 18:47:02,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 18:47:02,651 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 18:47:02,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-19 18:47:04,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:47:05,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 2818 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 18:47:05,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:47:05,053 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-07-19 18:47:05,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 18:47:05,142 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-07-19 18:47:05,144 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 18:47:05,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2132284182] [2022-07-19 18:47:05,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2132284182] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 18:47:05,146 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 18:47:05,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-19 18:47:05,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975768767] [2022-07-19 18:47:05,148 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 18:47:05,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 18:47:05,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 18:47:05,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 18:47:05,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-19 18:47:05,150 INFO L87 Difference]: Start difference. First operand 109 states and 154 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2022-07-19 18:47:05,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:47:05,302 INFO L93 Difference]: Finished difference Result 219 states and 311 transitions. [2022-07-19 18:47:05,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 18:47:05,303 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 125 [2022-07-19 18:47:05,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:47:05,304 INFO L225 Difference]: With dead ends: 219 [2022-07-19 18:47:05,304 INFO L226 Difference]: Without dead ends: 113 [2022-07-19 18:47:05,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-19 18:47:05,305 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 3 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 18:47:05,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 738 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 18:47:05,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-19 18:47:05,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-07-19 18:47:05,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 75 states have internal predecessors, (94), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-19 18:47:05,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 158 transitions. [2022-07-19 18:47:05,315 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 158 transitions. Word has length 125 [2022-07-19 18:47:05,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:47:05,315 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 158 transitions. [2022-07-19 18:47:05,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2022-07-19 18:47:05,315 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 158 transitions. [2022-07-19 18:47:05,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-19 18:47:05,316 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:47:05,317 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:47:05,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-19 18:47:05,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 18:47:05,528 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:47:05,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:47:05,528 INFO L85 PathProgramCache]: Analyzing trace with hash -28203099, now seen corresponding path program 2 times [2022-07-19 18:47:05,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 18:47:05,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1244593823] [2022-07-19 18:47:05,529 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 18:47:05,529 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 18:47:05,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 18:47:05,532 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 18:47:05,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-19 18:47:07,783 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-19 18:47:07,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 18:47:07,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 2595 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 18:47:07,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:47:08,002 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 622 trivial. 0 not checked. [2022-07-19 18:47:08,003 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 18:47:08,003 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 18:47:08,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1244593823] [2022-07-19 18:47:08,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1244593823] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 18:47:08,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 18:47:08,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 18:47:08,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829709499] [2022-07-19 18:47:08,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 18:47:08,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 18:47:08,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 18:47:08,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 18:47:08,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 18:47:08,005 INFO L87 Difference]: Start difference. First operand 113 states and 158 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-19 18:47:08,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:47:08,025 INFO L93 Difference]: Finished difference Result 209 states and 294 transitions. [2022-07-19 18:47:08,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 18:47:08,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2022-07-19 18:47:08,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:47:08,027 INFO L225 Difference]: With dead ends: 209 [2022-07-19 18:47:08,027 INFO L226 Difference]: Without dead ends: 113 [2022-07-19 18:47:08,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 18:47:08,029 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 18:47:08,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 298 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 18:47:08,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-19 18:47:08,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-07-19 18:47:08,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 75 states have (on average 1.24) internal successors, (93), 75 states have internal predecessors, (93), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-19 18:47:08,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 157 transitions. [2022-07-19 18:47:08,050 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 157 transitions. Word has length 129 [2022-07-19 18:47:08,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:47:08,050 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 157 transitions. [2022-07-19 18:47:08,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-19 18:47:08,050 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 157 transitions. [2022-07-19 18:47:08,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-07-19 18:47:08,053 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:47:08,053 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:47:08,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-19 18:47:08,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 18:47:08,275 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:47:08,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:47:08,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1960175216, now seen corresponding path program 1 times [2022-07-19 18:47:08,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 18:47:08,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1456830635] [2022-07-19 18:47:08,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:47:08,277 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 18:47:08,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 18:47:08,280 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 18:47:08,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-19 18:47:10,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:47:10,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 2952 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 18:47:10,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:47:10,999 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2022-07-19 18:47:11,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 18:47:11,089 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2022-07-19 18:47:11,089 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 18:47:11,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1456830635] [2022-07-19 18:47:11,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1456830635] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 18:47:11,090 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 18:47:11,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-19 18:47:11,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86552919] [2022-07-19 18:47:11,090 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 18:47:11,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 18:47:11,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 18:47:11,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 18:47:11,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-19 18:47:11,091 INFO L87 Difference]: Start difference. First operand 113 states and 157 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2022-07-19 18:47:11,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:47:11,520 INFO L93 Difference]: Finished difference Result 232 states and 322 transitions. [2022-07-19 18:47:11,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 18:47:11,521 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 149 [2022-07-19 18:47:11,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:47:11,522 INFO L225 Difference]: With dead ends: 232 [2022-07-19 18:47:11,522 INFO L226 Difference]: Without dead ends: 131 [2022-07-19 18:47:11,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-19 18:47:11,523 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 12 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 18:47:11,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 444 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 18:47:11,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-19 18:47:11,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-07-19 18:47:11,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 93 states have (on average 1.2150537634408602) internal successors, (113), 93 states have internal predecessors, (113), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-19 18:47:11,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 177 transitions. [2022-07-19 18:47:11,531 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 177 transitions. Word has length 149 [2022-07-19 18:47:11,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:47:11,535 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 177 transitions. [2022-07-19 18:47:11,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2022-07-19 18:47:11,535 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 177 transitions. [2022-07-19 18:47:11,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-07-19 18:47:11,538 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:47:11,538 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 9, 9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:47:11,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-19 18:47:11,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 18:47:11,752 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:47:11,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:47:11,752 INFO L85 PathProgramCache]: Analyzing trace with hash -375854704, now seen corresponding path program 2 times [2022-07-19 18:47:11,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 18:47:11,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [298418155] [2022-07-19 18:47:11,753 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 18:47:11,753 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 18:47:11,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 18:47:11,754 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 18:47:11,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-19 18:47:14,272 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-19 18:47:14,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 18:47:14,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 2646 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 18:47:14,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:47:14,656 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2022-07-19 18:47:14,656 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 18:47:14,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 18:47:14,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [298418155] [2022-07-19 18:47:14,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [298418155] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 18:47:14,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 18:47:14,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 18:47:14,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268165801] [2022-07-19 18:47:14,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 18:47:14,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 18:47:14,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 18:47:14,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 18:47:14,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 18:47:14,657 INFO L87 Difference]: Start difference. First operand 131 states and 177 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-19 18:47:15,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:47:15,193 INFO L93 Difference]: Finished difference Result 241 states and 341 transitions. [2022-07-19 18:47:15,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 18:47:15,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 167 [2022-07-19 18:47:15,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:47:15,196 INFO L225 Difference]: With dead ends: 241 [2022-07-19 18:47:15,196 INFO L226 Difference]: Without dead ends: 199 [2022-07-19 18:47:15,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-19 18:47:15,197 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 119 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 18:47:15,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 428 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 18:47:15,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-19 18:47:15,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2022-07-19 18:47:15,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 138 states have (on average 1.2608695652173914) internal successors, (174), 139 states have internal predecessors, (174), 48 states have call successors, (48), 10 states have call predecessors, (48), 12 states have return successors, (57), 49 states have call predecessors, (57), 48 states have call successors, (57) [2022-07-19 18:47:15,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 279 transitions. [2022-07-19 18:47:15,207 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 279 transitions. Word has length 167 [2022-07-19 18:47:15,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:47:15,207 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 279 transitions. [2022-07-19 18:47:15,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-19 18:47:15,207 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 279 transitions. [2022-07-19 18:47:15,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-07-19 18:47:15,209 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:47:15,210 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 9, 9, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:47:15,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-07-19 18:47:15,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 18:47:15,436 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:47:15,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:47:15,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1496592282, now seen corresponding path program 1 times [2022-07-19 18:47:15,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 18:47:15,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [530884226] [2022-07-19 18:47:15,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:47:15,437 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 18:47:15,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 18:47:15,438 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 18:47:15,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-19 18:47:18,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:47:19,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 3407 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 18:47:19,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:47:19,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1203 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2022-07-19 18:47:19,102 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 18:47:19,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 18:47:19,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [530884226] [2022-07-19 18:47:19,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [530884226] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 18:47:19,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 18:47:19,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 18:47:19,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760456965] [2022-07-19 18:47:19,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 18:47:19,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 18:47:19,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 18:47:19,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 18:47:19,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 18:47:19,104 INFO L87 Difference]: Start difference. First operand 199 states and 279 transitions. Second operand has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (30), 3 states have call predecessors, (30), 4 states have return successors, (30), 2 states have call predecessors, (30), 3 states have call successors, (30) [2022-07-19 18:47:20,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:47:20,030 INFO L93 Difference]: Finished difference Result 525 states and 795 transitions. [2022-07-19 18:47:20,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 18:47:20,030 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (30), 3 states have call predecessors, (30), 4 states have return successors, (30), 2 states have call predecessors, (30), 3 states have call successors, (30) Word has length 244 [2022-07-19 18:47:20,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:47:20,032 INFO L225 Difference]: With dead ends: 525 [2022-07-19 18:47:20,032 INFO L226 Difference]: Without dead ends: 359 [2022-07-19 18:47:20,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 239 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-19 18:47:20,033 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 142 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-19 18:47:20,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 581 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-19 18:47:20,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-07-19 18:47:20,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 304. [2022-07-19 18:47:20,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 208 states have (on average 1.2067307692307692) internal successors, (251), 202 states have internal predecessors, (251), 73 states have call successors, (73), 14 states have call predecessors, (73), 22 states have return successors, (111), 87 states have call predecessors, (111), 73 states have call successors, (111) [2022-07-19 18:47:20,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 435 transitions. [2022-07-19 18:47:20,083 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 435 transitions. Word has length 244 [2022-07-19 18:47:20,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:47:20,083 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 435 transitions. [2022-07-19 18:47:20,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (30), 3 states have call predecessors, (30), 4 states have return successors, (30), 2 states have call predecessors, (30), 3 states have call successors, (30) [2022-07-19 18:47:20,084 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 435 transitions. [2022-07-19 18:47:20,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-07-19 18:47:20,088 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:47:20,088 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 9, 9, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:47:20,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-19 18:47:20,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 18:47:20,307 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:47:20,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:47:20,308 INFO L85 PathProgramCache]: Analyzing trace with hash -624181720, now seen corresponding path program 1 times [2022-07-19 18:47:20,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 18:47:20,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1975596834] [2022-07-19 18:47:20,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:47:20,309 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 18:47:20,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 18:47:20,311 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 18:47:20,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-19 18:47:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:47:23,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 3408 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 18:47:24,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:47:24,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1203 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2022-07-19 18:47:24,121 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 18:47:24,121 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 18:47:24,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1975596834] [2022-07-19 18:47:24,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1975596834] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 18:47:24,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 18:47:24,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 18:47:24,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414988829] [2022-07-19 18:47:24,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 18:47:24,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 18:47:24,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 18:47:24,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 18:47:24,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 18:47:24,146 INFO L87 Difference]: Start difference. First operand 304 states and 435 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 3 states have call predecessors, (30), 2 states have call successors, (30) [2022-07-19 18:47:24,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:47:24,528 INFO L93 Difference]: Finished difference Result 700 states and 1024 transitions. [2022-07-19 18:47:24,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 18:47:24,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 3 states have call predecessors, (30), 2 states have call successors, (30) Word has length 244 [2022-07-19 18:47:24,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:47:24,534 INFO L225 Difference]: With dead ends: 700 [2022-07-19 18:47:24,534 INFO L226 Difference]: Without dead ends: 429 [2022-07-19 18:47:24,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-19 18:47:24,538 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 257 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 18:47:24,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 325 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 18:47:24,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-07-19 18:47:24,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 419. [2022-07-19 18:47:24,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 280 states have (on average 1.1357142857142857) internal successors, (318), 271 states have internal predecessors, (318), 111 states have call successors, (111), 17 states have call predecessors, (111), 27 states have return successors, (157), 130 states have call predecessors, (157), 111 states have call successors, (157) [2022-07-19 18:47:24,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 586 transitions. [2022-07-19 18:47:24,578 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 586 transitions. Word has length 244 [2022-07-19 18:47:24,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:47:24,578 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 586 transitions. [2022-07-19 18:47:24,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 3 states have call predecessors, (30), 2 states have call successors, (30) [2022-07-19 18:47:24,579 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 586 transitions. [2022-07-19 18:47:24,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-07-19 18:47:24,583 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:47:24,583 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 9, 9, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:47:24,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-19 18:47:24,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 18:47:24,798 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:47:24,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:47:24,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1590201898, now seen corresponding path program 1 times [2022-07-19 18:47:24,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 18:47:24,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1727288470] [2022-07-19 18:47:24,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:47:24,799 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 18:47:24,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 18:47:24,801 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 18:47:24,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-19 18:47:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:47:28,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 3399 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 18:47:28,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:47:28,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1203 backedges. 360 proven. 7 refuted. 0 times theorem prover too weak. 836 trivial. 0 not checked. [2022-07-19 18:47:28,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 18:47:28,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1203 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1196 trivial. 0 not checked. [2022-07-19 18:47:28,964 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 18:47:28,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1727288470] [2022-07-19 18:47:28,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1727288470] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 18:47:28,964 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 18:47:28,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2022-07-19 18:47:28,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846041681] [2022-07-19 18:47:28,964 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 18:47:28,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 18:47:28,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 18:47:28,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 18:47:28,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-19 18:47:28,966 INFO L87 Difference]: Start difference. First operand 419 states and 586 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 7 states have call successors, (50), 4 states have call predecessors, (50), 6 states have return successors, (50), 7 states have call predecessors, (50), 7 states have call successors, (50) [2022-07-19 18:47:30,987 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 18:47:32,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:47:32,238 INFO L93 Difference]: Finished difference Result 1063 states and 1530 transitions. [2022-07-19 18:47:32,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 18:47:32,239 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 7 states have call successors, (50), 4 states have call predecessors, (50), 6 states have return successors, (50), 7 states have call predecessors, (50), 7 states have call successors, (50) Word has length 244 [2022-07-19 18:47:32,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:47:32,243 INFO L225 Difference]: With dead ends: 1063 [2022-07-19 18:47:32,243 INFO L226 Difference]: Without dead ends: 677 [2022-07-19 18:47:32,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 482 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-19 18:47:32,246 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 181 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 94 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-19 18:47:32,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 517 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 360 Invalid, 1 Unknown, 0 Unchecked, 3.2s Time] [2022-07-19 18:47:32,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2022-07-19 18:47:32,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 660. [2022-07-19 18:47:32,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 445 states have (on average 1.1280898876404495) internal successors, (502), 438 states have internal predecessors, (502), 153 states have call successors, (153), 39 states have call predecessors, (153), 61 states have return successors, (263), 182 states have call predecessors, (263), 153 states have call successors, (263) [2022-07-19 18:47:32,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 918 transitions. [2022-07-19 18:47:32,277 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 918 transitions. Word has length 244 [2022-07-19 18:47:32,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:47:32,277 INFO L495 AbstractCegarLoop]: Abstraction has 660 states and 918 transitions. [2022-07-19 18:47:32,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 7 states have call successors, (50), 4 states have call predecessors, (50), 6 states have return successors, (50), 7 states have call predecessors, (50), 7 states have call successors, (50) [2022-07-19 18:47:32,278 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 918 transitions. [2022-07-19 18:47:32,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-07-19 18:47:32,283 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:47:32,283 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 9, 9, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:47:32,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-19 18:47:32,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 18:47:32,498 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:47:32,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:47:32,498 INFO L85 PathProgramCache]: Analyzing trace with hash 714181578, now seen corresponding path program 1 times [2022-07-19 18:47:32,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 18:47:32,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1752328975] [2022-07-19 18:47:32,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:47:32,499 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 18:47:32,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 18:47:32,500 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 18:47:32,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-19 18:48:11,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:48:12,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 3501 conjuncts, 1570 conjunts are in the unsatisfiable core [2022-07-19 18:48:12,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:48:12,441 INFO L356 Elim1Store]: treesize reduction 114, result has 29.2 percent of original size [2022-07-19 18:48:12,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 1366 treesize of output 1384 [2022-07-19 18:48:13,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 42 [2022-07-19 18:48:13,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-19 18:48:13,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2022-07-19 18:48:13,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2022-07-19 18:48:13,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2022-07-19 18:48:14,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 35 [2022-07-19 18:48:15,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 14 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2022-07-19 18:48:15,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 35 [2022-07-19 18:48:25,647 WARN L233 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-19 18:48:25,648 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 18:48:25,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 91 [2022-07-19 18:48:25,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 86 [2022-07-19 18:48:40,457 INFO L356 Elim1Store]: treesize reduction 39, result has 29.1 percent of original size [2022-07-19 18:48:40,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 53 [2022-07-19 18:48:40,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 50 [2022-07-19 18:48:49,016 INFO L356 Elim1Store]: treesize reduction 39, result has 29.1 percent of original size [2022-07-19 18:48:49,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 53 [2022-07-19 18:48:49,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 50 [2022-07-19 18:48:49,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 14 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2022-07-19 18:48:49,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 35 [2022-07-19 18:49:02,384 INFO L356 Elim1Store]: treesize reduction 31, result has 43.6 percent of original size [2022-07-19 18:49:02,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 61 [2022-07-19 18:49:02,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 58