./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl/s3_srvr.blast.09.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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/openssl/s3_srvr.blast.09.i.cil-1.c -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 7b66a12741a993de3de45354c2fb746af1f1a44b9ceb94bb607376650a8088af --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:38:48,522 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:38:48,524 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:38:48,563 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:38:48,563 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:38:48,564 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:38:48,565 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:38:48,567 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:38:48,568 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:38:48,571 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:38:48,572 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:38:48,574 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:38:48,574 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:38:48,575 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:38:48,576 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:38:48,579 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:38:48,579 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:38:48,580 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:38:48,581 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:38:48,584 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:38:48,586 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:38:48,586 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:38:48,587 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:38:48,588 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:38:48,589 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:38:48,591 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:38:48,592 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:38:48,592 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:38:48,592 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:38:48,593 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:38:48,594 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:38:48,594 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:38:48,595 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:38:48,595 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:38:48,596 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:38:48,596 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:38:48,596 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:38:48,597 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:38:48,597 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:38:48,597 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:38:48,598 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:38:48,599 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:38:48,600 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 11:38:48,621 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:38:48,622 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:38:48,622 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:38:48,622 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:38:48,623 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:38:48,623 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:38:48,623 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:38:48,623 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:38:48,624 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:38:48,624 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:38:48,624 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:38:48,624 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 11:38:48,625 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:38:48,625 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:38:48,625 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:38:48,625 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:38:48,625 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:38:48,625 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:38:48,625 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:38:48,626 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:38:48,626 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:38:48,627 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:38:48,627 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:38:48,627 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:38:48,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:38:48,627 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:38:48,627 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:38:48,628 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:38:48,628 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 11:38:48,628 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 11:38:48,628 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:38:48,628 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:38:48,628 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:38:48,628 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 -> 7b66a12741a993de3de45354c2fb746af1f1a44b9ceb94bb607376650a8088af [2022-07-13 11:38:48,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:38:48,812 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:38:48,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:38:48,815 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:38:48,816 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:38:48,817 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.09.i.cil-1.c [2022-07-13 11:38:48,867 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bfe5c769/fa8971ee378442689e6fea8d23017eee/FLAG8f645dd6d [2022-07-13 11:38:49,273 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:38:49,274 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.09.i.cil-1.c [2022-07-13 11:38:49,289 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bfe5c769/fa8971ee378442689e6fea8d23017eee/FLAG8f645dd6d [2022-07-13 11:38:49,297 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bfe5c769/fa8971ee378442689e6fea8d23017eee [2022-07-13 11:38:49,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:38:49,299 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:38:49,303 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:38:49,303 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:38:49,305 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:38:49,305 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:38:49" (1/1) ... [2022-07-13 11:38:49,306 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@369d0aeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:38:49, skipping insertion in model container [2022-07-13 11:38:49,306 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:38:49" (1/1) ... [2022-07-13 11:38:49,310 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:38:49,357 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:38:49,644 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/openssl/s3_srvr.blast.09.i.cil-1.c[74369,74382] [2022-07-13 11:38:49,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:38:49,662 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:38:49,734 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/openssl/s3_srvr.blast.09.i.cil-1.c[74369,74382] [2022-07-13 11:38:49,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:38:49,746 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:38:49,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:38:49 WrapperNode [2022-07-13 11:38:49,746 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:38:49,747 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:38:49,747 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:38:49,747 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:38:49,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:38:49" (1/1) ... [2022-07-13 11:38:49,773 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:38:49" (1/1) ... [2022-07-13 11:38:49,805 INFO L137 Inliner]: procedures = 31, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 792 [2022-07-13 11:38:49,805 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:38:49,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:38:49,806 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:38:49,806 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:38:49,812 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:38:49" (1/1) ... [2022-07-13 11:38:49,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:38:49" (1/1) ... [2022-07-13 11:38:49,818 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:38:49" (1/1) ... [2022-07-13 11:38:49,819 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:38:49" (1/1) ... [2022-07-13 11:38:49,857 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:38:49" (1/1) ... [2022-07-13 11:38:49,861 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:38:49" (1/1) ... [2022-07-13 11:38:49,869 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:38:49" (1/1) ... [2022-07-13 11:38:49,881 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:38:49,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:38:49,883 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:38:49,883 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:38:49,883 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:38:49" (1/1) ... [2022-07-13 11:38:49,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:38:49,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:38:49,909 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-13 11:38:49,910 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-13 11:38:49,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:38:49,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 11:38:49,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 11:38:49,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 11:38:49,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 11:38:49,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 11:38:49,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 11:38:49,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:38:49,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:38:50,096 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:38:50,097 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:38:50,107 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:38:51,031 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-13 11:38:51,031 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-13 11:38:51,031 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:38:51,038 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:38:51,038 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 11:38:51,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:38:51 BoogieIcfgContainer [2022-07-13 11:38:51,040 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:38:51,042 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:38:51,042 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:38:51,044 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:38:51,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:38:49" (1/3) ... [2022-07-13 11:38:51,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a4d9676 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:38:51, skipping insertion in model container [2022-07-13 11:38:51,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:38:49" (2/3) ... [2022-07-13 11:38:51,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a4d9676 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:38:51, skipping insertion in model container [2022-07-13 11:38:51,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:38:51" (3/3) ... [2022-07-13 11:38:51,046 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.09.i.cil-1.c [2022-07-13 11:38:51,054 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:38:51,055 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:38:51,097 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:38:51,109 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@7a027aa8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@76d9d345 [2022-07-13 11:38:51,109 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:38:51,113 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 148 states have (on average 1.7162162162162162) internal successors, (254), 149 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:51,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 11:38:51,120 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:38:51,120 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:38:51,120 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:38:51,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:38:51,125 INFO L85 PathProgramCache]: Analyzing trace with hash -442385418, now seen corresponding path program 1 times [2022-07-13 11:38:51,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:38:51,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691601645] [2022-07-13 11:38:51,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:38:51,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:38:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:38:51,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:38:51,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:38:51,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691601645] [2022-07-13 11:38:51,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691601645] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:38:51,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:38:51,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:38:51,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340625053] [2022-07-13 11:38:51,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:38:51,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:38:51,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:38:51,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:38:51,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:38:51,466 INFO L87 Difference]: Start difference. First operand has 150 states, 148 states have (on average 1.7162162162162162) internal successors, (254), 149 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:52,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:38:52,232 INFO L93 Difference]: Finished difference Result 421 states and 717 transitions. [2022-07-13 11:38:52,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:38:52,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-13 11:38:52,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:38:52,242 INFO L225 Difference]: With dead ends: 421 [2022-07-13 11:38:52,244 INFO L226 Difference]: Without dead ends: 256 [2022-07-13 11:38:52,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:38:52,253 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 169 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 11:38:52,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 439 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 11:38:52,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-07-13 11:38:52,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 165. [2022-07-13 11:38:52,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.5853658536585367) internal successors, (260), 164 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:52,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 260 transitions. [2022-07-13 11:38:52,307 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 260 transitions. Word has length 37 [2022-07-13 11:38:52,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:38:52,308 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 260 transitions. [2022-07-13 11:38:52,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:52,308 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 260 transitions. [2022-07-13 11:38:52,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-13 11:38:52,310 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:38:52,311 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:38:52,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 11:38:52,311 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:38:52,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:38:52,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1559591930, now seen corresponding path program 1 times [2022-07-13 11:38:52,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:38:52,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617048910] [2022-07-13 11:38:52,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:38:52,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:38:52,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:38:52,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:38:52,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:38:52,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617048910] [2022-07-13 11:38:52,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617048910] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:38:52,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:38:52,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:38:52,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293997256] [2022-07-13 11:38:52,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:38:52,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:38:52,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:38:52,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:38:52,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:38:52,452 INFO L87 Difference]: Start difference. First operand 165 states and 260 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:52,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:38:52,986 INFO L93 Difference]: Finished difference Result 348 states and 547 transitions. [2022-07-13 11:38:52,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:38:52,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-13 11:38:52,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:38:52,987 INFO L225 Difference]: With dead ends: 348 [2022-07-13 11:38:52,988 INFO L226 Difference]: Without dead ends: 193 [2022-07-13 11:38:52,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:38:52,989 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 22 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 11:38:52,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 469 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 11:38:52,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-07-13 11:38:52,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 176. [2022-07-13 11:38:52,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 175 states have (on average 1.5942857142857143) internal successors, (279), 175 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:52,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 279 transitions. [2022-07-13 11:38:52,995 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 279 transitions. Word has length 38 [2022-07-13 11:38:52,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:38:52,996 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 279 transitions. [2022-07-13 11:38:52,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:52,996 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 279 transitions. [2022-07-13 11:38:52,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-13 11:38:52,997 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:38:52,997 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 11:38:52,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 11:38:52,998 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:38:52,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:38:52,998 INFO L85 PathProgramCache]: Analyzing trace with hash 103815440, now seen corresponding path program 1 times [2022-07-13 11:38:52,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:38:52,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350064572] [2022-07-13 11:38:52,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:38:52,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:38:53,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:38:53,087 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:38:53,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:38:53,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350064572] [2022-07-13 11:38:53,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350064572] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:38:53,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:38:53,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:38:53,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743372739] [2022-07-13 11:38:53,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:38:53,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:38:53,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:38:53,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:38:53,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:38:53,090 INFO L87 Difference]: Start difference. First operand 176 states and 279 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:54,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:38:54,058 INFO L93 Difference]: Finished difference Result 478 states and 761 transitions. [2022-07-13 11:38:54,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:38:54,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-07-13 11:38:54,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:38:54,060 INFO L225 Difference]: With dead ends: 478 [2022-07-13 11:38:54,060 INFO L226 Difference]: Without dead ends: 323 [2022-07-13 11:38:54,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:38:54,061 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 147 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 11:38:54,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 620 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-13 11:38:54,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-07-13 11:38:54,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 208. [2022-07-13 11:38:54,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 1.5942028985507246) internal successors, (330), 207 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:54,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 330 transitions. [2022-07-13 11:38:54,068 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 330 transitions. Word has length 51 [2022-07-13 11:38:54,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:38:54,068 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 330 transitions. [2022-07-13 11:38:54,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:54,068 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 330 transitions. [2022-07-13 11:38:54,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-13 11:38:54,069 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:38:54,070 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 11:38:54,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 11:38:54,070 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:38:54,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:38:54,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1022264289, now seen corresponding path program 1 times [2022-07-13 11:38:54,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:38:54,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622671163] [2022-07-13 11:38:54,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:38:54,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:38:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:38:54,208 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:38:54,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:38:54,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622671163] [2022-07-13 11:38:54,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622671163] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:38:54,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:38:54,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:38:54,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245392650] [2022-07-13 11:38:54,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:38:54,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:38:54,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:38:54,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:38:54,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:38:54,214 INFO L87 Difference]: Start difference. First operand 208 states and 330 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:55,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:38:55,087 INFO L93 Difference]: Finished difference Result 497 states and 786 transitions. [2022-07-13 11:38:55,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:38:55,087 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-07-13 11:38:55,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:38:55,089 INFO L225 Difference]: With dead ends: 497 [2022-07-13 11:38:55,089 INFO L226 Difference]: Without dead ends: 310 [2022-07-13 11:38:55,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:38:55,090 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 152 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 11:38:55,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 332 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-13 11:38:55,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-07-13 11:38:55,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 208. [2022-07-13 11:38:55,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 1.5748792270531402) internal successors, (326), 207 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:55,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 326 transitions. [2022-07-13 11:38:55,096 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 326 transitions. Word has length 52 [2022-07-13 11:38:55,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:38:55,096 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 326 transitions. [2022-07-13 11:38:55,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:55,096 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 326 transitions. [2022-07-13 11:38:55,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-13 11:38:55,097 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:38:55,098 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 11:38:55,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 11:38:55,098 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:38:55,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:38:55,098 INFO L85 PathProgramCache]: Analyzing trace with hash 40885771, now seen corresponding path program 1 times [2022-07-13 11:38:55,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:38:55,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819960861] [2022-07-13 11:38:55,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:38:55,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:38:55,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:38:55,174 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:38:55,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:38:55,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819960861] [2022-07-13 11:38:55,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819960861] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:38:55,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:38:55,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:38:55,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451158880] [2022-07-13 11:38:55,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:38:55,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:38:55,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:38:55,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:38:55,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:38:55,176 INFO L87 Difference]: Start difference. First operand 208 states and 326 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:55,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:38:55,871 INFO L93 Difference]: Finished difference Result 411 states and 641 transitions. [2022-07-13 11:38:55,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:38:55,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-07-13 11:38:55,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:38:55,873 INFO L225 Difference]: With dead ends: 411 [2022-07-13 11:38:55,873 INFO L226 Difference]: Without dead ends: 224 [2022-07-13 11:38:55,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:38:55,874 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 26 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 11:38:55,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 473 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 11:38:55,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-07-13 11:38:55,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 208. [2022-07-13 11:38:55,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 1.570048309178744) internal successors, (325), 207 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:55,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 325 transitions. [2022-07-13 11:38:55,878 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 325 transitions. Word has length 52 [2022-07-13 11:38:55,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:38:55,878 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 325 transitions. [2022-07-13 11:38:55,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:55,878 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 325 transitions. [2022-07-13 11:38:55,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-13 11:38:55,879 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:38:55,879 INFO L195 NwaCegarLoop]: trace histogram [2, 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] [2022-07-13 11:38:55,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 11:38:55,879 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:38:55,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:38:55,879 INFO L85 PathProgramCache]: Analyzing trace with hash 861050644, now seen corresponding path program 1 times [2022-07-13 11:38:55,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:38:55,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322835316] [2022-07-13 11:38:55,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:38:55,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:38:55,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:38:55,946 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:38:55,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:38:55,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322835316] [2022-07-13 11:38:55,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322835316] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:38:55,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:38:55,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:38:55,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112988655] [2022-07-13 11:38:55,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:38:55,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:38:55,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:38:55,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:38:55,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:38:55,948 INFO L87 Difference]: Start difference. First operand 208 states and 325 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:56,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:38:56,388 INFO L93 Difference]: Finished difference Result 410 states and 639 transitions. [2022-07-13 11:38:56,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:38:56,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-07-13 11:38:56,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:38:56,389 INFO L225 Difference]: With dead ends: 410 [2022-07-13 11:38:56,389 INFO L226 Difference]: Without dead ends: 223 [2022-07-13 11:38:56,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:38:56,390 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 19 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:38:56,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 475 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 11:38:56,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-07-13 11:38:56,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 208. [2022-07-13 11:38:56,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 1.565217391304348) internal successors, (324), 207 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:56,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 324 transitions. [2022-07-13 11:38:56,395 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 324 transitions. Word has length 52 [2022-07-13 11:38:56,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:38:56,395 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 324 transitions. [2022-07-13 11:38:56,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:56,395 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 324 transitions. [2022-07-13 11:38:56,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-13 11:38:56,396 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:38:56,396 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 11:38:56,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 11:38:56,396 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:38:56,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:38:56,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1296410196, now seen corresponding path program 1 times [2022-07-13 11:38:56,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:38:56,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562672550] [2022-07-13 11:38:56,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:38:56,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:38:56,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:38:56,478 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:38:56,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:38:56,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562672550] [2022-07-13 11:38:56,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562672550] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:38:56,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:38:56,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:38:56,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008863351] [2022-07-13 11:38:56,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:38:56,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:38:56,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:38:56,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:38:56,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:38:56,480 INFO L87 Difference]: Start difference. First operand 208 states and 324 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:57,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:38:57,250 INFO L93 Difference]: Finished difference Result 497 states and 777 transitions. [2022-07-13 11:38:57,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:38:57,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-07-13 11:38:57,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:38:57,252 INFO L225 Difference]: With dead ends: 497 [2022-07-13 11:38:57,252 INFO L226 Difference]: Without dead ends: 310 [2022-07-13 11:38:57,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:38:57,253 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 145 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 11:38:57,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 332 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 11:38:57,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-07-13 11:38:57,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 209. [2022-07-13 11:38:57,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.5528846153846154) internal successors, (323), 208 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:57,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 323 transitions. [2022-07-13 11:38:57,257 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 323 transitions. Word has length 52 [2022-07-13 11:38:57,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:38:57,258 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 323 transitions. [2022-07-13 11:38:57,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:57,258 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 323 transitions. [2022-07-13 11:38:57,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-13 11:38:57,258 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:38:57,259 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 11:38:57,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 11:38:57,259 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:38:57,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:38:57,259 INFO L85 PathProgramCache]: Analyzing trace with hash 585554567, now seen corresponding path program 1 times [2022-07-13 11:38:57,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:38:57,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228079788] [2022-07-13 11:38:57,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:38:57,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:38:57,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:38:57,325 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:38:57,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:38:57,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228079788] [2022-07-13 11:38:57,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228079788] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:38:57,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:38:57,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:38:57,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68074711] [2022-07-13 11:38:57,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:38:57,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:38:57,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:38:57,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:38:57,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:38:57,328 INFO L87 Difference]: Start difference. First operand 209 states and 323 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:58,487 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:38:58,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:38:58,653 INFO L93 Difference]: Finished difference Result 410 states and 635 transitions. [2022-07-13 11:38:58,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:38:58,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-07-13 11:38:58,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:38:58,654 INFO L225 Difference]: With dead ends: 410 [2022-07-13 11:38:58,654 INFO L226 Difference]: Without dead ends: 222 [2022-07-13 11:38:58,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:38:58,655 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 22 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:38:58,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 479 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-13 11:38:58,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-07-13 11:38:58,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 209. [2022-07-13 11:38:58,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.5480769230769231) internal successors, (322), 208 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:58,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 322 transitions. [2022-07-13 11:38:58,659 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 322 transitions. Word has length 53 [2022-07-13 11:38:58,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:38:58,659 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 322 transitions. [2022-07-13 11:38:58,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:58,660 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 322 transitions. [2022-07-13 11:38:58,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-13 11:38:58,660 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:38:58,660 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 11:38:58,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 11:38:58,661 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:38:58,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:38:58,661 INFO L85 PathProgramCache]: Analyzing trace with hash -991616538, now seen corresponding path program 1 times [2022-07-13 11:38:58,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:38:58,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244446392] [2022-07-13 11:38:58,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:38:58,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:38:58,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:38:58,748 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:38:58,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:38:58,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244446392] [2022-07-13 11:38:58,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244446392] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:38:58,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:38:58,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:38:58,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100562960] [2022-07-13 11:38:58,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:38:58,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:38:58,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:38:58,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:38:58,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:38:58,752 INFO L87 Difference]: Start difference. First operand 209 states and 322 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:59,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:38:59,214 INFO L93 Difference]: Finished difference Result 498 states and 773 transitions. [2022-07-13 11:38:59,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:38:59,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-07-13 11:38:59,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:38:59,215 INFO L225 Difference]: With dead ends: 498 [2022-07-13 11:38:59,215 INFO L226 Difference]: Without dead ends: 310 [2022-07-13 11:38:59,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:38:59,216 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 147 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:38:59,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 332 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 11:38:59,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-07-13 11:38:59,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 209. [2022-07-13 11:38:59,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.5288461538461537) internal successors, (318), 208 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:59,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 318 transitions. [2022-07-13 11:38:59,220 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 318 transitions. Word has length 54 [2022-07-13 11:38:59,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:38:59,220 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 318 transitions. [2022-07-13 11:38:59,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:59,220 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 318 transitions. [2022-07-13 11:38:59,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-13 11:38:59,221 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:38:59,221 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 11:38:59,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 11:38:59,221 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:38:59,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:38:59,221 INFO L85 PathProgramCache]: Analyzing trace with hash 373652162, now seen corresponding path program 1 times [2022-07-13 11:38:59,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:38:59,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522685452] [2022-07-13 11:38:59,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:38:59,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:38:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:38:59,292 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:38:59,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:38:59,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522685452] [2022-07-13 11:38:59,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522685452] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:38:59,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:38:59,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:38:59,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929026297] [2022-07-13 11:38:59,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:38:59,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:38:59,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:38:59,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:38:59,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:38:59,294 INFO L87 Difference]: Start difference. First operand 209 states and 318 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:59,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:38:59,634 INFO L93 Difference]: Finished difference Result 400 states and 614 transitions. [2022-07-13 11:38:59,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:38:59,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-07-13 11:38:59,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:38:59,635 INFO L225 Difference]: With dead ends: 400 [2022-07-13 11:38:59,635 INFO L226 Difference]: Without dead ends: 212 [2022-07-13 11:38:59,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:38:59,636 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 11 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:38:59,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 493 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:38:59,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-07-13 11:38:59,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 209. [2022-07-13 11:38:59,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.5240384615384615) internal successors, (317), 208 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:59,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 317 transitions. [2022-07-13 11:38:59,640 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 317 transitions. Word has length 55 [2022-07-13 11:38:59,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:38:59,640 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 317 transitions. [2022-07-13 11:38:59,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:38:59,640 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 317 transitions. [2022-07-13 11:38:59,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-13 11:38:59,640 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:38:59,640 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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] [2022-07-13 11:38:59,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 11:38:59,641 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:38:59,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:38:59,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1312076378, now seen corresponding path program 1 times [2022-07-13 11:38:59,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:38:59,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977343247] [2022-07-13 11:38:59,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:38:59,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:38:59,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:38:59,727 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:38:59,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:38:59,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977343247] [2022-07-13 11:38:59,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977343247] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:38:59,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:38:59,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:38:59,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681611344] [2022-07-13 11:38:59,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:38:59,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:38:59,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:38:59,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:38:59,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:38:59,729 INFO L87 Difference]: Start difference. First operand 209 states and 317 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:00,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:00,496 INFO L93 Difference]: Finished difference Result 437 states and 668 transitions. [2022-07-13 11:39:00,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:39:00,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-07-13 11:39:00,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:00,499 INFO L225 Difference]: With dead ends: 437 [2022-07-13 11:39:00,499 INFO L226 Difference]: Without dead ends: 249 [2022-07-13 11:39:00,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:39:00,505 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 30 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:00,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 497 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 11:39:00,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-07-13 11:39:00,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 231. [2022-07-13 11:39:00,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.5260869565217392) internal successors, (351), 230 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:00,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 351 transitions. [2022-07-13 11:39:00,509 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 351 transitions. Word has length 55 [2022-07-13 11:39:00,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:00,510 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 351 transitions. [2022-07-13 11:39:00,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:00,510 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 351 transitions. [2022-07-13 11:39:00,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-13 11:39:00,511 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:00,511 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 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] [2022-07-13 11:39:00,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 11:39:00,511 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:00,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:00,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1411411051, now seen corresponding path program 1 times [2022-07-13 11:39:00,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:00,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931744969] [2022-07-13 11:39:00,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:00,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:00,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:00,589 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:39:00,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:00,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931744969] [2022-07-13 11:39:00,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931744969] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:00,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:00,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:39:00,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612140639] [2022-07-13 11:39:00,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:00,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:39:00,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:00,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:39:00,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:39:00,591 INFO L87 Difference]: Start difference. First operand 231 states and 351 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:01,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:01,352 INFO L93 Difference]: Finished difference Result 542 states and 833 transitions. [2022-07-13 11:39:01,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:39:01,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-07-13 11:39:01,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:01,354 INFO L225 Difference]: With dead ends: 542 [2022-07-13 11:39:01,354 INFO L226 Difference]: Without dead ends: 332 [2022-07-13 11:39:01,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:39:01,356 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 149 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:01,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 332 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 11:39:01,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2022-07-13 11:39:01,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 231. [2022-07-13 11:39:01,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.508695652173913) internal successors, (347), 230 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:01,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 347 transitions. [2022-07-13 11:39:01,360 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 347 transitions. Word has length 69 [2022-07-13 11:39:01,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:01,361 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 347 transitions. [2022-07-13 11:39:01,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:01,361 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 347 transitions. [2022-07-13 11:39:01,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-13 11:39:01,361 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:01,361 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 11:39:01,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 11:39:01,362 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:01,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:01,362 INFO L85 PathProgramCache]: Analyzing trace with hash -2063391372, now seen corresponding path program 1 times [2022-07-13 11:39:01,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:01,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291210026] [2022-07-13 11:39:01,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:01,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:01,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:01,458 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:39:01,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:01,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291210026] [2022-07-13 11:39:01,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291210026] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:01,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:01,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:39:01,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109609913] [2022-07-13 11:39:01,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:01,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:39:01,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:01,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:39:01,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:39:01,460 INFO L87 Difference]: Start difference. First operand 231 states and 347 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:02,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:02,699 INFO L93 Difference]: Finished difference Result 541 states and 824 transitions. [2022-07-13 11:39:02,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:39:02,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-07-13 11:39:02,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:02,701 INFO L225 Difference]: With dead ends: 541 [2022-07-13 11:39:02,701 INFO L226 Difference]: Without dead ends: 331 [2022-07-13 11:39:02,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:39:02,702 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 142 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:02,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 334 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-13 11:39:02,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-07-13 11:39:02,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 232. [2022-07-13 11:39:02,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.4978354978354977) internal successors, (346), 231 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:02,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 346 transitions. [2022-07-13 11:39:02,707 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 346 transitions. Word has length 69 [2022-07-13 11:39:02,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:02,707 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 346 transitions. [2022-07-13 11:39:02,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:02,707 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 346 transitions. [2022-07-13 11:39:02,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-13 11:39:02,708 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:02,708 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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] [2022-07-13 11:39:02,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 11:39:02,708 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:02,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:02,709 INFO L85 PathProgramCache]: Analyzing trace with hash 122165287, now seen corresponding path program 1 times [2022-07-13 11:39:02,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:02,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948853530] [2022-07-13 11:39:02,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:02,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:02,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:02,792 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:39:02,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:02,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948853530] [2022-07-13 11:39:02,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948853530] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:02,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:02,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:39:02,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331178540] [2022-07-13 11:39:02,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:02,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:39:02,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:02,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:39:02,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:39:02,794 INFO L87 Difference]: Start difference. First operand 232 states and 346 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:03,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:03,476 INFO L93 Difference]: Finished difference Result 542 states and 820 transitions. [2022-07-13 11:39:03,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:39:03,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-07-13 11:39:03,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:03,478 INFO L225 Difference]: With dead ends: 542 [2022-07-13 11:39:03,478 INFO L226 Difference]: Without dead ends: 331 [2022-07-13 11:39:03,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:39:03,478 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 146 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:03,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 334 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 11:39:03,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-07-13 11:39:03,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 232. [2022-07-13 11:39:03,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.4805194805194806) internal successors, (342), 231 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:03,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 342 transitions. [2022-07-13 11:39:03,483 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 342 transitions. Word has length 70 [2022-07-13 11:39:03,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:03,483 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 342 transitions. [2022-07-13 11:39:03,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:03,483 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 342 transitions. [2022-07-13 11:39:03,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-13 11:39:03,484 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:03,484 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2022-07-13 11:39:03,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 11:39:03,484 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:03,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:03,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1733152866, now seen corresponding path program 1 times [2022-07-13 11:39:03,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:03,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600583608] [2022-07-13 11:39:03,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:03,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:03,554 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:39:03,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:03,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600583608] [2022-07-13 11:39:03,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600583608] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:03,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:03,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:39:03,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273371151] [2022-07-13 11:39:03,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:03,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:39:03,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:03,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:39:03,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:39:03,556 INFO L87 Difference]: Start difference. First operand 232 states and 342 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:03,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:03,956 INFO L93 Difference]: Finished difference Result 450 states and 669 transitions. [2022-07-13 11:39:03,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:39:03,957 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-07-13 11:39:03,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:03,958 INFO L225 Difference]: With dead ends: 450 [2022-07-13 11:39:03,958 INFO L226 Difference]: Without dead ends: 239 [2022-07-13 11:39:03,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:39:03,958 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 26 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:03,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 513 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 11:39:03,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-07-13 11:39:03,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 232. [2022-07-13 11:39:03,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.4761904761904763) internal successors, (341), 231 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:03,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 341 transitions. [2022-07-13 11:39:03,962 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 341 transitions. Word has length 72 [2022-07-13 11:39:03,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:03,963 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 341 transitions. [2022-07-13 11:39:03,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:03,963 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 341 transitions. [2022-07-13 11:39:03,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-13 11:39:03,963 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:03,963 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 11:39:03,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 11:39:03,963 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:03,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:03,964 INFO L85 PathProgramCache]: Analyzing trace with hash 293504549, now seen corresponding path program 1 times [2022-07-13 11:39:03,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:03,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811311311] [2022-07-13 11:39:03,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:03,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:04,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:04,063 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 11:39:04,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:04,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811311311] [2022-07-13 11:39:04,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811311311] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:04,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:04,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:39:04,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248763348] [2022-07-13 11:39:04,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:04,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:39:04,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:04,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:39:04,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:39:04,064 INFO L87 Difference]: Start difference. First operand 232 states and 341 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:05,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:05,139 INFO L93 Difference]: Finished difference Result 538 states and 797 transitions. [2022-07-13 11:39:05,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:39:05,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-07-13 11:39:05,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:05,141 INFO L225 Difference]: With dead ends: 538 [2022-07-13 11:39:05,141 INFO L226 Difference]: Without dead ends: 327 [2022-07-13 11:39:05,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:39:05,142 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 88 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:05,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 471 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-13 11:39:05,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-07-13 11:39:05,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 263. [2022-07-13 11:39:05,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 262 states have (on average 1.4770992366412214) internal successors, (387), 262 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:05,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 387 transitions. [2022-07-13 11:39:05,148 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 387 transitions. Word has length 77 [2022-07-13 11:39:05,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:05,148 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 387 transitions. [2022-07-13 11:39:05,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:05,148 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 387 transitions. [2022-07-13 11:39:05,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-13 11:39:05,149 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:05,149 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 11:39:05,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 11:39:05,149 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:05,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:05,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1950478749, now seen corresponding path program 1 times [2022-07-13 11:39:05,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:05,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570085110] [2022-07-13 11:39:05,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:05,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:05,221 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 11:39:05,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:05,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570085110] [2022-07-13 11:39:05,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570085110] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:05,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:05,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:39:05,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791207105] [2022-07-13 11:39:05,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:05,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:39:05,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:05,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:39:05,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:39:05,224 INFO L87 Difference]: Start difference. First operand 263 states and 387 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:05,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:05,525 INFO L93 Difference]: Finished difference Result 551 states and 815 transitions. [2022-07-13 11:39:05,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:39:05,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-07-13 11:39:05,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:05,527 INFO L225 Difference]: With dead ends: 551 [2022-07-13 11:39:05,527 INFO L226 Difference]: Without dead ends: 309 [2022-07-13 11:39:05,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:39:05,528 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 35 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:05,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 589 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:39:05,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-07-13 11:39:05,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 287. [2022-07-13 11:39:05,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 286 states have (on average 1.4755244755244756) internal successors, (422), 286 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:05,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 422 transitions. [2022-07-13 11:39:05,532 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 422 transitions. Word has length 77 [2022-07-13 11:39:05,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:05,532 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 422 transitions. [2022-07-13 11:39:05,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:05,532 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 422 transitions. [2022-07-13 11:39:05,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-13 11:39:05,533 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:05,533 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 11:39:05,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 11:39:05,533 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:05,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:05,533 INFO L85 PathProgramCache]: Analyzing trace with hash 2009733770, now seen corresponding path program 1 times [2022-07-13 11:39:05,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:05,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73967334] [2022-07-13 11:39:05,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:05,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:05,621 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 11:39:05,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:05,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73967334] [2022-07-13 11:39:05,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73967334] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:05,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:05,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:39:05,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785448935] [2022-07-13 11:39:05,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:05,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:39:05,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:05,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:39:05,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:39:05,623 INFO L87 Difference]: Start difference. First operand 287 states and 422 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:07,082 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:39:07,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:07,322 INFO L93 Difference]: Finished difference Result 617 states and 912 transitions. [2022-07-13 11:39:07,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:39:07,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2022-07-13 11:39:07,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:07,323 INFO L225 Difference]: With dead ends: 617 [2022-07-13 11:39:07,323 INFO L226 Difference]: Without dead ends: 351 [2022-07-13 11:39:07,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:39:07,324 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 77 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:07,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 469 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-13 11:39:07,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-07-13 11:39:07,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 297. [2022-07-13 11:39:07,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 1.489864864864865) internal successors, (441), 296 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:07,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 441 transitions. [2022-07-13 11:39:07,328 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 441 transitions. Word has length 82 [2022-07-13 11:39:07,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:07,329 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 441 transitions. [2022-07-13 11:39:07,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:07,329 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 441 transitions. [2022-07-13 11:39:07,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-13 11:39:07,329 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:07,329 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 11:39:07,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-13 11:39:07,330 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:07,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:07,330 INFO L85 PathProgramCache]: Analyzing trace with hash -2129799745, now seen corresponding path program 1 times [2022-07-13 11:39:07,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:07,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795550118] [2022-07-13 11:39:07,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:07,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:07,417 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 11:39:07,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:07,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795550118] [2022-07-13 11:39:07,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795550118] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:07,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:07,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:39:07,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459559347] [2022-07-13 11:39:07,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:07,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:39:07,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:07,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:39:07,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:39:07,418 INFO L87 Difference]: Start difference. First operand 297 states and 441 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:08,861 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:39:09,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:09,102 INFO L93 Difference]: Finished difference Result 621 states and 923 transitions. [2022-07-13 11:39:09,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:39:09,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2022-07-13 11:39:09,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:09,104 INFO L225 Difference]: With dead ends: 621 [2022-07-13 11:39:09,104 INFO L226 Difference]: Without dead ends: 345 [2022-07-13 11:39:09,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:39:09,105 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 70 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:09,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 475 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-13 11:39:09,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-07-13 11:39:09,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 298. [2022-07-13 11:39:09,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 1.4882154882154883) internal successors, (442), 297 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:09,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 442 transitions. [2022-07-13 11:39:09,111 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 442 transitions. Word has length 83 [2022-07-13 11:39:09,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:09,111 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 442 transitions. [2022-07-13 11:39:09,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:09,111 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 442 transitions. [2022-07-13 11:39:09,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-13 11:39:09,112 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:09,112 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2022-07-13 11:39:09,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 11:39:09,113 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:09,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:09,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1674400777, now seen corresponding path program 1 times [2022-07-13 11:39:09,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:09,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104198816] [2022-07-13 11:39:09,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:09,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:09,204 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 11:39:09,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:09,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104198816] [2022-07-13 11:39:09,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104198816] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:09,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:09,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:39:09,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883133361] [2022-07-13 11:39:09,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:09,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:39:09,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:09,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:39:09,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:39:09,206 INFO L87 Difference]: Start difference. First operand 298 states and 442 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:10,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:10,834 INFO L93 Difference]: Finished difference Result 585 states and 872 transitions. [2022-07-13 11:39:10,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:39:10,834 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2022-07-13 11:39:10,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:10,835 INFO L225 Difference]: With dead ends: 585 [2022-07-13 11:39:10,835 INFO L226 Difference]: Without dead ends: 308 [2022-07-13 11:39:10,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-13 11:39:10,836 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 149 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:10,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 354 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-13 11:39:10,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-07-13 11:39:10,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 307. [2022-07-13 11:39:10,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 1.4803921568627452) internal successors, (453), 306 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:10,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 453 transitions. [2022-07-13 11:39:10,841 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 453 transitions. Word has length 94 [2022-07-13 11:39:10,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:10,841 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 453 transitions. [2022-07-13 11:39:10,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:10,841 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 453 transitions. [2022-07-13 11:39:10,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-13 11:39:10,841 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:10,842 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2022-07-13 11:39:10,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-13 11:39:10,842 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:10,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:10,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1278038072, now seen corresponding path program 1 times [2022-07-13 11:39:10,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:10,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273453400] [2022-07-13 11:39:10,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:10,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:10,952 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 11:39:10,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:10,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273453400] [2022-07-13 11:39:10,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273453400] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:10,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:10,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:39:10,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698246061] [2022-07-13 11:39:10,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:10,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:39:10,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:10,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:39:10,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:39:10,955 INFO L87 Difference]: Start difference. First operand 307 states and 453 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:11,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:11,434 INFO L93 Difference]: Finished difference Result 682 states and 1021 transitions. [2022-07-13 11:39:11,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:39:11,434 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2022-07-13 11:39:11,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:11,435 INFO L225 Difference]: With dead ends: 682 [2022-07-13 11:39:11,435 INFO L226 Difference]: Without dead ends: 396 [2022-07-13 11:39:11,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:39:11,436 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 136 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:11,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 354 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 11:39:11,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-07-13 11:39:11,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 307. [2022-07-13 11:39:11,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 1.4640522875816993) internal successors, (448), 306 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:11,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 448 transitions. [2022-07-13 11:39:11,442 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 448 transitions. Word has length 95 [2022-07-13 11:39:11,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:11,442 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 448 transitions. [2022-07-13 11:39:11,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:11,443 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 448 transitions. [2022-07-13 11:39:11,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-13 11:39:11,443 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:11,443 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 11:39:11,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-13 11:39:11,444 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:11,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:11,444 INFO L85 PathProgramCache]: Analyzing trace with hash 868200130, now seen corresponding path program 1 times [2022-07-13 11:39:11,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:11,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059835945] [2022-07-13 11:39:11,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:11,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:11,514 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 11:39:11,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:11,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059835945] [2022-07-13 11:39:11,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059835945] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:11,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:11,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:39:11,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192517057] [2022-07-13 11:39:11,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:11,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:39:11,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:11,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:39:11,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:39:11,516 INFO L87 Difference]: Start difference. First operand 307 states and 448 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:12,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:12,086 INFO L93 Difference]: Finished difference Result 630 states and 922 transitions. [2022-07-13 11:39:12,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:39:12,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-07-13 11:39:12,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:12,087 INFO L225 Difference]: With dead ends: 630 [2022-07-13 11:39:12,087 INFO L226 Difference]: Without dead ends: 344 [2022-07-13 11:39:12,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:39:12,088 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 77 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:12,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 503 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 11:39:12,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2022-07-13 11:39:12,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 307. [2022-07-13 11:39:12,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 1.4607843137254901) internal successors, (447), 306 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:12,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 447 transitions. [2022-07-13 11:39:12,093 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 447 transitions. Word has length 99 [2022-07-13 11:39:12,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:12,093 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 447 transitions. [2022-07-13 11:39:12,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:12,094 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 447 transitions. [2022-07-13 11:39:12,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-13 11:39:12,094 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:12,094 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 11:39:12,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-13 11:39:12,095 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:12,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:12,095 INFO L85 PathProgramCache]: Analyzing trace with hash 908874880, now seen corresponding path program 1 times [2022-07-13 11:39:12,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:12,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100895298] [2022-07-13 11:39:12,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:12,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:12,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:12,180 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-13 11:39:12,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:12,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100895298] [2022-07-13 11:39:12,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100895298] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:12,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:12,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:39:12,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959327854] [2022-07-13 11:39:12,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:12,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:39:12,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:12,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:39:12,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:39:12,183 INFO L87 Difference]: Start difference. First operand 307 states and 447 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:12,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:12,213 INFO L93 Difference]: Finished difference Result 874 states and 1287 transitions. [2022-07-13 11:39:12,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:39:12,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-07-13 11:39:12,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:12,215 INFO L225 Difference]: With dead ends: 874 [2022-07-13 11:39:12,215 INFO L226 Difference]: Without dead ends: 588 [2022-07-13 11:39:12,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:39:12,217 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 143 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:12,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 428 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:39:12,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2022-07-13 11:39:12,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2022-07-13 11:39:12,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 587 states have (on average 1.4565587734241907) internal successors, (855), 587 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:12,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 855 transitions. [2022-07-13 11:39:12,228 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 855 transitions. Word has length 99 [2022-07-13 11:39:12,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:12,228 INFO L495 AbstractCegarLoop]: Abstraction has 588 states and 855 transitions. [2022-07-13 11:39:12,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:12,228 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 855 transitions. [2022-07-13 11:39:12,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-13 11:39:12,229 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:12,229 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 11:39:12,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-13 11:39:12,230 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:12,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:12,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1342603966, now seen corresponding path program 1 times [2022-07-13 11:39:12,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:12,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507097576] [2022-07-13 11:39:12,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:12,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:12,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:12,320 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-13 11:39:12,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:12,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507097576] [2022-07-13 11:39:12,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507097576] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:12,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:12,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:39:12,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646966841] [2022-07-13 11:39:12,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:12,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:39:12,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:12,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:39:12,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:39:12,322 INFO L87 Difference]: Start difference. First operand 588 states and 855 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:12,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:12,343 INFO L93 Difference]: Finished difference Result 1182 states and 1722 transitions. [2022-07-13 11:39:12,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:39:12,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-07-13 11:39:12,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:12,345 INFO L225 Difference]: With dead ends: 1182 [2022-07-13 11:39:12,345 INFO L226 Difference]: Without dead ends: 615 [2022-07-13 11:39:12,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:39:12,347 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 15 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:12,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 410 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:39:12,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2022-07-13 11:39:12,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2022-07-13 11:39:12,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 614 states have (on average 1.4495114006514658) internal successors, (890), 614 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:12,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 890 transitions. [2022-07-13 11:39:12,357 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 890 transitions. Word has length 99 [2022-07-13 11:39:12,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:12,357 INFO L495 AbstractCegarLoop]: Abstraction has 615 states and 890 transitions. [2022-07-13 11:39:12,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:12,357 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 890 transitions. [2022-07-13 11:39:12,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-13 11:39:12,358 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:12,358 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 11:39:12,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-13 11:39:12,359 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:12,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:12,359 INFO L85 PathProgramCache]: Analyzing trace with hash -2113329668, now seen corresponding path program 1 times [2022-07-13 11:39:12,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:12,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451565144] [2022-07-13 11:39:12,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:12,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:12,417 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-13 11:39:12,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:12,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451565144] [2022-07-13 11:39:12,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451565144] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:12,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:12,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:39:12,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34689985] [2022-07-13 11:39:12,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:12,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:39:12,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:12,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:39:12,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:39:12,419 INFO L87 Difference]: Start difference. First operand 615 states and 890 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:12,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:12,437 INFO L93 Difference]: Finished difference Result 1211 states and 1758 transitions. [2022-07-13 11:39:12,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:39:12,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-07-13 11:39:12,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:12,440 INFO L225 Difference]: With dead ends: 1211 [2022-07-13 11:39:12,440 INFO L226 Difference]: Without dead ends: 617 [2022-07-13 11:39:12,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:39:12,444 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 4 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:12,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 389 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:39:12,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2022-07-13 11:39:12,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2022-07-13 11:39:12,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 616 states have (on average 1.448051948051948) internal successors, (892), 616 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:12,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 892 transitions. [2022-07-13 11:39:12,461 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 892 transitions. Word has length 99 [2022-07-13 11:39:12,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:12,461 INFO L495 AbstractCegarLoop]: Abstraction has 617 states and 892 transitions. [2022-07-13 11:39:12,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:12,462 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 892 transitions. [2022-07-13 11:39:12,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-13 11:39:12,463 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:12,463 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 11:39:12,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-13 11:39:12,463 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:12,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:12,464 INFO L85 PathProgramCache]: Analyzing trace with hash -254845290, now seen corresponding path program 1 times [2022-07-13 11:39:12,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:12,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012767782] [2022-07-13 11:39:12,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:12,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:12,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:12,569 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-13 11:39:12,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:12,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012767782] [2022-07-13 11:39:12,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012767782] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:12,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:12,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:39:12,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833095738] [2022-07-13 11:39:12,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:12,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:39:12,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:12,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:39:12,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:39:12,571 INFO L87 Difference]: Start difference. First operand 617 states and 892 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:12,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:12,604 INFO L93 Difference]: Finished difference Result 1497 states and 2179 transitions. [2022-07-13 11:39:12,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:39:12,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2022-07-13 11:39:12,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:12,606 INFO L225 Difference]: With dead ends: 1497 [2022-07-13 11:39:12,606 INFO L226 Difference]: Without dead ends: 903 [2022-07-13 11:39:12,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:39:12,607 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 164 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:12,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 372 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:39:12,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2022-07-13 11:39:12,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 901. [2022-07-13 11:39:12,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 900 states have (on average 1.4566666666666668) internal successors, (1311), 900 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:12,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1311 transitions. [2022-07-13 11:39:12,627 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1311 transitions. Word has length 101 [2022-07-13 11:39:12,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:12,628 INFO L495 AbstractCegarLoop]: Abstraction has 901 states and 1311 transitions. [2022-07-13 11:39:12,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:12,628 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1311 transitions. [2022-07-13 11:39:12,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-13 11:39:12,629 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:12,629 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 11:39:12,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-13 11:39:12,630 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:12,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:12,630 INFO L85 PathProgramCache]: Analyzing trace with hash 34857145, now seen corresponding path program 1 times [2022-07-13 11:39:12,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:12,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385748042] [2022-07-13 11:39:12,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:12,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:12,706 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-13 11:39:12,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:12,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385748042] [2022-07-13 11:39:12,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385748042] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:12,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:12,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:39:12,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745937496] [2022-07-13 11:39:12,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:12,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:39:12,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:12,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:39:12,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:39:12,709 INFO L87 Difference]: Start difference. First operand 901 states and 1311 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:12,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:12,775 INFO L93 Difference]: Finished difference Result 2065 states and 3015 transitions. [2022-07-13 11:39:12,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:39:12,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-07-13 11:39:12,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:12,778 INFO L225 Difference]: With dead ends: 2065 [2022-07-13 11:39:12,779 INFO L226 Difference]: Without dead ends: 1187 [2022-07-13 11:39:12,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:39:12,781 INFO L413 NwaCegarLoop]: 380 mSDtfsCounter, 150 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:12,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 569 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:39:12,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2022-07-13 11:39:12,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1185. [2022-07-13 11:39:12,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1185 states, 1184 states have (on average 1.4493243243243243) internal successors, (1716), 1184 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:12,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1716 transitions. [2022-07-13 11:39:12,800 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1716 transitions. Word has length 106 [2022-07-13 11:39:12,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:12,801 INFO L495 AbstractCegarLoop]: Abstraction has 1185 states and 1716 transitions. [2022-07-13 11:39:12,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:12,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1716 transitions. [2022-07-13 11:39:12,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-13 11:39:12,802 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:12,803 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-13 11:39:12,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-13 11:39:12,803 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:12,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:12,803 INFO L85 PathProgramCache]: Analyzing trace with hash -285519407, now seen corresponding path program 1 times [2022-07-13 11:39:12,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:12,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731484614] [2022-07-13 11:39:12,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:12,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:12,872 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-13 11:39:12,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:12,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731484614] [2022-07-13 11:39:12,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731484614] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:12,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:12,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:39:12,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325832975] [2022-07-13 11:39:12,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:12,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:39:12,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:12,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:39:12,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:39:12,874 INFO L87 Difference]: Start difference. First operand 1185 states and 1716 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:12,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:12,910 INFO L93 Difference]: Finished difference Result 2626 states and 3817 transitions. [2022-07-13 11:39:12,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:39:12,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2022-07-13 11:39:12,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:12,914 INFO L225 Difference]: With dead ends: 2626 [2022-07-13 11:39:12,914 INFO L226 Difference]: Without dead ends: 1464 [2022-07-13 11:39:12,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:39:12,916 INFO L413 NwaCegarLoop]: 378 mSDtfsCounter, 141 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:12,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 567 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:39:12,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2022-07-13 11:39:12,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1464. [2022-07-13 11:39:12,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1464 states, 1463 states have (on average 1.4497607655502391) internal successors, (2121), 1463 states have internal predecessors, (2121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:12,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 2121 transitions. [2022-07-13 11:39:12,948 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 2121 transitions. Word has length 123 [2022-07-13 11:39:12,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:12,948 INFO L495 AbstractCegarLoop]: Abstraction has 1464 states and 2121 transitions. [2022-07-13 11:39:12,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:12,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 2121 transitions. [2022-07-13 11:39:12,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-13 11:39:12,950 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:12,950 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2022-07-13 11:39:12,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-13 11:39:12,950 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:12,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:12,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1271906027, now seen corresponding path program 1 times [2022-07-13 11:39:12,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:12,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612162472] [2022-07-13 11:39:12,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:12,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:13,039 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-13 11:39:13,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:13,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612162472] [2022-07-13 11:39:13,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612162472] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:13,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:13,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:39:13,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920219307] [2022-07-13 11:39:13,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:13,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:39:13,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:13,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:39:13,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:39:13,041 INFO L87 Difference]: Start difference. First operand 1464 states and 2121 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:13,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:13,086 INFO L93 Difference]: Finished difference Result 1752 states and 2537 transitions. [2022-07-13 11:39:13,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:39:13,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2022-07-13 11:39:13,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:13,091 INFO L225 Difference]: With dead ends: 1752 [2022-07-13 11:39:13,091 INFO L226 Difference]: Without dead ends: 1750 [2022-07-13 11:39:13,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:39:13,092 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 165 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:13,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 371 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:39:13,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states. [2022-07-13 11:39:13,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1748. [2022-07-13 11:39:13,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1748 states, 1747 states have (on average 1.450486548368632) internal successors, (2534), 1747 states have internal predecessors, (2534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:13,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2534 transitions. [2022-07-13 11:39:13,132 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2534 transitions. Word has length 129 [2022-07-13 11:39:13,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:13,133 INFO L495 AbstractCegarLoop]: Abstraction has 1748 states and 2534 transitions. [2022-07-13 11:39:13,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:13,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2534 transitions. [2022-07-13 11:39:13,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-13 11:39:13,135 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:13,135 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 11:39:13,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-13 11:39:13,135 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:13,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:13,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1650407178, now seen corresponding path program 1 times [2022-07-13 11:39:13,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:13,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000959862] [2022-07-13 11:39:13,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:13,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:13,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:13,244 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-07-13 11:39:13,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:13,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000959862] [2022-07-13 11:39:13,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000959862] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:13,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:13,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:39:13,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401546463] [2022-07-13 11:39:13,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:13,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:39:13,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:13,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:39:13,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:39:13,246 INFO L87 Difference]: Start difference. First operand 1748 states and 2534 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:13,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:13,310 INFO L93 Difference]: Finished difference Result 3756 states and 5459 transitions. [2022-07-13 11:39:13,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:39:13,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 166 [2022-07-13 11:39:13,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:13,316 INFO L225 Difference]: With dead ends: 3756 [2022-07-13 11:39:13,316 INFO L226 Difference]: Without dead ends: 2031 [2022-07-13 11:39:13,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:39:13,319 INFO L413 NwaCegarLoop]: 384 mSDtfsCounter, 145 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:13,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 573 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:39:13,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2031 states. [2022-07-13 11:39:13,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2031 to 2031. [2022-07-13 11:39:13,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2031 states, 2030 states have (on average 1.4502463054187191) internal successors, (2944), 2030 states have internal predecessors, (2944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:13,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2031 states to 2031 states and 2944 transitions. [2022-07-13 11:39:13,363 INFO L78 Accepts]: Start accepts. Automaton has 2031 states and 2944 transitions. Word has length 166 [2022-07-13 11:39:13,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:13,363 INFO L495 AbstractCegarLoop]: Abstraction has 2031 states and 2944 transitions. [2022-07-13 11:39:13,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:13,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2031 states and 2944 transitions. [2022-07-13 11:39:13,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-13 11:39:13,366 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:13,366 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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] [2022-07-13 11:39:13,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-13 11:39:13,367 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:13,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:13,367 INFO L85 PathProgramCache]: Analyzing trace with hash -2051323133, now seen corresponding path program 1 times [2022-07-13 11:39:13,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:13,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218172465] [2022-07-13 11:39:13,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:13,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:13,466 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-13 11:39:13,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:13,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218172465] [2022-07-13 11:39:13,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218172465] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:13,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:13,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:39:13,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743526718] [2022-07-13 11:39:13,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:13,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:39:13,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:13,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:39:13,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:39:13,468 INFO L87 Difference]: Start difference. First operand 2031 states and 2944 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:14,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:14,340 INFO L93 Difference]: Finished difference Result 4814 states and 7033 transitions. [2022-07-13 11:39:14,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:39:14,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 175 [2022-07-13 11:39:14,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:14,347 INFO L225 Difference]: With dead ends: 4814 [2022-07-13 11:39:14,347 INFO L226 Difference]: Without dead ends: 2806 [2022-07-13 11:39:14,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:39:14,350 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 106 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:14,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 357 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 11:39:14,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2806 states. [2022-07-13 11:39:14,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2806 to 2374. [2022-07-13 11:39:14,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2374 states, 2373 states have (on average 1.4913611462284029) internal successors, (3539), 2373 states have internal predecessors, (3539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:14,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2374 states to 2374 states and 3539 transitions. [2022-07-13 11:39:14,406 INFO L78 Accepts]: Start accepts. Automaton has 2374 states and 3539 transitions. Word has length 175 [2022-07-13 11:39:14,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:14,406 INFO L495 AbstractCegarLoop]: Abstraction has 2374 states and 3539 transitions. [2022-07-13 11:39:14,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:14,406 INFO L276 IsEmpty]: Start isEmpty. Operand 2374 states and 3539 transitions. [2022-07-13 11:39:14,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-07-13 11:39:14,409 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:14,410 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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] [2022-07-13 11:39:14,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-13 11:39:14,410 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:14,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:14,411 INFO L85 PathProgramCache]: Analyzing trace with hash 84722404, now seen corresponding path program 1 times [2022-07-13 11:39:14,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:14,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227089486] [2022-07-13 11:39:14,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:14,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:14,526 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-13 11:39:14,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:14,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227089486] [2022-07-13 11:39:14,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227089486] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:14,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:14,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:39:14,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343326077] [2022-07-13 11:39:14,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:14,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:39:14,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:14,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:39:14,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:39:14,528 INFO L87 Difference]: Start difference. First operand 2374 states and 3539 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:14,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:14,995 INFO L93 Difference]: Finished difference Result 5242 states and 7796 transitions. [2022-07-13 11:39:14,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:39:14,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 176 [2022-07-13 11:39:14,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:15,003 INFO L225 Difference]: With dead ends: 5242 [2022-07-13 11:39:15,004 INFO L226 Difference]: Without dead ends: 2877 [2022-07-13 11:39:15,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:39:15,008 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 107 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:15,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 370 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 11:39:15,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2877 states. [2022-07-13 11:39:15,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2877 to 2457. [2022-07-13 11:39:15,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2457 states, 2456 states have (on average 1.5061074918566775) internal successors, (3699), 2456 states have internal predecessors, (3699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:15,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3699 transitions. [2022-07-13 11:39:15,051 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3699 transitions. Word has length 176 [2022-07-13 11:39:15,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:15,052 INFO L495 AbstractCegarLoop]: Abstraction has 2457 states and 3699 transitions. [2022-07-13 11:39:15,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:15,052 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3699 transitions. [2022-07-13 11:39:15,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-07-13 11:39:15,063 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:15,063 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 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] [2022-07-13 11:39:15,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-13 11:39:15,064 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:15,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:15,064 INFO L85 PathProgramCache]: Analyzing trace with hash 875181898, now seen corresponding path program 1 times [2022-07-13 11:39:15,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:15,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215017943] [2022-07-13 11:39:15,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:15,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:15,164 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-07-13 11:39:15,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:15,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215017943] [2022-07-13 11:39:15,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215017943] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:39:15,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:39:15,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:39:15,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625497600] [2022-07-13 11:39:15,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:15,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:39:15,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:15,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:39:15,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:39:15,166 INFO L87 Difference]: Start difference. First operand 2457 states and 3699 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:16,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:16,126 INFO L93 Difference]: Finished difference Result 5045 states and 7584 transitions. [2022-07-13 11:39:16,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:39:16,127 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 204 [2022-07-13 11:39:16,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:16,133 INFO L225 Difference]: With dead ends: 5045 [2022-07-13 11:39:16,134 INFO L226 Difference]: Without dead ends: 2611 [2022-07-13 11:39:16,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:39:16,136 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 41 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:16,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 590 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-13 11:39:16,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2611 states. [2022-07-13 11:39:16,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2611 to 2457. [2022-07-13 11:39:16,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2457 states, 2456 states have (on average 1.503257328990228) internal successors, (3692), 2456 states have internal predecessors, (3692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:16,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3692 transitions. [2022-07-13 11:39:16,213 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3692 transitions. Word has length 204 [2022-07-13 11:39:16,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:16,213 INFO L495 AbstractCegarLoop]: Abstraction has 2457 states and 3692 transitions. [2022-07-13 11:39:16,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:16,213 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3692 transitions. [2022-07-13 11:39:16,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-07-13 11:39:16,217 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:16,217 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 5, 5, 4, 4, 3, 3, 3, 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] [2022-07-13 11:39:16,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-13 11:39:16,217 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:16,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:16,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1278157357, now seen corresponding path program 1 times [2022-07-13 11:39:16,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:16,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454918645] [2022-07-13 11:39:16,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:16,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:16,381 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 316 proven. 51 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-07-13 11:39:16,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:16,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454918645] [2022-07-13 11:39:16,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454918645] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:39:16,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727904369] [2022-07-13 11:39:16,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:16,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:39:16,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:39:16,383 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-13 11:39:16,386 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-13 11:39:17,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:17,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 1307 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-13 11:39:17,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:39:17,232 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-13 11:39:17,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-13 11:39:17,262 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 11:39:17,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-07-13 11:39:17,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 11:39:17,300 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-13 11:39:17,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-13 11:39:17,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-13 11:39:17,354 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 302 proven. 64 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-07-13 11:39:17,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:39:17,410 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 307 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2022-07-13 11:39:17,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727904369] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 11:39:17,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:39:17,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 11 [2022-07-13 11:39:17,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007601316] [2022-07-13 11:39:17,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:17,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:39:17,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:17,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:39:17,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:39:17,412 INFO L87 Difference]: Start difference. First operand 2457 states and 3692 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:19,028 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:39:19,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:19,374 INFO L93 Difference]: Finished difference Result 5584 states and 8370 transitions. [2022-07-13 11:39:19,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:39:19,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 226 [2022-07-13 11:39:19,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:19,381 INFO L225 Difference]: With dead ends: 5584 [2022-07-13 11:39:19,381 INFO L226 Difference]: Without dead ends: 3150 [2022-07-13 11:39:19,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 448 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-13 11:39:19,383 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 115 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:19,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 384 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-13 11:39:19,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3150 states. [2022-07-13 11:39:19,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3150 to 2681. [2022-07-13 11:39:19,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2681 states, 2680 states have (on average 1.5007462686567163) internal successors, (4022), 2680 states have internal predecessors, (4022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:19,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2681 states to 2681 states and 4022 transitions. [2022-07-13 11:39:19,424 INFO L78 Accepts]: Start accepts. Automaton has 2681 states and 4022 transitions. Word has length 226 [2022-07-13 11:39:19,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:19,424 INFO L495 AbstractCegarLoop]: Abstraction has 2681 states and 4022 transitions. [2022-07-13 11:39:19,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:19,425 INFO L276 IsEmpty]: Start isEmpty. Operand 2681 states and 4022 transitions. [2022-07-13 11:39:19,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2022-07-13 11:39:19,427 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:19,428 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 2, 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] [2022-07-13 11:39:19,448 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-13 11:39:19,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-07-13 11:39:19,643 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:19,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:19,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1639861597, now seen corresponding path program 1 times [2022-07-13 11:39:19,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:19,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536029041] [2022-07-13 11:39:19,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:19,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:19,851 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 145 proven. 5 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2022-07-13 11:39:19,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:19,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536029041] [2022-07-13 11:39:19,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536029041] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:39:19,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40349092] [2022-07-13 11:39:19,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:19,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:39:19,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:39:19,868 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-13 11:39:19,899 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-13 11:39:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:20,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 1381 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-13 11:39:20,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:39:20,694 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-13 11:39:20,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-13 11:39:20,724 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 11:39:20,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-07-13 11:39:20,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-13 11:39:20,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 11:39:20,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-07-13 11:39:20,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-07-13 11:39:20,774 INFO L356 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-07-13 11:39:20,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 32 [2022-07-13 11:39:20,844 INFO L356 Elim1Store]: treesize reduction 66, result has 30.5 percent of original size [2022-07-13 11:39:20,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 42 treesize of output 54 [2022-07-13 11:39:20,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2022-07-13 11:39:20,948 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 140 proven. 101 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-07-13 11:39:20,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:39:20,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2022-07-13 11:39:20,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2022-07-13 11:39:21,859 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_14 Int) (v_arrayElimCell_15 Int)) (not (= 8545 (select (select (store |c_#memory_int| v_arrayElimCell_14 (store (select |c_#memory_int| v_arrayElimCell_14) (+ 844 v_arrayElimCell_15) 8640)) |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52))))) is different from false [2022-07-13 11:39:21,877 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2022-07-13 11:39:21,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40349092] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 11:39:21,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:39:21,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 10] total 13 [2022-07-13 11:39:21,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134650899] [2022-07-13 11:39:21,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:21,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:39:21,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:21,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:39:21,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=102, Unknown=1, NotChecked=20, Total=156 [2022-07-13 11:39:21,878 INFO L87 Difference]: Start difference. First operand 2681 states and 4022 transitions. Second operand has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:24,062 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimCell_14 Int) (v_arrayElimCell_15 Int)) (not (= 8545 (select (select (store |c_#memory_int| v_arrayElimCell_14 (store (select |c_#memory_int| v_arrayElimCell_14) (+ 844 v_arrayElimCell_15) 8640)) |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52))))) (not (= 8545 (select (select |c_#memory_int| |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52))))) is different from false [2022-07-13 11:39:24,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:24,147 INFO L93 Difference]: Finished difference Result 6017 states and 8995 transitions. [2022-07-13 11:39:24,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 11:39:24,148 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 235 [2022-07-13 11:39:24,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:24,153 INFO L225 Difference]: With dead ends: 6017 [2022-07-13 11:39:24,153 INFO L226 Difference]: Without dead ends: 3359 [2022-07-13 11:39:24,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 467 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=40, Invalid=122, Unknown=2, NotChecked=46, Total=210 [2022-07-13 11:39:24,155 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 119 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 268 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:24,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 472 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 239 Invalid, 0 Unknown, 268 Unchecked, 1.2s Time] [2022-07-13 11:39:24,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3359 states. [2022-07-13 11:39:24,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3359 to 2861. [2022-07-13 11:39:24,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2861 states, 2860 states have (on average 1.4937062937062937) internal successors, (4272), 2860 states have internal predecessors, (4272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:24,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2861 states to 2861 states and 4272 transitions. [2022-07-13 11:39:24,201 INFO L78 Accepts]: Start accepts. Automaton has 2861 states and 4272 transitions. Word has length 235 [2022-07-13 11:39:24,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:24,201 INFO L495 AbstractCegarLoop]: Abstraction has 2861 states and 4272 transitions. [2022-07-13 11:39:24,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:24,202 INFO L276 IsEmpty]: Start isEmpty. Operand 2861 states and 4272 transitions. [2022-07-13 11:39:24,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2022-07-13 11:39:24,205 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:24,205 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 2, 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] [2022-07-13 11:39:24,240 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-13 11:39:24,419 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,SelfDestructingSolverStorable34 [2022-07-13 11:39:24,419 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:24,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:24,420 INFO L85 PathProgramCache]: Analyzing trace with hash 411122401, now seen corresponding path program 1 times [2022-07-13 11:39:24,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:24,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139144442] [2022-07-13 11:39:24,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:24,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:24,670 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 145 proven. 5 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2022-07-13 11:39:24,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:24,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139144442] [2022-07-13 11:39:24,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139144442] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:39:24,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241686980] [2022-07-13 11:39:24,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:24,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:39:24,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:39:24,672 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-13 11:39:24,673 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-13 11:39:25,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:25,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 1382 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-13 11:39:25,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:39:25,388 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-13 11:39:25,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-13 11:39:25,414 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 11:39:25,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-07-13 11:39:25,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-13 11:39:25,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 11:39:25,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-07-13 11:39:25,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-07-13 11:39:25,454 INFO L356 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-07-13 11:39:25,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 32 [2022-07-13 11:39:25,501 INFO L356 Elim1Store]: treesize reduction 66, result has 30.5 percent of original size [2022-07-13 11:39:25,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 42 treesize of output 54 [2022-07-13 11:39:25,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2022-07-13 11:39:25,597 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 140 proven. 101 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-07-13 11:39:25,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:39:25,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2022-07-13 11:39:25,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2022-07-13 11:39:27,645 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_25 Int) (v_arrayElimCell_26 Int)) (not (= (select (select (store |c_#memory_int| v_arrayElimCell_25 (store (select |c_#memory_int| v_arrayElimCell_25) (+ 844 v_arrayElimCell_26) 3)) |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52)) 8545))) is different from false [2022-07-13 11:39:27,652 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2022-07-13 11:39:27,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241686980] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 11:39:27,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:39:27,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 10] total 13 [2022-07-13 11:39:27,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726080230] [2022-07-13 11:39:27,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:39:27,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:39:27,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:27,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:39:27,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=102, Unknown=1, NotChecked=20, Total=156 [2022-07-13 11:39:27,654 INFO L87 Difference]: Start difference. First operand 2861 states and 4272 transitions. Second operand has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:30,854 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimCell_25 Int) (v_arrayElimCell_26 Int)) (not (= (select (select (store |c_#memory_int| v_arrayElimCell_25 (store (select |c_#memory_int| v_arrayElimCell_25) (+ 844 v_arrayElimCell_26) 3)) |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52)) 8545))) (not (= 8545 (select (select |c_#memory_int| |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52))))) is different from false [2022-07-13 11:39:30,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:30,935 INFO L93 Difference]: Finished difference Result 6371 states and 9483 transitions. [2022-07-13 11:39:30,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 11:39:30,935 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 235 [2022-07-13 11:39:30,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:30,940 INFO L225 Difference]: With dead ends: 6371 [2022-07-13 11:39:30,940 INFO L226 Difference]: Without dead ends: 3533 [2022-07-13 11:39:30,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 467 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=40, Invalid=122, Unknown=2, NotChecked=46, Total=210 [2022-07-13 11:39:30,943 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 119 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 194 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:30,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 398 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 239 Invalid, 0 Unknown, 194 Unchecked, 1.2s Time] [2022-07-13 11:39:30,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3533 states. [2022-07-13 11:39:30,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3533 to 2681. [2022-07-13 11:39:31,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2681 states, 2680 states have (on average 1.4932835820895523) internal successors, (4002), 2680 states have internal predecessors, (4002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:31,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2681 states to 2681 states and 4002 transitions. [2022-07-13 11:39:31,004 INFO L78 Accepts]: Start accepts. Automaton has 2681 states and 4002 transitions. Word has length 235 [2022-07-13 11:39:31,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:31,005 INFO L495 AbstractCegarLoop]: Abstraction has 2681 states and 4002 transitions. [2022-07-13 11:39:31,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:31,005 INFO L276 IsEmpty]: Start isEmpty. Operand 2681 states and 4002 transitions. [2022-07-13 11:39:31,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2022-07-13 11:39:31,008 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:31,008 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2022-07-13 11:39:31,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-13 11:39:31,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:39:31,224 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:31,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:31,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1613009689, now seen corresponding path program 1 times [2022-07-13 11:39:31,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:31,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391770274] [2022-07-13 11:39:31,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:31,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:31,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:31,683 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 286 proven. 17 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2022-07-13 11:39:31,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:31,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391770274] [2022-07-13 11:39:31,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391770274] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:39:31,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820212620] [2022-07-13 11:39:31,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:31,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:39:31,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:39:31,688 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-13 11:39:31,723 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-13 11:39:32,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:32,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 1313 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-13 11:39:32,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:39:32,461 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-13 11:39:32,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-13 11:39:32,495 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 11:39:32,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-07-13 11:39:32,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:39:32,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2022-07-13 11:39:32,566 INFO L356 Elim1Store]: treesize reduction 50, result has 58.3 percent of original size [2022-07-13 11:39:32,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 85 [2022-07-13 11:39:32,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:39:32,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 70 [2022-07-13 11:39:33,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:39:33,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 57 [2022-07-13 11:39:33,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:39:33,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 57 [2022-07-13 11:39:33,161 INFO L356 Elim1Store]: treesize reduction 99, result has 17.5 percent of original size [2022-07-13 11:39:33,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 37 [2022-07-13 11:39:33,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2022-07-13 11:39:33,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2022-07-13 11:39:33,210 INFO L356 Elim1Store]: treesize reduction 39, result has 35.0 percent of original size [2022-07-13 11:39:33,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 36 [2022-07-13 11:39:33,223 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-13 11:39:33,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-13 11:39:33,275 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 244 proven. 108 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-07-13 11:39:33,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:39:33,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-07-13 11:39:33,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 20 [2022-07-13 11:39:33,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:39:33,811 INFO L356 Elim1Store]: treesize reduction 3, result has 25.0 percent of original size [2022-07-13 11:39:33,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 1 [2022-07-13 11:39:33,814 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 257 proven. 36 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-07-13 11:39:33,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820212620] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:39:33,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:39:33,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2022-07-13 11:39:33,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823489253] [2022-07-13 11:39:33,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:39:33,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-13 11:39:33,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:33,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-13 11:39:33,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2022-07-13 11:39:33,815 INFO L87 Difference]: Start difference. First operand 2681 states and 4002 transitions. Second operand has 28 states, 28 states have (on average 11.107142857142858) internal successors, (311), 28 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:35,719 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:39:37,657 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:39:40,614 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:39:44,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:44,167 INFO L93 Difference]: Finished difference Result 9218 states and 13547 transitions. [2022-07-13 11:39:44,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-13 11:39:44,168 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 11.107142857142858) internal successors, (311), 28 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 239 [2022-07-13 11:39:44,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:44,175 INFO L225 Difference]: With dead ends: 9218 [2022-07-13 11:39:44,176 INFO L226 Difference]: Without dead ends: 6560 [2022-07-13 11:39:44,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 490 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=614, Invalid=3046, Unknown=0, NotChecked=0, Total=3660 [2022-07-13 11:39:44,179 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 2354 mSDsluCounter, 3250 mSDsCounter, 0 mSdLazyCounter, 3053 mSolverCounterSat, 595 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2354 SdHoareTripleChecker+Valid, 3565 SdHoareTripleChecker+Invalid, 4319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 595 IncrementalHoareTripleChecker+Valid, 3053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 671 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:44,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2354 Valid, 3565 Invalid, 4319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [595 Valid, 3053 Invalid, 0 Unknown, 671 Unchecked, 9.5s Time] [2022-07-13 11:39:44,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6560 states. [2022-07-13 11:39:44,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6560 to 3419. [2022-07-13 11:39:44,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3419 states, 3418 states have (on average 1.4956114686951434) internal successors, (5112), 3418 states have internal predecessors, (5112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:44,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3419 states to 3419 states and 5112 transitions. [2022-07-13 11:39:44,264 INFO L78 Accepts]: Start accepts. Automaton has 3419 states and 5112 transitions. Word has length 239 [2022-07-13 11:39:44,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:44,264 INFO L495 AbstractCegarLoop]: Abstraction has 3419 states and 5112 transitions. [2022-07-13 11:39:44,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 11.107142857142858) internal successors, (311), 28 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:44,264 INFO L276 IsEmpty]: Start isEmpty. Operand 3419 states and 5112 transitions. [2022-07-13 11:39:44,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2022-07-13 11:39:44,269 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:44,269 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2022-07-13 11:39:44,293 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-13 11:39:44,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-07-13 11:39:44,489 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:39:44,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:39:44,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1335983160, now seen corresponding path program 1 times [2022-07-13 11:39:44,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:39:44,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202740586] [2022-07-13 11:39:44,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:44,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:39:44,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:44,894 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 291 proven. 2 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-07-13 11:39:44,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:39:44,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202740586] [2022-07-13 11:39:44,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202740586] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:39:44,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961279933] [2022-07-13 11:39:44,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:39:44,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:39:44,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:39:44,896 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-13 11:39:44,897 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-13 11:39:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:39:45,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 1316 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-13 11:39:45,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:39:45,638 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-13 11:39:45,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-13 11:39:45,662 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 11:39:45,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-07-13 11:39:45,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:39:45,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2022-07-13 11:39:45,717 INFO L356 Elim1Store]: treesize reduction 50, result has 58.3 percent of original size [2022-07-13 11:39:45,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 85 [2022-07-13 11:39:45,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:39:45,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 70 [2022-07-13 11:39:46,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:39:46,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 57 [2022-07-13 11:39:46,125 INFO L356 Elim1Store]: treesize reduction 99, result has 17.5 percent of original size [2022-07-13 11:39:46,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 37 [2022-07-13 11:39:46,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:39:46,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-07-13 11:39:46,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2022-07-13 11:39:46,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2022-07-13 11:39:46,172 INFO L356 Elim1Store]: treesize reduction 39, result has 35.0 percent of original size [2022-07-13 11:39:46,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 36 [2022-07-13 11:39:46,182 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-13 11:39:46,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-13 11:39:46,225 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 244 proven. 108 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-07-13 11:39:46,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:39:46,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 26 [2022-07-13 11:39:46,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:39:46,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-07-13 11:39:46,746 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 257 proven. 36 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-07-13 11:39:46,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961279933] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:39:46,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:39:46,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 25 [2022-07-13 11:39:46,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323822527] [2022-07-13 11:39:46,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:39:46,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-13 11:39:46,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:39:46,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-13 11:39:46,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2022-07-13 11:39:46,748 INFO L87 Difference]: Start difference. First operand 3419 states and 5112 transitions. Second operand has 25 states, 25 states have (on average 12.04) internal successors, (301), 25 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:48,216 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:39:52,859 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:39:59,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:39:59,694 INFO L93 Difference]: Finished difference Result 16836 states and 24454 transitions. [2022-07-13 11:39:59,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-07-13 11:39:59,695 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 12.04) internal successors, (301), 25 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 240 [2022-07-13 11:39:59,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:39:59,713 INFO L225 Difference]: With dead ends: 16836 [2022-07-13 11:39:59,714 INFO L226 Difference]: Without dead ends: 13440 [2022-07-13 11:39:59,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 492 SyntacticMatches, 6 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1491 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=995, Invalid=3975, Unknown=0, NotChecked=0, Total=4970 [2022-07-13 11:39:59,718 INFO L413 NwaCegarLoop]: 489 mSDtfsCounter, 2234 mSDsluCounter, 5145 mSDsCounter, 0 mSdLazyCounter, 5018 mSolverCounterSat, 472 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2234 SdHoareTripleChecker+Valid, 5634 SdHoareTripleChecker+Invalid, 6412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 472 IncrementalHoareTripleChecker+Valid, 5018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 922 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:39:59,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2234 Valid, 5634 Invalid, 6412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [472 Valid, 5018 Invalid, 0 Unknown, 922 Unchecked, 11.2s Time] [2022-07-13 11:39:59,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13440 states. [2022-07-13 11:39:59,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13440 to 3379. [2022-07-13 11:39:59,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3379 states, 3378 states have (on average 1.4961515689757252) internal successors, (5054), 3378 states have internal predecessors, (5054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:59,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3379 states to 3379 states and 5054 transitions. [2022-07-13 11:39:59,877 INFO L78 Accepts]: Start accepts. Automaton has 3379 states and 5054 transitions. Word has length 240 [2022-07-13 11:39:59,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:39:59,878 INFO L495 AbstractCegarLoop]: Abstraction has 3379 states and 5054 transitions. [2022-07-13 11:39:59,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 12.04) internal successors, (301), 25 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:39:59,878 INFO L276 IsEmpty]: Start isEmpty. Operand 3379 states and 5054 transitions. [2022-07-13 11:39:59,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2022-07-13 11:39:59,882 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:39:59,882 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 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] [2022-07-13 11:39:59,905 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-13 11:40:00,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-07-13 11:40:00,088 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:40:00,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:40:00,088 INFO L85 PathProgramCache]: Analyzing trace with hash -961336381, now seen corresponding path program 1 times [2022-07-13 11:40:00,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:40:00,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531387551] [2022-07-13 11:40:00,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:40:00,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:40:00,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:40:00,251 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 372 proven. 68 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-13 11:40:00,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:40:00,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531387551] [2022-07-13 11:40:00,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531387551] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:40:00,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191404554] [2022-07-13 11:40:00,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:40:00,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:40:00,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:40:00,253 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-13 11:40:00,254 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-13 11:40:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:40:00,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 1369 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-13 11:40:00,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:40:00,961 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-13 11:40:00,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-13 11:40:00,984 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 11:40:00,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-07-13 11:40:01,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-13 11:40:01,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 11:40:01,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-07-13 11:40:01,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-07-13 11:40:01,065 INFO L356 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-07-13 11:40:01,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 32 [2022-07-13 11:40:01,112 INFO L356 Elim1Store]: treesize reduction 66, result has 30.5 percent of original size [2022-07-13 11:40:01,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 42 treesize of output 54 [2022-07-13 11:40:01,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2022-07-13 11:40:01,253 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 363 proven. 68 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-13 11:40:01,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:40:01,313 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11986 (Array Int Int))) (not (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 84)) v_ArrVal_11986) |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52)) 8640))) is different from false [2022-07-13 11:40:01,317 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:40:01,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-07-13 11:40:01,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 39 [2022-07-13 11:40:01,320 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 8 treesize of output 4 [2022-07-13 11:40:01,379 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11977 (Array Int Int))) (not (= |c_ULTIMATE.start_ssl3_accept_~s#1.base| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 176)) v_ArrVal_11977) |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 84))))) is different from false [2022-07-13 11:40:01,540 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:40:01,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 22 [2022-07-13 11:40:01,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2022-07-13 11:40:01,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2022-07-13 11:40:03,468 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_76 Int) (v_arrayElimCell_77 Int)) (not (= (select (select (store |c_#memory_int| v_arrayElimCell_76 (store (select |c_#memory_int| v_arrayElimCell_76) (+ 844 v_arrayElimCell_77) 8640)) |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52)) 8656))) is different from false [2022-07-13 11:40:03,474 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 306 proven. 105 refuted. 0 times theorem prover too weak. 103 trivial. 1 not checked. [2022-07-13 11:40:03,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191404554] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:40:03,475 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:40:03,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 24 [2022-07-13 11:40:03,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791994597] [2022-07-13 11:40:03,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:40:03,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-13 11:40:03,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:40:03,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-13 11:40:03,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=359, Unknown=4, NotChecked=120, Total=552 [2022-07-13 11:40:03,477 INFO L87 Difference]: Start difference. First operand 3379 states and 5054 transitions. Second operand has 24 states, 24 states have (on average 15.875) internal successors, (381), 24 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:07,166 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:40:10,116 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_ssl3_accept_~s#1.base|))) (and (forall ((v_arrayElimCell_76 Int) (v_arrayElimCell_77 Int)) (not (= (select (select (store |c_#memory_int| v_arrayElimCell_76 (store (select |c_#memory_int| v_arrayElimCell_76) (+ 844 v_arrayElimCell_77) 8640)) |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52)) 8656))) (= (select .cse0 (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 64)) 0) (= 8448 (select .cse0 (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52))))) is different from false [2022-07-13 11:40:12,538 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimCell_76 Int) (v_arrayElimCell_77 Int)) (not (= (select (select (store |c_#memory_int| v_arrayElimCell_76 (store (select |c_#memory_int| v_arrayElimCell_76) (+ 844 v_arrayElimCell_77) 8640)) |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52)) 8656))) (= 8448 (select (select |c_#memory_int| |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52)))) is different from false [2022-07-13 11:40:12,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:40:12,649 INFO L93 Difference]: Finished difference Result 10377 states and 15332 transitions. [2022-07-13 11:40:12,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-13 11:40:12,650 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 15.875) internal successors, (381), 24 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 251 [2022-07-13 11:40:12,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:40:12,657 INFO L225 Difference]: With dead ends: 10377 [2022-07-13 11:40:12,657 INFO L226 Difference]: Without dead ends: 7021 [2022-07-13 11:40:12,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 508 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=409, Invalid=2155, Unknown=6, NotChecked=510, Total=3080 [2022-07-13 11:40:12,660 INFO L413 NwaCegarLoop]: 291 mSDtfsCounter, 2491 mSDsluCounter, 2657 mSDsCounter, 0 mSdLazyCounter, 2106 mSolverCounterSat, 636 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2491 SdHoareTripleChecker+Valid, 2948 SdHoareTripleChecker+Invalid, 5514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 636 IncrementalHoareTripleChecker+Valid, 2106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2772 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-07-13 11:40:12,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2491 Valid, 2948 Invalid, 5514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [636 Valid, 2106 Invalid, 0 Unknown, 2772 Unchecked, 5.6s Time] [2022-07-13 11:40:12,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7021 states. [2022-07-13 11:40:12,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7021 to 3586. [2022-07-13 11:40:12,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3586 states, 3585 states have (on average 1.499302649930265) internal successors, (5375), 3585 states have internal predecessors, (5375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:12,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3586 states to 3586 states and 5375 transitions. [2022-07-13 11:40:12,771 INFO L78 Accepts]: Start accepts. Automaton has 3586 states and 5375 transitions. Word has length 251 [2022-07-13 11:40:12,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:40:12,772 INFO L495 AbstractCegarLoop]: Abstraction has 3586 states and 5375 transitions. [2022-07-13 11:40:12,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 15.875) internal successors, (381), 24 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:12,772 INFO L276 IsEmpty]: Start isEmpty. Operand 3586 states and 5375 transitions. [2022-07-13 11:40:12,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2022-07-13 11:40:12,776 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:40:12,776 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 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] [2022-07-13 11:40:12,799 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-13 11:40:12,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-07-13 11:40:12,997 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:40:12,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:40:12,997 INFO L85 PathProgramCache]: Analyzing trace with hash -14298495, now seen corresponding path program 1 times [2022-07-13 11:40:12,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:40:12,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155498301] [2022-07-13 11:40:12,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:40:12,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:40:13,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:40:13,197 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 370 proven. 72 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-07-13 11:40:13,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:40:13,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155498301] [2022-07-13 11:40:13,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155498301] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:40:13,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518591528] [2022-07-13 11:40:13,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:40:13,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:40:13,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:40:13,204 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:40:13,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 11:40:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:40:13,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 1370 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-13 11:40:13,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:40:13,938 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-13 11:40:13,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-13 11:40:13,961 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 11:40:13,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-07-13 11:40:13,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-13 11:40:13,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 11:40:14,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-07-13 11:40:14,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-07-13 11:40:14,021 INFO L356 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-07-13 11:40:14,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 32 [2022-07-13 11:40:14,063 INFO L356 Elim1Store]: treesize reduction 66, result has 30.5 percent of original size [2022-07-13 11:40:14,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 42 treesize of output 54 [2022-07-13 11:40:14,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2022-07-13 11:40:14,172 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 363 proven. 68 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-13 11:40:14,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:40:14,226 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12615 (Array Int Int))) (not (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 84)) v_ArrVal_12615) |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52)) 8640))) is different from false [2022-07-13 11:40:14,230 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:40:14,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-07-13 11:40:14,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 39 [2022-07-13 11:40:14,234 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 8 treesize of output 4 [2022-07-13 11:40:14,318 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12606 (Array Int Int))) (not (= |c_ULTIMATE.start_ssl3_accept_~s#1.base| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 176)) v_ArrVal_12606) |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 84))))) is different from false [2022-07-13 11:40:14,449 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:40:14,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 22 [2022-07-13 11:40:14,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2022-07-13 11:40:14,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2022-07-13 11:40:16,459 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_92 Int) (v_arrayElimCell_91 Int)) (not (= (select (select (store |c_#memory_int| v_arrayElimCell_91 (store (select |c_#memory_int| v_arrayElimCell_91) (+ 844 v_arrayElimCell_92) 3)) |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52)) 8656))) is different from false [2022-07-13 11:40:16,464 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 306 proven. 105 refuted. 0 times theorem prover too weak. 103 trivial. 1 not checked. [2022-07-13 11:40:16,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518591528] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:40:16,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:40:16,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 25 [2022-07-13 11:40:16,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388008028] [2022-07-13 11:40:16,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:40:16,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-13 11:40:16,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:40:16,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-13 11:40:16,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=398, Unknown=4, NotChecked=126, Total=600 [2022-07-13 11:40:16,466 INFO L87 Difference]: Start difference. First operand 3586 states and 5375 transitions. Second operand has 25 states, 25 states have (on average 15.32) internal successors, (383), 25 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:24,151 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_ssl3_accept_~s#1.base|))) (and (= (select .cse0 (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 64)) 0) (= 8448 (select .cse0 (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52))) (forall ((v_arrayElimCell_92 Int) (v_arrayElimCell_91 Int)) (not (= (select (select (store |c_#memory_int| v_arrayElimCell_91 (store (select |c_#memory_int| v_arrayElimCell_91) (+ 844 v_arrayElimCell_92) 3)) |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52)) 8656))))) is different from false [2022-07-13 11:40:25,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:40:25,053 INFO L93 Difference]: Finished difference Result 10695 states and 15797 transitions. [2022-07-13 11:40:25,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-07-13 11:40:25,053 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 15.32) internal successors, (383), 25 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 251 [2022-07-13 11:40:25,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:40:25,061 INFO L225 Difference]: With dead ends: 10695 [2022-07-13 11:40:25,061 INFO L226 Difference]: Without dead ends: 7132 [2022-07-13 11:40:25,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 564 GetRequests, 502 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 955 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=544, Invalid=2773, Unknown=5, NotChecked=460, Total=3782 [2022-07-13 11:40:25,065 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 2709 mSDsluCounter, 3133 mSDsCounter, 0 mSdLazyCounter, 2545 mSolverCounterSat, 613 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2709 SdHoareTripleChecker+Valid, 3404 SdHoareTripleChecker+Invalid, 5184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 613 IncrementalHoareTripleChecker+Valid, 2545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2026 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-07-13 11:40:25,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2709 Valid, 3404 Invalid, 5184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [613 Valid, 2545 Invalid, 0 Unknown, 2026 Unchecked, 6.7s Time] [2022-07-13 11:40:25,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7132 states. [2022-07-13 11:40:25,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7132 to 3386. [2022-07-13 11:40:25,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3386 states, 3385 states have (on average 1.4933530280649927) internal successors, (5055), 3385 states have internal predecessors, (5055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:25,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 5055 transitions. [2022-07-13 11:40:25,213 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 5055 transitions. Word has length 251 [2022-07-13 11:40:25,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:40:25,213 INFO L495 AbstractCegarLoop]: Abstraction has 3386 states and 5055 transitions. [2022-07-13 11:40:25,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 15.32) internal successors, (383), 25 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:25,213 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 5055 transitions. [2022-07-13 11:40:25,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2022-07-13 11:40:25,217 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:40:25,217 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 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] [2022-07-13 11:40:25,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 11:40:25,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:40:25,431 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:40:25,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:40:25,432 INFO L85 PathProgramCache]: Analyzing trace with hash 93515086, now seen corresponding path program 1 times [2022-07-13 11:40:25,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:40:25,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876989098] [2022-07-13 11:40:25,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:40:25,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:40:25,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:40:25,582 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 377 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2022-07-13 11:40:25,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:40:25,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876989098] [2022-07-13 11:40:25,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876989098] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:40:25,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:40:25,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 11:40:25,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791801053] [2022-07-13 11:40:25,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:40:25,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 11:40:25,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:40:25,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 11:40:25,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:40:25,585 INFO L87 Difference]: Start difference. First operand 3386 states and 5055 transitions. Second operand has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:28,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:40:28,188 INFO L93 Difference]: Finished difference Result 8862 states and 13053 transitions. [2022-07-13 11:40:28,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 11:40:28,189 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 252 [2022-07-13 11:40:28,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:40:28,193 INFO L225 Difference]: With dead ends: 8862 [2022-07-13 11:40:28,193 INFO L226 Difference]: Without dead ends: 5499 [2022-07-13 11:40:28,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-07-13 11:40:28,195 INFO L413 NwaCegarLoop]: 358 mSDtfsCounter, 503 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:40:28,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 1193 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-13 11:40:28,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5499 states. [2022-07-13 11:40:28,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5499 to 3386. [2022-07-13 11:40:28,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3386 states, 3385 states have (on average 1.491285081240768) internal successors, (5048), 3385 states have internal predecessors, (5048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:28,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 5048 transitions. [2022-07-13 11:40:28,310 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 5048 transitions. Word has length 252 [2022-07-13 11:40:28,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:40:28,310 INFO L495 AbstractCegarLoop]: Abstraction has 3386 states and 5048 transitions. [2022-07-13 11:40:28,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:28,311 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 5048 transitions. [2022-07-13 11:40:28,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2022-07-13 11:40:28,314 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:40:28,315 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 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] [2022-07-13 11:40:28,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-07-13 11:40:28,315 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:40:28,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:40:28,315 INFO L85 PathProgramCache]: Analyzing trace with hash -613081520, now seen corresponding path program 1 times [2022-07-13 11:40:28,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:40:28,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681721298] [2022-07-13 11:40:28,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:40:28,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:40:28,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:40:28,485 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 380 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-07-13 11:40:28,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:40:28,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681721298] [2022-07-13 11:40:28,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681721298] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:40:28,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:40:28,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 11:40:28,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056826880] [2022-07-13 11:40:28,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:40:28,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 11:40:28,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:40:28,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 11:40:28,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:40:28,486 INFO L87 Difference]: Start difference. First operand 3386 states and 5048 transitions. Second operand has 7 states, 7 states have (on average 22.571428571428573) internal successors, (158), 7 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:31,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:40:31,167 INFO L93 Difference]: Finished difference Result 9526 states and 14059 transitions. [2022-07-13 11:40:31,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 11:40:31,168 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.571428571428573) internal successors, (158), 7 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 252 [2022-07-13 11:40:31,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:40:31,173 INFO L225 Difference]: With dead ends: 9526 [2022-07-13 11:40:31,173 INFO L226 Difference]: Without dead ends: 6139 [2022-07-13 11:40:31,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-07-13 11:40:31,176 INFO L413 NwaCegarLoop]: 369 mSDtfsCounter, 505 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:40:31,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 1223 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-13 11:40:31,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6139 states. [2022-07-13 11:40:31,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6139 to 3826. [2022-07-13 11:40:31,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3826 states, 3825 states have (on average 1.4972549019607844) internal successors, (5727), 3825 states have internal predecessors, (5727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:31,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 5727 transitions. [2022-07-13 11:40:31,315 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 5727 transitions. Word has length 252 [2022-07-13 11:40:31,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:40:31,315 INFO L495 AbstractCegarLoop]: Abstraction has 3826 states and 5727 transitions. [2022-07-13 11:40:31,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.571428571428573) internal successors, (158), 7 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:31,315 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 5727 transitions. [2022-07-13 11:40:31,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2022-07-13 11:40:31,319 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:40:31,320 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2022-07-13 11:40:31,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-07-13 11:40:31,320 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:40:31,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:40:31,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1799400237, now seen corresponding path program 1 times [2022-07-13 11:40:31,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:40:31,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146223887] [2022-07-13 11:40:31,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:40:31,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:40:31,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:40:31,416 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 423 trivial. 0 not checked. [2022-07-13 11:40:31,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:40:31,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146223887] [2022-07-13 11:40:31,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146223887] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:40:31,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:40:31,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:40:31,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480065183] [2022-07-13 11:40:31,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:40:31,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:40:31,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:40:31,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:40:31,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:40:31,420 INFO L87 Difference]: Start difference. First operand 3826 states and 5727 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:32,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:40:32,460 INFO L93 Difference]: Finished difference Result 7909 states and 11822 transitions. [2022-07-13 11:40:32,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:40:32,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 262 [2022-07-13 11:40:32,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:40:32,465 INFO L225 Difference]: With dead ends: 7909 [2022-07-13 11:40:32,465 INFO L226 Difference]: Without dead ends: 4106 [2022-07-13 11:40:32,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:40:32,468 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 30 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 11:40:32,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 577 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-13 11:40:32,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2022-07-13 11:40:32,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 4008. [2022-07-13 11:40:32,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4008 states, 4007 states have (on average 1.4956326428749689) internal successors, (5993), 4007 states have internal predecessors, (5993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:32,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4008 states to 4008 states and 5993 transitions. [2022-07-13 11:40:32,612 INFO L78 Accepts]: Start accepts. Automaton has 4008 states and 5993 transitions. Word has length 262 [2022-07-13 11:40:32,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:40:32,612 INFO L495 AbstractCegarLoop]: Abstraction has 4008 states and 5993 transitions. [2022-07-13 11:40:32,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:32,612 INFO L276 IsEmpty]: Start isEmpty. Operand 4008 states and 5993 transitions. [2022-07-13 11:40:32,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2022-07-13 11:40:32,617 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:40:32,617 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-13 11:40:32,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-07-13 11:40:32,617 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:40:32,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:40:32,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1317501989, now seen corresponding path program 1 times [2022-07-13 11:40:32,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:40:32,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867707445] [2022-07-13 11:40:32,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:40:32,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:40:32,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:40:32,859 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 304 proven. 8 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2022-07-13 11:40:32,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:40:32,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867707445] [2022-07-13 11:40:32,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867707445] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:40:32,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141266824] [2022-07-13 11:40:32,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:40:32,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:40:32,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:40:32,864 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:40:32,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 11:40:33,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:40:33,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 1492 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-13 11:40:33,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:40:33,720 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-13 11:40:33,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-13 11:40:33,742 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 11:40:33,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-07-13 11:40:33,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-13 11:40:33,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 11:40:33,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-07-13 11:40:33,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-07-13 11:40:33,782 INFO L356 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-07-13 11:40:33,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 32 [2022-07-13 11:40:33,821 INFO L356 Elim1Store]: treesize reduction 66, result has 30.5 percent of original size [2022-07-13 11:40:33,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 42 treesize of output 54 [2022-07-13 11:40:33,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2022-07-13 11:40:33,903 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 299 proven. 104 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2022-07-13 11:40:33,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:40:33,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2022-07-13 11:40:33,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2022-07-13 11:40:34,778 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_102 Int) (v_arrayElimCell_103 Int)) (not (= (select (select (store |c_#memory_int| v_arrayElimCell_102 (store (select |c_#memory_int| v_arrayElimCell_102) (+ v_arrayElimCell_103 844) 8640)) |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52)) 8528))) is different from false [2022-07-13 11:40:34,784 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 301 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2022-07-13 11:40:34,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141266824] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 11:40:34,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:40:34,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 10] total 13 [2022-07-13 11:40:34,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14672159] [2022-07-13 11:40:34,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:40:34,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:40:34,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:40:34,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:40:34,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=102, Unknown=1, NotChecked=20, Total=156 [2022-07-13 11:40:34,785 INFO L87 Difference]: Start difference. First operand 4008 states and 5993 transitions. Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:36,685 WARN L833 $PredicateComparison]: unable to prove that (and (not (= 8528 (select (select |c_#memory_int| |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52)))) (forall ((v_arrayElimCell_102 Int) (v_arrayElimCell_103 Int)) (not (= (select (select (store |c_#memory_int| v_arrayElimCell_102 (store (select |c_#memory_int| v_arrayElimCell_102) (+ v_arrayElimCell_103 844) 8640)) |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52)) 8528)))) is different from false [2022-07-13 11:40:36,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:40:36,839 INFO L93 Difference]: Finished difference Result 8625 states and 12851 transitions. [2022-07-13 11:40:36,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 11:40:36,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 262 [2022-07-13 11:40:36,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:40:36,843 INFO L225 Difference]: With dead ends: 8625 [2022-07-13 11:40:36,843 INFO L226 Difference]: Without dead ends: 4640 [2022-07-13 11:40:36,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 521 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=40, Invalid=122, Unknown=2, NotChecked=46, Total=210 [2022-07-13 11:40:36,847 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 121 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 193 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 11:40:36,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 400 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 240 Invalid, 0 Unknown, 193 Unchecked, 0.7s Time] [2022-07-13 11:40:36,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4640 states. [2022-07-13 11:40:36,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4640 to 4170. [2022-07-13 11:40:36,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4170 states, 4169 states have (on average 1.480690813144639) internal successors, (6173), 4169 states have internal predecessors, (6173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:36,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4170 states to 4170 states and 6173 transitions. [2022-07-13 11:40:36,986 INFO L78 Accepts]: Start accepts. Automaton has 4170 states and 6173 transitions. Word has length 262 [2022-07-13 11:40:36,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:40:36,986 INFO L495 AbstractCegarLoop]: Abstraction has 4170 states and 6173 transitions. [2022-07-13 11:40:36,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:36,986 INFO L276 IsEmpty]: Start isEmpty. Operand 4170 states and 6173 transitions. [2022-07-13 11:40:36,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2022-07-13 11:40:36,991 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:40:36,991 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-13 11:40:37,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-13 11:40:37,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-07-13 11:40:37,198 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:40:37,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:40:37,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1015890649, now seen corresponding path program 1 times [2022-07-13 11:40:37,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:40:37,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767691774] [2022-07-13 11:40:37,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:40:37,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:40:37,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:40:37,410 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 304 proven. 8 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2022-07-13 11:40:37,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:40:37,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767691774] [2022-07-13 11:40:37,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767691774] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:40:37,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451834723] [2022-07-13 11:40:37,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:40:37,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:40:37,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:40:37,412 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:40:37,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 11:40:38,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:40:38,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 1493 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-13 11:40:38,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:40:38,251 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-13 11:40:38,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-13 11:40:38,277 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 11:40:38,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-07-13 11:40:38,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-13 11:40:38,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 11:40:38,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 11:40:38,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 11:40:38,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-07-13 11:40:38,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-07-13 11:40:38,322 INFO L356 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-07-13 11:40:38,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 32 [2022-07-13 11:40:38,368 INFO L356 Elim1Store]: treesize reduction 66, result has 30.5 percent of original size [2022-07-13 11:40:38,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 42 treesize of output 54 [2022-07-13 11:40:38,856 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:40:38,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 46 [2022-07-13 11:40:38,879 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 299 proven. 104 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2022-07-13 11:40:38,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:40:38,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2022-07-13 11:40:38,928 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 301 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2022-07-13 11:40:38,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451834723] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 11:40:38,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:40:38,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 10] total 12 [2022-07-13 11:40:38,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281872563] [2022-07-13 11:40:38,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:40:38,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:40:38,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:40:38,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:40:38,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-13 11:40:38,930 INFO L87 Difference]: Start difference. First operand 4170 states and 6173 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:39,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:40:39,709 INFO L93 Difference]: Finished difference Result 8711 states and 12847 transitions. [2022-07-13 11:40:39,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:40:39,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 262 [2022-07-13 11:40:39,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:40:39,712 INFO L225 Difference]: With dead ends: 8711 [2022-07-13 11:40:39,712 INFO L226 Difference]: Without dead ends: 4564 [2022-07-13 11:40:39,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 521 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-07-13 11:40:39,715 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 121 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 11:40:39,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 372 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 11:40:39,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4564 states. [2022-07-13 11:40:39,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4564 to 4008. [2022-07-13 11:40:39,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4008 states, 4007 states have (on average 1.4794110306962815) internal successors, (5928), 4007 states have internal predecessors, (5928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:39,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4008 states to 4008 states and 5928 transitions. [2022-07-13 11:40:39,859 INFO L78 Accepts]: Start accepts. Automaton has 4008 states and 5928 transitions. Word has length 262 [2022-07-13 11:40:39,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:40:39,859 INFO L495 AbstractCegarLoop]: Abstraction has 4008 states and 5928 transitions. [2022-07-13 11:40:39,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:39,860 INFO L276 IsEmpty]: Start isEmpty. Operand 4008 states and 5928 transitions. [2022-07-13 11:40:39,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-07-13 11:40:39,864 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:40:39,864 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 4, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-13 11:40:39,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-13 11:40:40,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:40:40,082 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:40:40,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:40:40,082 INFO L85 PathProgramCache]: Analyzing trace with hash -107756293, now seen corresponding path program 1 times [2022-07-13 11:40:40,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:40:40,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583431809] [2022-07-13 11:40:40,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:40:40,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:40:40,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:40:40,849 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 339 proven. 297 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-13 11:40:40,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:40:40,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583431809] [2022-07-13 11:40:40,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583431809] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:40:40,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785730965] [2022-07-13 11:40:40,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:40:40,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:40:40,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:40:40,850 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:40:40,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-13 11:40:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:40:41,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 1495 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-13 11:40:41,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:40:41,743 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-13 11:40:41,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-13 11:40:41,777 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 11:40:41,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-07-13 11:40:41,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-13 11:40:41,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 11:40:41,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-07-13 11:40:41,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-07-13 11:40:41,841 INFO L356 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-07-13 11:40:41,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 32 [2022-07-13 11:40:41,885 INFO L356 Elim1Store]: treesize reduction 66, result has 30.5 percent of original size [2022-07-13 11:40:41,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 42 treesize of output 54 [2022-07-13 11:40:41,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2022-07-13 11:40:41,979 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 301 proven. 103 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-07-13 11:40:41,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:40:42,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2022-07-13 11:40:42,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2022-07-13 11:40:42,806 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_124 Int) (v_arrayElimCell_125 Int)) (not (= 8529 (select (select (store |c_#memory_int| v_arrayElimCell_124 (store (select |c_#memory_int| v_arrayElimCell_124) (+ v_arrayElimCell_125 844) 8640)) |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52))))) is different from false [2022-07-13 11:40:42,812 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 305 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2022-07-13 11:40:42,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785730965] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 11:40:42,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:40:42,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14, 10] total 22 [2022-07-13 11:40:42,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720438058] [2022-07-13 11:40:42,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:40:42,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:40:42,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:40:42,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:40:42,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=360, Unknown=1, NotChecked=38, Total=462 [2022-07-13 11:40:42,814 INFO L87 Difference]: Start difference. First operand 4008 states and 5928 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:45,933 WARN L833 $PredicateComparison]: unable to prove that (and (not (= (select (select |c_#memory_int| |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52)) 8529)) (forall ((v_arrayElimCell_124 Int) (v_arrayElimCell_125 Int)) (not (= 8529 (select (select (store |c_#memory_int| v_arrayElimCell_124 (store (select |c_#memory_int| v_arrayElimCell_124) (+ v_arrayElimCell_125 844) 8640)) |c_ULTIMATE.start_ssl3_accept_~s#1.base|) (+ |c_ULTIMATE.start_ssl3_accept_~s#1.offset| 52)))))) is different from false [2022-07-13 11:40:46,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:40:46,127 INFO L93 Difference]: Finished difference Result 8625 states and 12715 transitions. [2022-07-13 11:40:46,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 11:40:46,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 263 [2022-07-13 11:40:46,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:40:46,131 INFO L225 Difference]: With dead ends: 8625 [2022-07-13 11:40:46,131 INFO L226 Difference]: Without dead ends: 4640 [2022-07-13 11:40:46,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 523 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=69, Invalid=399, Unknown=2, NotChecked=82, Total=552 [2022-07-13 11:40:46,133 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 120 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 265 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:40:46,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 474 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 239 Invalid, 0 Unknown, 265 Unchecked, 1.1s Time] [2022-07-13 11:40:46,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4640 states. [2022-07-13 11:40:46,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4640 to 4176. [2022-07-13 11:40:46,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4176 states, 4175 states have (on average 1.464431137724551) internal successors, (6114), 4175 states have internal predecessors, (6114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:46,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4176 states to 4176 states and 6114 transitions. [2022-07-13 11:40:46,270 INFO L78 Accepts]: Start accepts. Automaton has 4176 states and 6114 transitions. Word has length 263 [2022-07-13 11:40:46,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:40:46,270 INFO L495 AbstractCegarLoop]: Abstraction has 4176 states and 6114 transitions. [2022-07-13 11:40:46,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:46,270 INFO L276 IsEmpty]: Start isEmpty. Operand 4176 states and 6114 transitions. [2022-07-13 11:40:46,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-07-13 11:40:46,274 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:40:46,274 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 3, 3, 2, 2, 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] [2022-07-13 11:40:46,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-13 11:40:46,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-07-13 11:40:46,475 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:40:46,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:40:46,475 INFO L85 PathProgramCache]: Analyzing trace with hash -830624380, now seen corresponding path program 1 times [2022-07-13 11:40:46,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:40:46,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991661191] [2022-07-13 11:40:46,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:40:46,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:40:46,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:40:46,898 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 677 trivial. 0 not checked. [2022-07-13 11:40:46,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:40:46,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991661191] [2022-07-13 11:40:46,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991661191] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:40:46,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:40:46,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:40:46,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138427039] [2022-07-13 11:40:46,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:40:46,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:40:46,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:40:46,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:40:46,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:40:46,900 INFO L87 Difference]: Start difference. First operand 4176 states and 6114 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:48,906 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:40:49,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:40:49,243 INFO L93 Difference]: Finished difference Result 8349 states and 12224 transitions. [2022-07-13 11:40:49,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:40:49,243 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 263 [2022-07-13 11:40:49,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:40:49,247 INFO L225 Difference]: With dead ends: 8349 [2022-07-13 11:40:49,247 INFO L226 Difference]: Without dead ends: 4176 [2022-07-13 11:40:49,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-13 11:40:49,250 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 7 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:40:49,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 671 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 11:40:49,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4176 states. [2022-07-13 11:40:49,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4176 to 4176. [2022-07-13 11:40:49,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4176 states, 4175 states have (on average 1.464191616766467) internal successors, (6113), 4175 states have internal predecessors, (6113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:49,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4176 states to 4176 states and 6113 transitions. [2022-07-13 11:40:49,402 INFO L78 Accepts]: Start accepts. Automaton has 4176 states and 6113 transitions. Word has length 263 [2022-07-13 11:40:49,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:40:49,402 INFO L495 AbstractCegarLoop]: Abstraction has 4176 states and 6113 transitions. [2022-07-13 11:40:49,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:40:49,402 INFO L276 IsEmpty]: Start isEmpty. Operand 4176 states and 6113 transitions. [2022-07-13 11:40:49,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-07-13 11:40:49,406 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:40:49,406 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 3, 3, 2, 2, 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] [2022-07-13 11:40:49,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-07-13 11:40:49,406 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:40:49,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:40:49,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1001757830, now seen corresponding path program 1 times [2022-07-13 11:40:49,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:40:49,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312233797] [2022-07-13 11:40:49,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:40:49,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:40:49,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:40:50,126 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 457 proven. 186 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-13 11:40:50,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:40:50,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312233797] [2022-07-13 11:40:50,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312233797] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:40:50,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425808932] [2022-07-13 11:40:50,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:40:50,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:40:50,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:40:50,127 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:40:50,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-13 11:40:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:40:51,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 1497 conjuncts, 72 conjunts are in the unsatisfiable core [2022-07-13 11:40:51,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:40:51,318 INFO L356 Elim1Store]: treesize reduction 71, result has 37.7 percent of original size [2022-07-13 11:40:51,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 230 [2022-07-13 11:40:51,669 INFO L356 Elim1Store]: treesize reduction 126, result has 49.0 percent of original size [2022-07-13 11:40:51,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 236 treesize of output 569 [2022-07-13 11:40:51,794 INFO L356 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2022-07-13 11:40:51,796 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-13 11:40:51,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-13 11:40:51,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-07-13 11:40:51,997 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.base_752| input size 161 context size 161 output size 161 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) 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:182) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:164) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:152) 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:764) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:725) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:643) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:335) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) 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:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) 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-13 11:40:51,998 INFO L158 Benchmark]: Toolchain (without parser) took 122699.26ms. Allocated memory was 94.4MB in the beginning and 662.7MB in the end (delta: 568.3MB). Free memory was 62.7MB in the beginning and 410.9MB in the end (delta: -348.2MB). Peak memory consumption was 222.9MB. Max. memory is 16.1GB. [2022-07-13 11:40:51,999 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 94.4MB. Free memory is still 50.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 11:40:51,999 INFO L158 Benchmark]: CACSL2BoogieTranslator took 443.74ms. Allocated memory was 94.4MB in the beginning and 127.9MB in the end (delta: 33.6MB). Free memory was 62.5MB in the beginning and 82.3MB in the end (delta: -19.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-13 11:40:51,999 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.59ms. Allocated memory is still 127.9MB. Free memory was 82.3MB in the beginning and 77.1MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 11:40:52,000 INFO L158 Benchmark]: Boogie Preprocessor took 74.87ms. Allocated memory is still 127.9MB. Free memory was 77.1MB in the beginning and 70.2MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 11:40:52,007 INFO L158 Benchmark]: RCFGBuilder took 1157.48ms. Allocated memory is still 127.9MB. Free memory was 70.2MB in the beginning and 78.3MB in the end (delta: -8.1MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. [2022-07-13 11:40:52,008 INFO L158 Benchmark]: TraceAbstraction took 120956.69ms. Allocated memory was 127.9MB in the beginning and 662.7MB in the end (delta: 534.8MB). Free memory was 77.4MB in the beginning and 410.9MB in the end (delta: -333.5MB). Peak memory consumption was 202.2MB. Max. memory is 16.1GB. [2022-07-13 11:40:52,009 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 94.4MB. Free memory is still 50.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 443.74ms. Allocated memory was 94.4MB in the beginning and 127.9MB in the end (delta: 33.6MB). Free memory was 62.5MB in the beginning and 82.3MB in the end (delta: -19.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.59ms. Allocated memory is still 127.9MB. Free memory was 82.3MB in the beginning and 77.1MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.87ms. Allocated memory is still 127.9MB. Free memory was 77.1MB in the beginning and 70.2MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1157.48ms. Allocated memory is still 127.9MB. Free memory was 70.2MB in the beginning and 78.3MB in the end (delta: -8.1MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. * TraceAbstraction took 120956.69ms. Allocated memory was 127.9MB in the beginning and 662.7MB in the end (delta: 534.8MB). Free memory was 77.4MB in the beginning and 410.9MB in the end (delta: -333.5MB). Peak memory consumption was 202.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_752| input size 161 context size 161 output size 161 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_752| input size 161 context size 161 output size 161: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-13 11:40:52,042 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/openssl/s3_srvr.blast.09.i.cil-1.c -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 7b66a12741a993de3de45354c2fb746af1f1a44b9ceb94bb607376650a8088af --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:40:53,609 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:40:53,612 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:40:53,640 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:40:53,641 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:40:53,641 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:40:53,645 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:40:53,648 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:40:53,649 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:40:53,653 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:40:53,654 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:40:53,658 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:40:53,658 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:40:53,660 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:40:53,661 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:40:53,662 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:40:53,663 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:40:53,663 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:40:53,665 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:40:53,668 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:40:53,671 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:40:53,672 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:40:53,672 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:40:53,673 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:40:53,674 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:40:53,676 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:40:53,677 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:40:53,677 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:40:53,678 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:40:53,678 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:40:53,679 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:40:53,679 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:40:53,680 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:40:53,681 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:40:53,682 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:40:53,682 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:40:53,682 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:40:53,683 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:40:53,683 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:40:53,683 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:40:53,684 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:40:53,688 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:40:53,688 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-13 11:40:53,716 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:40:53,717 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:40:53,717 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:40:53,717 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:40:53,718 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:40:53,718 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:40:53,718 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:40:53,718 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:40:53,718 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:40:53,719 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:40:53,719 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:40:53,720 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:40:53,720 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:40:53,720 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:40:53,720 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:40:53,720 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:40:53,720 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 11:40:53,720 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 11:40:53,721 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 11:40:53,721 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:40:53,721 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:40:53,721 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:40:53,721 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:40:53,721 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:40:53,721 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:40:53,722 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:40:53,722 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:40:53,722 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:40:53,722 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:40:53,722 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:40:53,723 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 11:40:53,723 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 11:40:53,723 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:40:53,723 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:40:53,723 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:40:53,723 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 11:40:53,724 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 -> 7b66a12741a993de3de45354c2fb746af1f1a44b9ceb94bb607376650a8088af [2022-07-13 11:40:53,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:40:54,001 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:40:54,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:40:54,004 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:40:54,004 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:40:54,005 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.09.i.cil-1.c [2022-07-13 11:40:54,044 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae895c236/ac94782f14264c71ab7d713f96a9ff59/FLAG40ebe80f7 [2022-07-13 11:40:54,456 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:40:54,459 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.09.i.cil-1.c [2022-07-13 11:40:54,477 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae895c236/ac94782f14264c71ab7d713f96a9ff59/FLAG40ebe80f7 [2022-07-13 11:40:54,792 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae895c236/ac94782f14264c71ab7d713f96a9ff59 [2022-07-13 11:40:54,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:40:54,797 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:40:54,797 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:40:54,798 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:40:54,800 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:40:54,800 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:40:54" (1/1) ... [2022-07-13 11:40:54,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ab220fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:40:54, skipping insertion in model container [2022-07-13 11:40:54,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:40:54" (1/1) ... [2022-07-13 11:40:54,807 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:40:54,859 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:40:55,137 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/openssl/s3_srvr.blast.09.i.cil-1.c[74369,74382] [2022-07-13 11:40:55,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:40:55,162 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-13 11:40:55,168 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:40:55,252 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/openssl/s3_srvr.blast.09.i.cil-1.c[74369,74382] [2022-07-13 11:40:55,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:40:55,268 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:40:55,367 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/openssl/s3_srvr.blast.09.i.cil-1.c[74369,74382] [2022-07-13 11:40:55,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:40:55,389 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:40:55,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:40:55 WrapperNode [2022-07-13 11:40:55,389 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:40:55,390 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:40:55,390 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:40:55,390 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:40:55,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:40:55" (1/1) ... [2022-07-13 11:40:55,427 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:40:55" (1/1) ... [2022-07-13 11:40:55,463 INFO L137 Inliner]: procedures = 35, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 762 [2022-07-13 11:40:55,468 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:40:55,469 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:40:55,469 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:40:55,470 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:40:55,475 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:40:55" (1/1) ... [2022-07-13 11:40:55,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:40:55" (1/1) ... [2022-07-13 11:40:55,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:40:55" (1/1) ... [2022-07-13 11:40:55,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:40:55" (1/1) ... [2022-07-13 11:40:55,518 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:40:55" (1/1) ... [2022-07-13 11:40:55,529 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:40:55" (1/1) ... [2022-07-13 11:40:55,541 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:40:55" (1/1) ... [2022-07-13 11:40:55,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:40:55,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:40:55,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:40:55,559 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:40:55,559 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:40:55" (1/1) ... [2022-07-13 11:40:55,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:40:55,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:40:55,589 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-13 11:40:55,595 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-13 11:40:55,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:40:55,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 11:40:55,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 11:40:55,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-13 11:40:55,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 11:40:55,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 11:40:55,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:40:55,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:40:55,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-13 11:40:55,757 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:40:55,758 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:40:55,770 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:41:02,470 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-13 11:41:02,470 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-13 11:41:02,470 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:41:02,475 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:41:02,475 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 11:41:02,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:41:02 BoogieIcfgContainer [2022-07-13 11:41:02,476 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:41:02,478 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:41:02,478 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:41:02,479 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:41:02,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:40:54" (1/3) ... [2022-07-13 11:41:02,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b627 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:41:02, skipping insertion in model container [2022-07-13 11:41:02,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:40:55" (2/3) ... [2022-07-13 11:41:02,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b627 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:41:02, skipping insertion in model container [2022-07-13 11:41:02,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:41:02" (3/3) ... [2022-07-13 11:41:02,481 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.09.i.cil-1.c [2022-07-13 11:41:02,490 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:41:02,491 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:41:02,534 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:41:02,540 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@373bd004, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@47856646 [2022-07-13 11:41:02,540 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:41:02,544 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 148 states have (on average 1.7162162162162162) internal successors, (254), 149 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:41:02,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 11:41:02,551 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:41:02,552 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:41:02,552 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:41:02,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:41:02,556 INFO L85 PathProgramCache]: Analyzing trace with hash -442385418, now seen corresponding path program 1 times [2022-07-13 11:41:02,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:41:02,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2075471084] [2022-07-13 11:41:02,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:41:02,566 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:41:02,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:41:02,568 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-13 11:41:02,573 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-13 11:41:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:41:03,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 11:41:03,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:41:03,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:41:03,134 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:41:03,135 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:41:03,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2075471084] [2022-07-13 11:41:03,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2075471084] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:41:03,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:41:03,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:41:03,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430771839] [2022-07-13 11:41:03,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:41:03,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:41:03,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:41:03,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:41:03,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:41:03,168 INFO L87 Difference]: Start difference. First operand has 150 states, 148 states have (on average 1.7162162162162162) internal successors, (254), 149 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:41:03,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:41:03,280 INFO L93 Difference]: Finished difference Result 427 states and 728 transitions. [2022-07-13 11:41:03,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:41:03,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-13 11:41:03,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:41:03,295 INFO L225 Difference]: With dead ends: 427 [2022-07-13 11:41:03,295 INFO L226 Difference]: Without dead ends: 261 [2022-07-13 11:41:03,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 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-13 11:41:03,299 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 201 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:41:03,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 461 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:41:03,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-07-13 11:41:03,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2022-07-13 11:41:03,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 260 states have (on average 1.5153846153846153) internal successors, (394), 260 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:41:03,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 394 transitions. [2022-07-13 11:41:03,340 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 394 transitions. Word has length 37 [2022-07-13 11:41:03,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:41:03,340 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 394 transitions. [2022-07-13 11:41:03,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:41:03,340 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 394 transitions. [2022-07-13 11:41:03,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-13 11:41:03,342 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:41:03,342 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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] [2022-07-13 11:41:03,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-13 11:41:03,544 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-13 11:41:03,544 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:41:03,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:41:03,545 INFO L85 PathProgramCache]: Analyzing trace with hash 242366870, now seen corresponding path program 1 times [2022-07-13 11:41:03,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:41:03,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [895845942] [2022-07-13 11:41:03,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:41:03,546 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:41:03,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:41:03,547 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-13 11:41:03,549 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-13 11:41:03,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:41:03,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 11:41:03,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:41:04,077 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:41:04,077 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:41:04,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:41:04,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [895845942] [2022-07-13 11:41:04,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [895845942] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:41:04,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:41:04,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:41:04,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906803025] [2022-07-13 11:41:04,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:41:04,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:41:04,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:41:04,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:41:04,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:41:04,079 INFO L87 Difference]: Start difference. First operand 261 states and 394 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:41:04,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:41:04,592 INFO L93 Difference]: Finished difference Result 510 states and 781 transitions. [2022-07-13 11:41:04,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:41:04,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-07-13 11:41:04,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:41:04,594 INFO L225 Difference]: With dead ends: 510 [2022-07-13 11:41:04,594 INFO L226 Difference]: Without dead ends: 383 [2022-07-13 11:41:04,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 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-13 11:41:04,596 INFO L413 NwaCegarLoop]: 378 mSDtfsCounter, 150 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 11:41:04,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 567 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 11:41:04,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-07-13 11:41:04,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2022-07-13 11:41:04,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.5052356020942408) internal successors, (575), 382 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:41:04,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 575 transitions. [2022-07-13 11:41:04,613 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 575 transitions. Word has length 54 [2022-07-13 11:41:04,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:41:04,613 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 575 transitions. [2022-07-13 11:41:04,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:41:04,614 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 575 transitions. [2022-07-13 11:41:04,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-13 11:41:04,616 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:41:04,616 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 11:41:04,632 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-13 11:41:04,832 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-13 11:41:04,832 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:41:04,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:41:04,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1040793707, now seen corresponding path program 1 times [2022-07-13 11:41:04,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:41:04,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [792029911] [2022-07-13 11:41:04,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:41:04,833 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:41:04,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:41:04,836 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-13 11:41:04,837 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-13 11:41:05,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:41:05,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 11:41:05,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:41:05,347 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 11:41:05,347 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:41:05,347 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:41:05,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [792029911] [2022-07-13 11:41:05,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [792029911] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:41:05,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:41:05,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:41:05,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778382190] [2022-07-13 11:41:05,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:41:05,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:41:05,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:41:05,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:41:05,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:41:05,349 INFO L87 Difference]: Start difference. First operand 383 states and 575 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:41:05,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:41:05,736 INFO L93 Difference]: Finished difference Result 754 states and 1144 transitions. [2022-07-13 11:41:05,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:41:05,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2022-07-13 11:41:05,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:41:05,738 INFO L225 Difference]: With dead ends: 754 [2022-07-13 11:41:05,738 INFO L226 Difference]: Without dead ends: 505 [2022-07-13 11:41:05,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 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-13 11:41:05,740 INFO L413 NwaCegarLoop]: 380 mSDtfsCounter, 148 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:41:05,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 569 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 11:41:05,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-07-13 11:41:05,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2022-07-13 11:41:05,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 504 states have (on average 1.501984126984127) internal successors, (757), 504 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:41:05,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 757 transitions. [2022-07-13 11:41:05,750 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 757 transitions. Word has length 76 [2022-07-13 11:41:05,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:41:05,751 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 757 transitions. [2022-07-13 11:41:05,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:41:05,751 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 757 transitions. [2022-07-13 11:41:05,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-13 11:41:05,753 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:41:05,753 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 11:41:05,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-13 11:41:05,970 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-13 11:41:05,971 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:41:05,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:41:05,971 INFO L85 PathProgramCache]: Analyzing trace with hash -792001576, now seen corresponding path program 1 times [2022-07-13 11:41:05,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:41:05,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1070203228] [2022-07-13 11:41:05,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:41:05,973 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:41:05,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:41:05,974 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-13 11:41:05,975 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-13 11:41:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:41:06,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 11:41:06,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:41:06,551 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-13 11:41:06,551 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:41:06,551 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:41:06,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1070203228] [2022-07-13 11:41:06,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1070203228] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:41:06,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:41:06,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:41:06,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333180653] [2022-07-13 11:41:06,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:41:06,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:41:06,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:41:06,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:41:06,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:41:06,554 INFO L87 Difference]: Start difference. First operand 505 states and 757 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:41:07,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:41:07,050 INFO L93 Difference]: Finished difference Result 1000 states and 1510 transitions. [2022-07-13 11:41:07,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:41:07,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2022-07-13 11:41:07,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:41:07,053 INFO L225 Difference]: With dead ends: 1000 [2022-07-13 11:41:07,053 INFO L226 Difference]: Without dead ends: 629 [2022-07-13 11:41:07,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 98 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-13 11:41:07,054 INFO L413 NwaCegarLoop]: 383 mSDtfsCounter, 152 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 11:41:07,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 572 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 11:41:07,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2022-07-13 11:41:07,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2022-07-13 11:41:07,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 628 states have (on average 1.4984076433121019) internal successors, (941), 628 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:41:07,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 941 transitions. [2022-07-13 11:41:07,076 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 941 transitions. Word has length 100 [2022-07-13 11:41:07,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:41:07,077 INFO L495 AbstractCegarLoop]: Abstraction has 629 states and 941 transitions. [2022-07-13 11:41:07,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:41:07,077 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 941 transitions. [2022-07-13 11:41:07,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-13 11:41:07,081 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:41:07,082 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 11:41:07,100 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-13 11:41:07,287 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-13 11:41:07,287 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:41:07,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:41:07,288 INFO L85 PathProgramCache]: Analyzing trace with hash -483706638, now seen corresponding path program 1 times [2022-07-13 11:41:07,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:41:07,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1563720046] [2022-07-13 11:41:07,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:41:07,289 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:41:07,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:41:07,290 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-13 11:41:07,291 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-13 11:41:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:41:07,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 11:41:07,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:41:07,845 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-13 11:41:07,845 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:41:07,845 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:41:07,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1563720046] [2022-07-13 11:41:07,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1563720046] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:41:07,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:41:07,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:41:07,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198628922] [2022-07-13 11:41:07,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:41:07,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:41:07,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:41:07,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:41:07,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:41:07,846 INFO L87 Difference]: Start difference. First operand 629 states and 941 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:41:08,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:41:08,379 INFO L93 Difference]: Finished difference Result 1244 states and 1871 transitions. [2022-07-13 11:41:08,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:41:08,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2022-07-13 11:41:08,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:41:08,381 INFO L225 Difference]: With dead ends: 1244 [2022-07-13 11:41:08,381 INFO L226 Difference]: Without dead ends: 749 [2022-07-13 11:41:08,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 115 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-13 11:41:08,383 INFO L413 NwaCegarLoop]: 380 mSDtfsCounter, 147 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 11:41:08,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 569 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 11:41:08,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2022-07-13 11:41:08,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 749. [2022-07-13 11:41:08,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 748 states have (on average 1.4973262032085561) internal successors, (1120), 748 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:41:08,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1120 transitions. [2022-07-13 11:41:08,394 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1120 transitions. Word has length 117 [2022-07-13 11:41:08,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:41:08,394 INFO L495 AbstractCegarLoop]: Abstraction has 749 states and 1120 transitions. [2022-07-13 11:41:08,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:41:08,395 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1120 transitions. [2022-07-13 11:41:08,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-13 11:41:08,396 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:41:08,396 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2022-07-13 11:41:08,424 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-13 11:41:08,619 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-13 11:41:08,619 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:41:08,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:41:08,620 INFO L85 PathProgramCache]: Analyzing trace with hash 686668759, now seen corresponding path program 1 times [2022-07-13 11:41:08,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:41:08,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1689845134] [2022-07-13 11:41:08,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:41:08,621 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:41:08,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:41:08,622 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-13 11:41:08,623 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-13 11:41:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:41:09,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 11:41:09,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:41:09,234 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-13 11:41:09,234 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:41:09,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:41:09,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1689845134] [2022-07-13 11:41:09,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1689845134] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:41:09,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:41:09,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:41:09,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057942969] [2022-07-13 11:41:09,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:41:09,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:41:09,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:41:09,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:41:09,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:41:09,236 INFO L87 Difference]: Start difference. First operand 749 states and 1120 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:41:09,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:41:09,634 INFO L93 Difference]: Finished difference Result 1486 states and 2233 transitions. [2022-07-13 11:41:09,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:41:09,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2022-07-13 11:41:09,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:41:09,637 INFO L225 Difference]: With dead ends: 1486 [2022-07-13 11:41:09,637 INFO L226 Difference]: Without dead ends: 871 [2022-07-13 11:41:09,638 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-13 11:41:09,638 INFO L413 NwaCegarLoop]: 380 mSDtfsCounter, 149 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:41:09,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 569 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 11:41:09,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2022-07-13 11:41:09,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 871. [2022-07-13 11:41:09,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 870 states have (on average 1.4954022988505746) internal successors, (1301), 870 states have internal predecessors, (1301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:41:09,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1301 transitions. [2022-07-13 11:41:09,651 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1301 transitions. Word has length 129 [2022-07-13 11:41:09,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:41:09,651 INFO L495 AbstractCegarLoop]: Abstraction has 871 states and 1301 transitions. [2022-07-13 11:41:09,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:41:09,652 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1301 transitions. [2022-07-13 11:41:09,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-07-13 11:41:09,653 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:41:09,653 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2022-07-13 11:41:09,675 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-13 11:41:09,867 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-13 11:41:09,867 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:41:09,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:41:09,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1815233301, now seen corresponding path program 1 times [2022-07-13 11:41:09,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:41:09,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [644160274] [2022-07-13 11:41:09,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:41:09,869 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:41:09,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:41:09,870 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-13 11:41:09,871 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-13 11:41:10,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:41:10,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 11:41:10,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:41:10,533 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-07-13 11:41:10,533 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:41:10,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:41:10,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [644160274] [2022-07-13 11:41:10,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [644160274] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:41:10,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:41:10,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:41:10,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011193994] [2022-07-13 11:41:10,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:41:10,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:41:10,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:41:10,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:41:10,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:41:10,534 INFO L87 Difference]: Start difference. First operand 871 states and 1301 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:41:11,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:41:11,155 INFO L93 Difference]: Finished difference Result 1732 states and 2597 transitions. [2022-07-13 11:41:11,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:41:11,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2022-07-13 11:41:11,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:41:11,158 INFO L225 Difference]: With dead ends: 1732 [2022-07-13 11:41:11,159 INFO L226 Difference]: Without dead ends: 995 [2022-07-13 11:41:11,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 158 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-13 11:41:11,161 INFO L413 NwaCegarLoop]: 384 mSDtfsCounter, 151 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 11:41:11,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 573 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 11:41:11,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2022-07-13 11:41:11,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 995. [2022-07-13 11:41:11,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 994 states have (on average 1.4939637826961771) internal successors, (1485), 994 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:41:11,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1485 transitions. [2022-07-13 11:41:11,207 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1485 transitions. Word has length 160 [2022-07-13 11:41:11,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:41:11,208 INFO L495 AbstractCegarLoop]: Abstraction has 995 states and 1485 transitions. [2022-07-13 11:41:11,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:41:11,208 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1485 transitions. [2022-07-13 11:41:11,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-13 11:41:11,210 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:41:11,210 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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] [2022-07-13 11:41:11,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-07-13 11:41:11,426 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-13 11:41:11,426 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:41:11,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:41:11,428 INFO L85 PathProgramCache]: Analyzing trace with hash -2092203957, now seen corresponding path program 1 times [2022-07-13 11:41:11,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:41:11,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1637586065] [2022-07-13 11:41:11,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:41:11,429 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:41:11,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:41:11,431 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-13 11:41:11,432 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-13 11:41:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:41:12,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 1052 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-13 11:41:12,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:41:12,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 11:41:12,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 11:41:13,183 INFO L356 Elim1Store]: treesize reduction 1496, result has 4.7 percent of original size [2022-07-13 11:41:13,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 78 treesize of output 85 [2022-07-13 11:41:13,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 36 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 85 [2022-07-13 11:41:13,344 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-13 11:41:13,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 49 [2022-07-13 11:41:13,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:13,369 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 49 [2022-07-13 11:41:13,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-13 11:41:13,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-13 11:41:13,402 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2022-07-13 11:41:13,403 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:41:13,403 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:41:13,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1637586065] [2022-07-13 11:41:13,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1637586065] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:41:13,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:41:13,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:41:13,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151988521] [2022-07-13 11:41:13,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:41:13,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:41:13,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:41:13,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:41:13,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:41:13,404 INFO L87 Difference]: Start difference. First operand 995 states and 1485 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:41:15,423 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-13 11:41:17,429 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-13 11:41:25,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:41:25,602 INFO L93 Difference]: Finished difference Result 1987 states and 2966 transitions. [2022-07-13 11:41:25,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:41:25,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 174 [2022-07-13 11:41:25,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:41:25,607 INFO L225 Difference]: With dead ends: 1987 [2022-07-13 11:41:25,607 INFO L226 Difference]: Without dead ends: 995 [2022-07-13 11:41:25,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:41:25,609 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 7 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:41:25,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 671 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 2 Unknown, 0 Unchecked, 12.1s Time] [2022-07-13 11:41:25,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2022-07-13 11:41:25,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 995. [2022-07-13 11:41:25,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 994 states have (on average 1.4929577464788732) internal successors, (1484), 994 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:41:25,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1484 transitions. [2022-07-13 11:41:25,622 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1484 transitions. Word has length 174 [2022-07-13 11:41:25,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:41:25,622 INFO L495 AbstractCegarLoop]: Abstraction has 995 states and 1484 transitions. [2022-07-13 11:41:25,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:41:25,622 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1484 transitions. [2022-07-13 11:41:25,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-13 11:41:25,624 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:41:25,624 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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] [2022-07-13 11:41:25,647 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-13 11:41:25,845 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-13 11:41:25,845 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:41:25,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:41:25,846 INFO L85 PathProgramCache]: Analyzing trace with hash 834302729, now seen corresponding path program 1 times [2022-07-13 11:41:25,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:41:25,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [726082425] [2022-07-13 11:41:25,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:41:25,847 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:41:25,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:41:25,848 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-13 11:41:25,850 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-13 11:41:27,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:41:27,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 1070 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 11:41:27,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:41:27,449 INFO L356 Elim1Store]: treesize reduction 180, result has 14.3 percent of original size [2022-07-13 11:41:27,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 39 [2022-07-13 11:41:27,550 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-13 11:41:27,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 51 [2022-07-13 11:41:27,612 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 11:41:27,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 15 [2022-07-13 11:41:27,649 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-07-13 11:41:27,650 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:41:27,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:41:27,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [726082425] [2022-07-13 11:41:27,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [726082425] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:41:27,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:41:27,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:41:27,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105956948] [2022-07-13 11:41:27,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:41:27,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:41:27,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:41:27,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:41:27,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:41:27,651 INFO L87 Difference]: Start difference. First operand 995 states and 1484 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:41:29,667 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-13 11:41:35,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:41:35,363 INFO L93 Difference]: Finished difference Result 2352 states and 3512 transitions. [2022-07-13 11:41:35,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:41:35,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 174 [2022-07-13 11:41:35,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:41:35,368 INFO L225 Difference]: With dead ends: 2352 [2022-07-13 11:41:35,368 INFO L226 Difference]: Without dead ends: 1367 [2022-07-13 11:41:35,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:41:35,369 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 36 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-07-13 11:41:35,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 590 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 139 Invalid, 1 Unknown, 41 Unchecked, 7.7s Time] [2022-07-13 11:41:35,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2022-07-13 11:41:35,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1202. [2022-07-13 11:41:35,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 1201 states have (on average 1.52789342214821) internal successors, (1835), 1201 states have internal predecessors, (1835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:41:35,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1835 transitions. [2022-07-13 11:41:35,390 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1835 transitions. Word has length 174 [2022-07-13 11:41:35,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:41:35,390 INFO L495 AbstractCegarLoop]: Abstraction has 1202 states and 1835 transitions. [2022-07-13 11:41:35,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:41:35,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1835 transitions. [2022-07-13 11:41:35,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-13 11:41:35,392 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:41:35,392 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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] [2022-07-13 11:41:35,418 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-13 11:41:35,607 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-13 11:41:35,607 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:41:35,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:41:35,608 INFO L85 PathProgramCache]: Analyzing trace with hash 289430155, now seen corresponding path program 1 times [2022-07-13 11:41:35,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:41:35,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [717214373] [2022-07-13 11:41:35,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:41:35,609 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:41:35,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:41:35,610 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-13 11:41:35,616 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-13 11:41:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:41:37,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 1070 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 11:41:37,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:41:37,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:37,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:37,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:37,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:37,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:41:37,252 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:41:37,477 INFO L356 Elim1Store]: treesize reduction 1109, result has 5.5 percent of original size [2022-07-13 11:41:37,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 52 treesize of output 73 [2022-07-13 11:41:37,803 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 11:41:37,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 22 [2022-07-13 11:41:37,857 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-13 11:41:37,858 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:41:37,858 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:41:37,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [717214373] [2022-07-13 11:41:37,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [717214373] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:41:37,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:41:37,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:41:37,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092612157] [2022-07-13 11:41:37,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:41:37,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:41:37,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:41:37,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:41:37,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:41:37,861 INFO L87 Difference]: Start difference. First operand 1202 states and 1835 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:41:39,879 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-13 11:41:46,385 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:41:49,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:41:49,180 INFO L93 Difference]: Finished difference Result 2902 states and 4439 transitions. [2022-07-13 11:41:49,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:41:49,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 174 [2022-07-13 11:41:49,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:41:49,191 INFO L225 Difference]: With dead ends: 2902 [2022-07-13 11:41:49,191 INFO L226 Difference]: Without dead ends: 1710 [2022-07-13 11:41:49,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:41:49,192 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 56 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:41:49,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 617 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 221 Invalid, 1 Unknown, 0 Unchecked, 11.3s Time] [2022-07-13 11:41:49,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2022-07-13 11:41:49,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 1426. [2022-07-13 11:41:49,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1425 states have (on average 1.568421052631579) internal successors, (2235), 1425 states have internal predecessors, (2235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:41:49,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 2235 transitions. [2022-07-13 11:41:49,226 INFO L78 Accepts]: Start accepts. Automaton has 1426 states and 2235 transitions. Word has length 174 [2022-07-13 11:41:49,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:41:49,226 INFO L495 AbstractCegarLoop]: Abstraction has 1426 states and 2235 transitions. [2022-07-13 11:41:49,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:41:49,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 2235 transitions. [2022-07-13 11:41:49,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-07-13 11:41:49,229 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:41:49,229 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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] [2022-07-13 11:41:49,256 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-13 11:41:49,447 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-13 11:41:49,447 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:41:49,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:41:49,448 INFO L85 PathProgramCache]: Analyzing trace with hash -975340285, now seen corresponding path program 1 times [2022-07-13 11:41:49,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:41:49,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1305569766] [2022-07-13 11:41:49,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:41:49,449 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:41:49,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:41:49,450 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-13 11:41:49,450 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-13 11:41:50,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:41:50,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 1165 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 11:41:50,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:41:51,172 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-13 11:41:51,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-13 11:41:51,202 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 11:41:51,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-13 11:41:51,219 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-07-13 11:41:51,220 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:41:51,220 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:41:51,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1305569766] [2022-07-13 11:41:51,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1305569766] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:41:51,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:41:51,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:41:51,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792817921] [2022-07-13 11:41:51,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:41:51,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:41:51,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:41:51,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:41:51,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:41:51,222 INFO L87 Difference]: Start difference. First operand 1426 states and 2235 transitions. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:41:53,243 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:41:57,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:41:57,816 INFO L93 Difference]: Finished difference Result 2930 states and 4569 transitions. [2022-07-13 11:41:57,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:41:57,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 187 [2022-07-13 11:41:57,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:41:57,821 INFO L225 Difference]: With dead ends: 2930 [2022-07-13 11:41:57,821 INFO L226 Difference]: Without dead ends: 1514 [2022-07-13 11:41:57,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:41:57,823 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 22 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-07-13 11:41:57,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 565 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 118 Invalid, 1 Unknown, 22 Unchecked, 6.6s Time] [2022-07-13 11:41:57,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2022-07-13 11:41:57,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1426. [2022-07-13 11:41:57,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1425 states have (on average 1.5628070175438598) internal successors, (2227), 1425 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:41:57,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 2227 transitions. [2022-07-13 11:41:57,847 INFO L78 Accepts]: Start accepts. Automaton has 1426 states and 2227 transitions. Word has length 187 [2022-07-13 11:41:57,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:41:57,847 INFO L495 AbstractCegarLoop]: Abstraction has 1426 states and 2227 transitions. [2022-07-13 11:41:57,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:41:57,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 2227 transitions. [2022-07-13 11:41:57,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-07-13 11:41:57,850 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:41:57,850 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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] [2022-07-13 11:41:57,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-13 11:41:58,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:41:58,066 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:41:58,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:41:58,066 INFO L85 PathProgramCache]: Analyzing trace with hash 988941552, now seen corresponding path program 1 times [2022-07-13 11:41:58,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:41:58,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1582154463] [2022-07-13 11:41:58,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:41:58,067 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:41:58,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:41:58,068 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:41:58,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-13 11:41:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:41:59,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 1200 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 11:41:59,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:42:00,076 INFO L356 Elim1Store]: treesize reduction 1101, result has 5.5 percent of original size [2022-07-13 11:42:00,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-13 11:42:00,103 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 11:42:00,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-13 11:42:00,116 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-07-13 11:42:00,116 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:42:00,116 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:42:00,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1582154463] [2022-07-13 11:42:00,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1582154463] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:00,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:00,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:00,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605045512] [2022-07-13 11:42:00,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:00,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:00,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:42:00,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:00,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:00,117 INFO L87 Difference]: Start difference. First operand 1426 states and 2227 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:02,132 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-13 11:42:03,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:03,430 INFO L93 Difference]: Finished difference Result 2930 states and 4577 transitions. [2022-07-13 11:42:03,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:03,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 188 [2022-07-13 11:42:03,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:03,447 INFO L225 Difference]: With dead ends: 2930 [2022-07-13 11:42:03,447 INFO L226 Difference]: Without dead ends: 1514 [2022-07-13 11:42:03,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:03,449 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 19 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 22 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:03,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 498 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 87 Invalid, 1 Unknown, 15 Unchecked, 3.3s Time] [2022-07-13 11:42:03,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2022-07-13 11:42:03,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1514. [2022-07-13 11:42:03,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1513 states have (on average 1.5459352280237937) internal successors, (2339), 1513 states have internal predecessors, (2339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:03,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 2339 transitions. [2022-07-13 11:42:03,492 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 2339 transitions. Word has length 188 [2022-07-13 11:42:03,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:03,493 INFO L495 AbstractCegarLoop]: Abstraction has 1514 states and 2339 transitions. [2022-07-13 11:42:03,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:03,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2339 transitions. [2022-07-13 11:42:03,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-07-13 11:42:03,496 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:03,497 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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] [2022-07-13 11:42:03,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-13 11:42:03,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:42:03,711 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:03,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:03,712 INFO L85 PathProgramCache]: Analyzing trace with hash -617202468, now seen corresponding path program 1 times [2022-07-13 11:42:03,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:42:03,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1448189197] [2022-07-13 11:42:03,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:03,713 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:42:03,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:42:03,714 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:42:03,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-13 11:42:05,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:05,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 1184 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 11:42:05,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:42:05,645 INFO L356 Elim1Store]: treesize reduction 1101, result has 5.5 percent of original size [2022-07-13 11:42:05,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-13 11:42:05,675 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 11:42:05,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-13 11:42:05,693 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-07-13 11:42:05,693 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:42:05,693 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:42:05,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1448189197] [2022-07-13 11:42:05,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1448189197] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:05,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:05,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:05,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873443800] [2022-07-13 11:42:05,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:05,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:05,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:42:05,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:05,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:05,694 INFO L87 Difference]: Start difference. First operand 1514 states and 2339 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:07,730 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:42:08,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:08,995 INFO L93 Difference]: Finished difference Result 3026 states and 4681 transitions. [2022-07-13 11:42:08,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:08,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 188 [2022-07-13 11:42:08,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:09,001 INFO L225 Difference]: With dead ends: 3026 [2022-07-13 11:42:09,001 INFO L226 Difference]: Without dead ends: 1522 [2022-07-13 11:42:09,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:09,002 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 19 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 22 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:09,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 492 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 88 Invalid, 1 Unknown, 16 Unchecked, 3.3s Time] [2022-07-13 11:42:09,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2022-07-13 11:42:09,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1522. [2022-07-13 11:42:09,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1522 states, 1521 states have (on average 1.532544378698225) internal successors, (2331), 1521 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:09,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1522 states and 2331 transitions. [2022-07-13 11:42:09,029 INFO L78 Accepts]: Start accepts. Automaton has 1522 states and 2331 transitions. Word has length 188 [2022-07-13 11:42:09,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:09,029 INFO L495 AbstractCegarLoop]: Abstraction has 1522 states and 2331 transitions. [2022-07-13 11:42:09,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:09,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 2331 transitions. [2022-07-13 11:42:09,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-07-13 11:42:09,032 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:09,032 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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] [2022-07-13 11:42:09,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-07-13 11:42:09,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:42:09,247 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:09,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:09,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1565412453, now seen corresponding path program 1 times [2022-07-13 11:42:09,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:42:09,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1776399220] [2022-07-13 11:42:09,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:09,249 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:42:09,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:42:09,250 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:42:09,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-13 11:42:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:10,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 1111 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 11:42:10,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:42:11,129 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-13 11:42:11,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-13 11:42:11,169 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 11:42:11,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-13 11:42:11,181 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-07-13 11:42:11,182 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:42:11,182 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:42:11,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1776399220] [2022-07-13 11:42:11,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1776399220] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:11,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:11,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:11,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291569641] [2022-07-13 11:42:11,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:11,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:11,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:42:11,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:11,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:11,183 INFO L87 Difference]: Start difference. First operand 1522 states and 2331 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:13,197 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-13 11:42:18,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:18,558 INFO L93 Difference]: Finished difference Result 3130 states and 4769 transitions. [2022-07-13 11:42:18,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:18,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 188 [2022-07-13 11:42:18,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:18,564 INFO L225 Difference]: With dead ends: 3130 [2022-07-13 11:42:18,564 INFO L226 Difference]: Without dead ends: 1618 [2022-07-13 11:42:18,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:18,566 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 21 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:18,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 563 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 122 Invalid, 1 Unknown, 26 Unchecked, 7.3s Time] [2022-07-13 11:42:18,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2022-07-13 11:42:18,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1522. [2022-07-13 11:42:18,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1522 states, 1521 states have (on average 1.527284681130835) internal successors, (2323), 1521 states have internal predecessors, (2323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:18,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1522 states and 2323 transitions. [2022-07-13 11:42:18,597 INFO L78 Accepts]: Start accepts. Automaton has 1522 states and 2323 transitions. Word has length 188 [2022-07-13 11:42:18,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:18,597 INFO L495 AbstractCegarLoop]: Abstraction has 1522 states and 2323 transitions. [2022-07-13 11:42:18,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:18,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 2323 transitions. [2022-07-13 11:42:18,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-07-13 11:42:18,600 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:18,600 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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] [2022-07-13 11:42:18,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-13 11:42:18,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:42:18,815 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:18,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:18,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1437107291, now seen corresponding path program 1 times [2022-07-13 11:42:18,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:42:18,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231920989] [2022-07-13 11:42:18,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:18,817 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:42:18,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:42:18,818 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:42:18,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-13 11:42:20,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:20,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 1167 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 11:42:20,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:42:20,768 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-13 11:42:20,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-13 11:42:20,802 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 11:42:20,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-13 11:42:20,813 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-07-13 11:42:20,813 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:42:20,813 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:42:20,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231920989] [2022-07-13 11:42:20,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1231920989] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:20,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:20,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:20,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059499012] [2022-07-13 11:42:20,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:20,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:20,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:42:20,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:20,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:20,814 INFO L87 Difference]: Start difference. First operand 1522 states and 2323 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:22,829 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-13 11:42:27,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:27,047 INFO L93 Difference]: Finished difference Result 3114 states and 4737 transitions. [2022-07-13 11:42:27,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:27,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 188 [2022-07-13 11:42:27,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:27,061 INFO L225 Difference]: With dead ends: 3114 [2022-07-13 11:42:27,061 INFO L226 Difference]: Without dead ends: 1602 [2022-07-13 11:42:27,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:27,063 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 20 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:27,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 561 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 118 Invalid, 1 Unknown, 24 Unchecked, 6.2s Time] [2022-07-13 11:42:27,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2022-07-13 11:42:27,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1522. [2022-07-13 11:42:27,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1522 states, 1521 states have (on average 1.5220249835634452) internal successors, (2315), 1521 states have internal predecessors, (2315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:27,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1522 states and 2315 transitions. [2022-07-13 11:42:27,089 INFO L78 Accepts]: Start accepts. Automaton has 1522 states and 2315 transitions. Word has length 188 [2022-07-13 11:42:27,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:27,089 INFO L495 AbstractCegarLoop]: Abstraction has 1522 states and 2315 transitions. [2022-07-13 11:42:27,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:27,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 2315 transitions. [2022-07-13 11:42:27,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-07-13 11:42:27,092 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:27,092 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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] [2022-07-13 11:42:27,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-13 11:42:27,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:42:27,319 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:27,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:27,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1627778118, now seen corresponding path program 1 times [2022-07-13 11:42:27,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:42:27,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [122340445] [2022-07-13 11:42:27,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:27,320 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:42:27,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:42:27,321 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:42:27,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-13 11:42:29,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:29,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 1186 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 11:42:29,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:42:29,385 INFO L356 Elim1Store]: treesize reduction 1101, result has 5.5 percent of original size [2022-07-13 11:42:29,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-13 11:42:29,408 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 11:42:29,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-13 11:42:29,420 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-07-13 11:42:29,420 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:42:29,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:42:29,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [122340445] [2022-07-13 11:42:29,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [122340445] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:29,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:29,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:29,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192030670] [2022-07-13 11:42:29,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:29,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:29,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:42:29,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:29,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:29,422 INFO L87 Difference]: Start difference. First operand 1522 states and 2315 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:31,436 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-13 11:42:32,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:32,799 INFO L93 Difference]: Finished difference Result 3042 states and 4633 transitions. [2022-07-13 11:42:32,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:32,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 189 [2022-07-13 11:42:32,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:32,803 INFO L225 Difference]: With dead ends: 3042 [2022-07-13 11:42:32,803 INFO L226 Difference]: Without dead ends: 1530 [2022-07-13 11:42:32,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:32,805 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 19 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 22 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:32,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 490 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 89 Invalid, 1 Unknown, 17 Unchecked, 3.3s Time] [2022-07-13 11:42:32,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2022-07-13 11:42:32,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 1530. [2022-07-13 11:42:32,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1530 states, 1529 states have (on average 1.5088293001962068) internal successors, (2307), 1529 states have internal predecessors, (2307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:32,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1530 states and 2307 transitions. [2022-07-13 11:42:32,840 INFO L78 Accepts]: Start accepts. Automaton has 1530 states and 2307 transitions. Word has length 189 [2022-07-13 11:42:32,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:32,841 INFO L495 AbstractCegarLoop]: Abstraction has 1530 states and 2307 transitions. [2022-07-13 11:42:32,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:32,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 2307 transitions. [2022-07-13 11:42:32,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-07-13 11:42:32,843 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:32,843 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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] [2022-07-13 11:42:32,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-13 11:42:33,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:42:33,055 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:33,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:33,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1146228617, now seen corresponding path program 1 times [2022-07-13 11:42:33,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:42:33,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [250829971] [2022-07-13 11:42:33,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:33,057 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:42:33,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:42:33,058 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:42:33,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-13 11:42:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:34,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 1188 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 11:42:34,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:42:35,186 INFO L356 Elim1Store]: treesize reduction 1101, result has 5.5 percent of original size [2022-07-13 11:42:35,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-13 11:42:35,213 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 11:42:35,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-13 11:42:35,227 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-07-13 11:42:35,228 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:42:35,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:42:35,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [250829971] [2022-07-13 11:42:35,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [250829971] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:35,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:35,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:35,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677476825] [2022-07-13 11:42:35,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:35,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:35,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:42:35,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:35,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:35,229 INFO L87 Difference]: Start difference. First operand 1530 states and 2307 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:37,251 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-13 11:42:38,632 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:42:39,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:39,916 INFO L93 Difference]: Finished difference Result 3058 states and 4617 transitions. [2022-07-13 11:42:39,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:39,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 190 [2022-07-13 11:42:39,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:39,929 INFO L225 Difference]: With dead ends: 3058 [2022-07-13 11:42:39,929 INFO L226 Difference]: Without dead ends: 1538 [2022-07-13 11:42:39,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:39,930 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 19 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 22 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:39,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 488 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 90 Invalid, 1 Unknown, 18 Unchecked, 4.7s Time] [2022-07-13 11:42:39,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2022-07-13 11:42:39,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1538. [2022-07-13 11:42:39,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1538 states, 1537 states have (on average 1.4957709824333116) internal successors, (2299), 1537 states have internal predecessors, (2299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:39,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 2299 transitions. [2022-07-13 11:42:39,959 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 2299 transitions. Word has length 190 [2022-07-13 11:42:39,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:39,960 INFO L495 AbstractCegarLoop]: Abstraction has 1538 states and 2299 transitions. [2022-07-13 11:42:39,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:39,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 2299 transitions. [2022-07-13 11:42:39,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-07-13 11:42:39,962 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:39,962 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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] [2022-07-13 11:42:39,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-13 11:42:40,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:42:40,176 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:40,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:40,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1653439691, now seen corresponding path program 1 times [2022-07-13 11:42:40,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:42:40,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1835467211] [2022-07-13 11:42:40,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:40,177 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:42:40,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:42:40,178 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:42:40,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-13 11:42:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:41,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 1190 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 11:42:41,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:42:42,139 INFO L356 Elim1Store]: treesize reduction 1101, result has 5.5 percent of original size [2022-07-13 11:42:42,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-13 11:42:42,170 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 11:42:42,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-13 11:42:42,182 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-07-13 11:42:42,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:42:42,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:42:42,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1835467211] [2022-07-13 11:42:42,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1835467211] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:42,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:42,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:42,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940502415] [2022-07-13 11:42:42,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:42,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:42,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:42:42,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:42,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:42,185 INFO L87 Difference]: Start difference. First operand 1538 states and 2299 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:44,203 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:42:45,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:45,492 INFO L93 Difference]: Finished difference Result 3074 states and 4601 transitions. [2022-07-13 11:42:45,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:45,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 191 [2022-07-13 11:42:45,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:45,497 INFO L225 Difference]: With dead ends: 3074 [2022-07-13 11:42:45,497 INFO L226 Difference]: Without dead ends: 1546 [2022-07-13 11:42:45,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:45,498 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 19 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 22 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:45,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 486 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 91 Invalid, 1 Unknown, 19 Unchecked, 3.3s Time] [2022-07-13 11:42:45,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2022-07-13 11:42:45,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1546. [2022-07-13 11:42:45,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1545 states have (on average 1.4828478964401295) internal successors, (2291), 1545 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:45,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2291 transitions. [2022-07-13 11:42:45,540 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2291 transitions. Word has length 191 [2022-07-13 11:42:45,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:45,541 INFO L495 AbstractCegarLoop]: Abstraction has 1546 states and 2291 transitions. [2022-07-13 11:42:45,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:45,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2291 transitions. [2022-07-13 11:42:45,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-07-13 11:42:45,543 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:45,543 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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] [2022-07-13 11:42:45,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-13 11:42:45,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:42:45,758 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:45,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:45,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1981897227, now seen corresponding path program 1 times [2022-07-13 11:42:45,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:42:45,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [192789676] [2022-07-13 11:42:45,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:45,760 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:42:45,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:42:45,761 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:42:45,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-13 11:42:47,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:47,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 1151 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 11:42:47,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:42:47,705 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-13 11:42:47,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-13 11:42:47,744 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 11:42:47,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-13 11:42:47,764 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-07-13 11:42:47,765 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:42:47,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:42:47,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [192789676] [2022-07-13 11:42:47,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [192789676] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:47,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:47,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:47,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669376121] [2022-07-13 11:42:47,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:47,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:47,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:42:47,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:47,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:47,767 INFO L87 Difference]: Start difference. First operand 1546 states and 2291 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:49,783 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-13 11:42:52,545 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:42:53,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:53,958 INFO L93 Difference]: Finished difference Result 2891 states and 4286 transitions. [2022-07-13 11:42:53,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:53,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 191 [2022-07-13 11:42:53,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:53,963 INFO L225 Difference]: With dead ends: 2891 [2022-07-13 11:42:53,963 INFO L226 Difference]: Without dead ends: 1546 [2022-07-13 11:42:53,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:53,964 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 10 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:53,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 543 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 1 Unknown, 19 Unchecked, 6.2s Time] [2022-07-13 11:42:53,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2022-07-13 11:42:53,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1546. [2022-07-13 11:42:53,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1545 states have (on average 1.4776699029126215) internal successors, (2283), 1545 states have internal predecessors, (2283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:53,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2283 transitions. [2022-07-13 11:42:53,986 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2283 transitions. Word has length 191 [2022-07-13 11:42:53,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:53,986 INFO L495 AbstractCegarLoop]: Abstraction has 1546 states and 2283 transitions. [2022-07-13 11:42:53,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:53,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2283 transitions. [2022-07-13 11:42:53,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-07-13 11:42:53,988 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:53,988 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 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] [2022-07-13 11:42:54,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-13 11:42:54,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:42:54,211 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:54,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:54,212 INFO L85 PathProgramCache]: Analyzing trace with hash 468579752, now seen corresponding path program 1 times [2022-07-13 11:42:54,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:42:54,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1009139757] [2022-07-13 11:42:54,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:54,213 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:42:54,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:42:54,213 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:42:54,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-13 11:42:55,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:55,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 1153 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 11:42:55,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:42:56,194 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-13 11:42:56,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-13 11:42:56,236 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 11:42:56,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-13 11:42:56,250 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-07-13 11:42:56,250 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:42:56,250 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:42:56,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1009139757] [2022-07-13 11:42:56,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1009139757] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:56,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:56,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:56,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292536723] [2022-07-13 11:42:56,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:56,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:56,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:42:56,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:56,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:56,251 INFO L87 Difference]: Start difference. First operand 1546 states and 2283 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)