./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 35987657 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-?-3598765 [2022-07-20 22:38:54,612 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 22:38:54,615 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 22:38:54,657 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 22:38:54,658 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 22:38:54,659 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 22:38:54,662 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 22:38:54,665 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 22:38:54,667 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 22:38:54,671 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 22:38:54,672 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 22:38:54,677 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 22:38:54,677 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 22:38:54,679 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 22:38:54,679 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 22:38:54,680 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 22:38:54,681 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 22:38:54,681 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 22:38:54,682 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 22:38:54,684 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 22:38:54,685 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 22:38:54,685 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 22:38:54,686 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 22:38:54,687 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 22:38:54,688 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 22:38:54,690 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 22:38:54,690 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 22:38:54,691 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 22:38:54,691 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 22:38:54,692 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 22:38:54,692 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 22:38:54,693 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 22:38:54,693 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 22:38:54,694 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 22:38:54,695 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 22:38:54,695 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 22:38:54,696 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 22:38:54,696 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 22:38:54,697 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 22:38:54,697 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 22:38:54,698 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 22:38:54,698 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 22:38:54,701 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-20 22:38:54,733 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 22:38:54,733 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 22:38:54,734 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 22:38:54,734 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 22:38:54,734 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 22:38:54,735 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 22:38:54,735 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 22:38:54,736 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 22:38:54,736 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 22:38:54,737 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 22:38:54,737 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 22:38:54,737 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 22:38:54,737 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 22:38:54,737 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 22:38:54,738 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 22:38:54,738 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 22:38:54,738 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 22:38:54,738 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 22:38:54,738 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 22:38:54,738 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 22:38:54,739 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 22:38:54,739 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 22:38:54,739 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 22:38:54,739 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 22:38:54,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 22:38:54,740 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 22:38:54,740 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 22:38:54,740 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 22:38:54,740 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 22:38:54,741 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 22:38:54,741 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 22:38:54,741 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 22:38:54,741 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 22:38:54,741 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-20 22:38:55,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 22:38:55,069 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 22:38:55,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 22:38:55,073 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 22:38:55,073 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 22:38:55,074 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-20 22:38:55,133 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/012c75a8d/199872daa6a245a88f923204ffc3ddcf/FLAGedb86ac28 [2022-07-20 22:38:55,663 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 22:38:55,667 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.09.i.cil-1.c [2022-07-20 22:38:55,689 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/012c75a8d/199872daa6a245a88f923204ffc3ddcf/FLAGedb86ac28 [2022-07-20 22:38:55,949 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/012c75a8d/199872daa6a245a88f923204ffc3ddcf [2022-07-20 22:38:55,951 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 22:38:55,953 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 22:38:55,955 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 22:38:55,955 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 22:38:55,958 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 22:38:55,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:38:55" (1/1) ... [2022-07-20 22:38:55,959 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57d934bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:38:55, skipping insertion in model container [2022-07-20 22:38:55,959 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:38:55" (1/1) ... [2022-07-20 22:38:55,965 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 22:38:56,030 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 22:38:56,316 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-20 22:38:56,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 22:38:56,335 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 22:38:56,513 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-20 22:38:56,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 22:38:56,546 INFO L208 MainTranslator]: Completed translation [2022-07-20 22:38:56,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:38:56 WrapperNode [2022-07-20 22:38:56,547 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 22:38:56,548 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 22:38:56,548 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 22:38:56,548 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 22:38:56,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:38:56" (1/1) ... [2022-07-20 22:38:56,588 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:38:56" (1/1) ... [2022-07-20 22:38:56,649 INFO L137 Inliner]: procedures = 31, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 792 [2022-07-20 22:38:56,653 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 22:38:56,654 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 22:38:56,654 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 22:38:56,655 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 22:38:56,662 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:38:56" (1/1) ... [2022-07-20 22:38:56,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:38:56" (1/1) ... [2022-07-20 22:38:56,683 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:38:56" (1/1) ... [2022-07-20 22:38:56,686 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:38:56" (1/1) ... [2022-07-20 22:38:56,733 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:38:56" (1/1) ... [2022-07-20 22:38:56,744 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:38:56" (1/1) ... [2022-07-20 22:38:56,755 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:38:56" (1/1) ... [2022-07-20 22:38:56,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 22:38:56,761 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 22:38:56,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 22:38:56,761 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 22:38:56,763 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:38:56" (1/1) ... [2022-07-20 22:38:56,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 22:38:56,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:38:56,791 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-20 22:38:56,793 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-20 22:38:56,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 22:38:56,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 22:38:56,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 22:38:56,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 22:38:56,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 22:38:56,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 22:38:56,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 22:38:56,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 22:38:56,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 22:38:56,955 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 22:38:56,962 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 22:38:56,993 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-20 22:38:58,099 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-20 22:38:58,099 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-20 22:38:58,099 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 22:38:58,106 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 22:38:58,106 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-20 22:38:58,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:38:58 BoogieIcfgContainer [2022-07-20 22:38:58,108 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 22:38:58,110 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 22:38:58,110 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 22:38:58,112 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 22:38:58,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 10:38:55" (1/3) ... [2022-07-20 22:38:58,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5969d8a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:38:58, skipping insertion in model container [2022-07-20 22:38:58,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:38:56" (2/3) ... [2022-07-20 22:38:58,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5969d8a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:38:58, skipping insertion in model container [2022-07-20 22:38:58,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:38:58" (3/3) ... [2022-07-20 22:38:58,115 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.09.i.cil-1.c [2022-07-20 22:38:58,127 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 22:38:58,128 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 22:38:58,171 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 22:38:58,176 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@7f462973, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@554ead06 [2022-07-20 22:38:58,177 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 22:38:58,189 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-20 22:38:58,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-20 22:38:58,198 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:38:58,200 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-20 22:38:58,200 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:38:58,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:38:58,205 INFO L85 PathProgramCache]: Analyzing trace with hash -442385418, now seen corresponding path program 1 times [2022-07-20 22:38:58,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:38:58,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91939864] [2022-07-20 22:38:58,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:38:58,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:38:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:38:58,675 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-20 22:38:58,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:38:58,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91939864] [2022-07-20 22:38:58,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91939864] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:38:58,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:38:58,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:38:58,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467266088] [2022-07-20 22:38:58,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:38:58,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:38:58,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:38:58,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:38:58,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:38:58,703 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-20 22:38:59,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:38:59,538 INFO L93 Difference]: Finished difference Result 421 states and 717 transitions. [2022-07-20 22:38:59,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:38:59,541 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-20 22:38:59,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:38:59,551 INFO L225 Difference]: With dead ends: 421 [2022-07-20 22:38:59,551 INFO L226 Difference]: Without dead ends: 256 [2022-07-20 22:38:59,554 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-20 22:38:59,557 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 169 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2022-07-20 22:38:59,558 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.8s Time] [2022-07-20 22:38:59,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-07-20 22:38:59,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 165. [2022-07-20 22:38:59,607 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-20 22:38:59,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 260 transitions. [2022-07-20 22:38:59,610 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 260 transitions. Word has length 37 [2022-07-20 22:38:59,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:38:59,610 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 260 transitions. [2022-07-20 22:38:59,611 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-20 22:38:59,611 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 260 transitions. [2022-07-20 22:38:59,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 22:38:59,612 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:38:59,613 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-20 22:38:59,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 22:38:59,613 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:38:59,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:38:59,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1559591930, now seen corresponding path program 1 times [2022-07-20 22:38:59,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:38:59,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124809848] [2022-07-20 22:38:59,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:38:59,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:38:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:38:59,780 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-20 22:38:59,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:38:59,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124809848] [2022-07-20 22:38:59,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124809848] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:38:59,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:38:59,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:38:59,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094390010] [2022-07-20 22:38:59,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:38:59,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:38:59,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:38:59,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:38:59,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:38:59,787 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-20 22:39:00,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:00,451 INFO L93 Difference]: Finished difference Result 348 states and 547 transitions. [2022-07-20 22:39:00,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:00,456 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-20 22:39:00,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:00,457 INFO L225 Difference]: With dead ends: 348 [2022-07-20 22:39:00,457 INFO L226 Difference]: Without dead ends: 193 [2022-07-20 22:39:00,458 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-20 22:39:00,459 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 22 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:00,460 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.6s Time] [2022-07-20 22:39:00,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-07-20 22:39:00,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 176. [2022-07-20 22:39:00,472 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-20 22:39:00,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 279 transitions. [2022-07-20 22:39:00,473 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 279 transitions. Word has length 38 [2022-07-20 22:39:00,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:00,473 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 279 transitions. [2022-07-20 22:39:00,473 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-20 22:39:00,474 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 279 transitions. [2022-07-20 22:39:00,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-20 22:39:00,475 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:00,475 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-20 22:39:00,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 22:39:00,476 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:00,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:00,476 INFO L85 PathProgramCache]: Analyzing trace with hash 103815440, now seen corresponding path program 1 times [2022-07-20 22:39:00,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:00,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670183877] [2022-07-20 22:39:00,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:00,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:00,595 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-20 22:39:00,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:00,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670183877] [2022-07-20 22:39:00,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670183877] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:00,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:00,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:00,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588461094] [2022-07-20 22:39:00,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:00,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:00,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:00,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:00,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:00,599 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-20 22:39:01,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:01,735 INFO L93 Difference]: Finished difference Result 478 states and 761 transitions. [2022-07-20 22:39:01,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:01,736 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-20 22:39:01,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:01,738 INFO L225 Difference]: With dead ends: 478 [2022-07-20 22:39:01,739 INFO L226 Difference]: Without dead ends: 323 [2022-07-20 22:39:01,739 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-20 22:39:01,741 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 147 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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, 1.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:01,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 620 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-20 22:39:01,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-07-20 22:39:01,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 208. [2022-07-20 22:39:01,755 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-20 22:39:01,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 330 transitions. [2022-07-20 22:39:01,756 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 330 transitions. Word has length 51 [2022-07-20 22:39:01,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:01,757 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 330 transitions. [2022-07-20 22:39:01,757 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-20 22:39:01,757 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 330 transitions. [2022-07-20 22:39:01,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-20 22:39:01,759 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:01,759 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-20 22:39:01,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 22:39:01,760 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:01,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:01,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1022264289, now seen corresponding path program 1 times [2022-07-20 22:39:01,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:01,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738429560] [2022-07-20 22:39:01,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:01,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:01,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:01,896 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-20 22:39:01,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:01,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738429560] [2022-07-20 22:39:01,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738429560] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:01,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:01,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:01,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988323272] [2022-07-20 22:39:01,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:01,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:01,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:01,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:01,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:01,899 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-20 22:39:03,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:03,034 INFO L93 Difference]: Finished difference Result 497 states and 786 transitions. [2022-07-20 22:39:03,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:03,035 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-20 22:39:03,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:03,037 INFO L225 Difference]: With dead ends: 497 [2022-07-20 22:39:03,037 INFO L226 Difference]: Without dead ends: 310 [2022-07-20 22:39:03,038 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-20 22:39:03,039 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 152 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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, 1.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:03,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 332 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-20 22:39:03,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-07-20 22:39:03,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 208. [2022-07-20 22:39:03,049 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-20 22:39:03,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 326 transitions. [2022-07-20 22:39:03,050 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 326 transitions. Word has length 52 [2022-07-20 22:39:03,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:03,051 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 326 transitions. [2022-07-20 22:39:03,051 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-20 22:39:03,051 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 326 transitions. [2022-07-20 22:39:03,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-20 22:39:03,053 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:03,053 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-20 22:39:03,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 22:39:03,053 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:03,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:03,054 INFO L85 PathProgramCache]: Analyzing trace with hash 40885771, now seen corresponding path program 1 times [2022-07-20 22:39:03,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:03,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640621897] [2022-07-20 22:39:03,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:03,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:03,151 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-20 22:39:03,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:03,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640621897] [2022-07-20 22:39:03,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640621897] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:03,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:03,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:03,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120115416] [2022-07-20 22:39:03,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:03,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:03,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:03,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:03,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:03,154 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-20 22:39:03,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:03,911 INFO L93 Difference]: Finished difference Result 411 states and 641 transitions. [2022-07-20 22:39:03,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:03,912 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-20 22:39:03,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:03,913 INFO L225 Difference]: With dead ends: 411 [2022-07-20 22:39:03,913 INFO L226 Difference]: Without dead ends: 224 [2022-07-20 22:39:03,913 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-20 22:39:03,914 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 26 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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-20 22:39:03,915 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-20 22:39:03,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-07-20 22:39:03,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 208. [2022-07-20 22:39:03,921 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-20 22:39:03,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 325 transitions. [2022-07-20 22:39:03,921 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 325 transitions. Word has length 52 [2022-07-20 22:39:03,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:03,922 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 325 transitions. [2022-07-20 22:39:03,922 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-20 22:39:03,922 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 325 transitions. [2022-07-20 22:39:03,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-20 22:39:03,931 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:03,931 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-20 22:39:03,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 22:39:03,932 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:03,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:03,933 INFO L85 PathProgramCache]: Analyzing trace with hash 861050644, now seen corresponding path program 1 times [2022-07-20 22:39:03,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:03,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521848575] [2022-07-20 22:39:03,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:03,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:04,040 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-20 22:39:04,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:04,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521848575] [2022-07-20 22:39:04,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521848575] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:04,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:04,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:04,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731178459] [2022-07-20 22:39:04,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:04,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:04,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:04,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:04,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:04,043 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-20 22:39:04,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:04,581 INFO L93 Difference]: Finished difference Result 410 states and 639 transitions. [2022-07-20 22:39:04,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:04,582 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-20 22:39:04,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:04,583 INFO L225 Difference]: With dead ends: 410 [2022-07-20 22:39:04,583 INFO L226 Difference]: Without dead ends: 223 [2022-07-20 22:39:04,583 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-20 22:39:04,584 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 19 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:04,584 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.5s Time] [2022-07-20 22:39:04,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-07-20 22:39:04,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 208. [2022-07-20 22:39:04,606 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-20 22:39:04,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 324 transitions. [2022-07-20 22:39:04,607 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 324 transitions. Word has length 52 [2022-07-20 22:39:04,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:04,608 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 324 transitions. [2022-07-20 22:39:04,608 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-20 22:39:04,608 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 324 transitions. [2022-07-20 22:39:04,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-20 22:39:04,609 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:04,610 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-20 22:39:04,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 22:39:04,610 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:04,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:04,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1296410196, now seen corresponding path program 1 times [2022-07-20 22:39:04,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:04,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457006042] [2022-07-20 22:39:04,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:04,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:04,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:04,732 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-20 22:39:04,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:04,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457006042] [2022-07-20 22:39:04,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457006042] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:04,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:04,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:04,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527055211] [2022-07-20 22:39:04,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:04,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:04,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:04,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:04,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:04,735 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-20 22:39:05,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:05,691 INFO L93 Difference]: Finished difference Result 497 states and 777 transitions. [2022-07-20 22:39:05,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:05,692 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-20 22:39:05,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:05,694 INFO L225 Difference]: With dead ends: 497 [2022-07-20 22:39:05,694 INFO L226 Difference]: Without dead ends: 310 [2022-07-20 22:39:05,694 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-20 22:39:05,695 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 145 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.9s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:05,695 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.9s Time] [2022-07-20 22:39:05,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-07-20 22:39:05,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 209. [2022-07-20 22:39:05,701 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-20 22:39:05,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 323 transitions. [2022-07-20 22:39:05,702 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 323 transitions. Word has length 52 [2022-07-20 22:39:05,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:05,702 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 323 transitions. [2022-07-20 22:39:05,703 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-20 22:39:05,703 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 323 transitions. [2022-07-20 22:39:05,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-20 22:39:05,709 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:05,710 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-20 22:39:05,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 22:39:05,710 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:05,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:05,711 INFO L85 PathProgramCache]: Analyzing trace with hash 585554567, now seen corresponding path program 1 times [2022-07-20 22:39:05,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:05,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587470679] [2022-07-20 22:39:05,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:05,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:05,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:05,858 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-20 22:39:05,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:05,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587470679] [2022-07-20 22:39:05,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587470679] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:05,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:05,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:05,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484203787] [2022-07-20 22:39:05,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:05,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:05,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:05,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:05,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:05,862 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-20 22:39:07,161 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 22:39:07,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:07,377 INFO L93 Difference]: Finished difference Result 410 states and 635 transitions. [2022-07-20 22:39:07,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:07,378 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-20 22:39:07,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:07,379 INFO L225 Difference]: With dead ends: 410 [2022-07-20 22:39:07,379 INFO L226 Difference]: Without dead ends: 222 [2022-07-20 22:39:07,380 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-20 22:39:07,380 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 22 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.5s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:07,380 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.5s Time] [2022-07-20 22:39:07,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-07-20 22:39:07,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 209. [2022-07-20 22:39:07,386 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-20 22:39:07,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 322 transitions. [2022-07-20 22:39:07,387 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 322 transitions. Word has length 53 [2022-07-20 22:39:07,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:07,387 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 322 transitions. [2022-07-20 22:39:07,387 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-20 22:39:07,388 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 322 transitions. [2022-07-20 22:39:07,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-20 22:39:07,388 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:07,389 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-20 22:39:07,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 22:39:07,389 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:07,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:07,390 INFO L85 PathProgramCache]: Analyzing trace with hash -991616538, now seen corresponding path program 1 times [2022-07-20 22:39:07,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:07,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331432128] [2022-07-20 22:39:07,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:07,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:07,502 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-20 22:39:07,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:07,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331432128] [2022-07-20 22:39:07,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331432128] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:07,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:07,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:07,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076733135] [2022-07-20 22:39:07,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:07,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:07,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:07,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:07,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:07,505 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-20 22:39:08,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:08,116 INFO L93 Difference]: Finished difference Result 498 states and 773 transitions. [2022-07-20 22:39:08,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:08,117 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-20 22:39:08,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:08,119 INFO L225 Difference]: With dead ends: 498 [2022-07-20 22:39:08,119 INFO L226 Difference]: Without dead ends: 310 [2022-07-20 22:39:08,119 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-20 22:39:08,120 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 147 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:08,120 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.6s Time] [2022-07-20 22:39:08,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-07-20 22:39:08,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 209. [2022-07-20 22:39:08,129 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-20 22:39:08,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 318 transitions. [2022-07-20 22:39:08,130 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 318 transitions. Word has length 54 [2022-07-20 22:39:08,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:08,130 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 318 transitions. [2022-07-20 22:39:08,130 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-20 22:39:08,130 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 318 transitions. [2022-07-20 22:39:08,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-20 22:39:08,131 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:08,132 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-20 22:39:08,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 22:39:08,132 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:08,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:08,133 INFO L85 PathProgramCache]: Analyzing trace with hash 373652162, now seen corresponding path program 1 times [2022-07-20 22:39:08,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:08,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749809213] [2022-07-20 22:39:08,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:08,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:08,261 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-20 22:39:08,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:08,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749809213] [2022-07-20 22:39:08,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749809213] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:08,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:08,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:08,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166730906] [2022-07-20 22:39:08,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:08,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:08,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:08,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:08,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:08,264 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-20 22:39:08,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:08,655 INFO L93 Difference]: Finished difference Result 400 states and 614 transitions. [2022-07-20 22:39:08,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:08,656 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-20 22:39:08,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:08,657 INFO L225 Difference]: With dead ends: 400 [2022-07-20 22:39:08,657 INFO L226 Difference]: Without dead ends: 212 [2022-07-20 22:39:08,658 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-20 22:39:08,658 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.4s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:08,658 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.4s Time] [2022-07-20 22:39:08,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-07-20 22:39:08,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 209. [2022-07-20 22:39:08,664 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-20 22:39:08,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 317 transitions. [2022-07-20 22:39:08,665 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 317 transitions. Word has length 55 [2022-07-20 22:39:08,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:08,665 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 317 transitions. [2022-07-20 22:39:08,665 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-20 22:39:08,665 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 317 transitions. [2022-07-20 22:39:08,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-20 22:39:08,666 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:08,666 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-20 22:39:08,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 22:39:08,666 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:08,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:08,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1312076378, now seen corresponding path program 1 times [2022-07-20 22:39:08,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:08,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260645435] [2022-07-20 22:39:08,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:08,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:08,757 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-20 22:39:08,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:08,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260645435] [2022-07-20 22:39:08,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260645435] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:08,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:08,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:08,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960292771] [2022-07-20 22:39:08,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:08,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:08,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:08,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:08,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:08,760 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-20 22:39:09,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:09,981 INFO L93 Difference]: Finished difference Result 437 states and 668 transitions. [2022-07-20 22:39:09,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:09,982 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-20 22:39:09,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:09,983 INFO L225 Difference]: With dead ends: 437 [2022-07-20 22:39:09,983 INFO L226 Difference]: Without dead ends: 249 [2022-07-20 22:39:09,984 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-20 22:39:09,984 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 30 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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, 1.2s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:09,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 497 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-20 22:39:09,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-07-20 22:39:09,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 231. [2022-07-20 22:39:09,990 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-20 22:39:09,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 351 transitions. [2022-07-20 22:39:09,996 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 351 transitions. Word has length 55 [2022-07-20 22:39:09,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:09,996 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 351 transitions. [2022-07-20 22:39:09,996 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-20 22:39:09,996 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 351 transitions. [2022-07-20 22:39:09,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-20 22:39:09,998 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:09,998 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-20 22:39:09,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 22:39:09,999 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:09,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:09,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1411411051, now seen corresponding path program 1 times [2022-07-20 22:39:09,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:09,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428188497] [2022-07-20 22:39:10,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:10,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:10,114 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-20 22:39:10,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:10,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428188497] [2022-07-20 22:39:10,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428188497] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:10,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:10,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:10,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278551219] [2022-07-20 22:39:10,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:10,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:10,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:10,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:10,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:10,117 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-20 22:39:11,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:11,099 INFO L93 Difference]: Finished difference Result 542 states and 833 transitions. [2022-07-20 22:39:11,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:11,100 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-20 22:39:11,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:11,102 INFO L225 Difference]: With dead ends: 542 [2022-07-20 22:39:11,102 INFO L226 Difference]: Without dead ends: 332 [2022-07-20 22:39:11,103 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-20 22:39:11,103 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 149 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 1.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:11,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 332 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-20 22:39:11,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2022-07-20 22:39:11,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 231. [2022-07-20 22:39:11,110 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-20 22:39:11,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 347 transitions. [2022-07-20 22:39:11,111 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 347 transitions. Word has length 69 [2022-07-20 22:39:11,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:11,111 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 347 transitions. [2022-07-20 22:39:11,112 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-20 22:39:11,112 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 347 transitions. [2022-07-20 22:39:11,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-20 22:39:11,112 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:11,113 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-20 22:39:11,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 22:39:11,113 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:11,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:11,114 INFO L85 PathProgramCache]: Analyzing trace with hash -2063391372, now seen corresponding path program 1 times [2022-07-20 22:39:11,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:11,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690919022] [2022-07-20 22:39:11,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:11,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:11,210 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-20 22:39:11,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:11,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690919022] [2022-07-20 22:39:11,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690919022] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:11,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:11,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:11,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220148639] [2022-07-20 22:39:11,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:11,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:11,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:11,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:11,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:11,212 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-20 22:39:12,670 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-20 22:39:13,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:13,014 INFO L93 Difference]: Finished difference Result 541 states and 824 transitions. [2022-07-20 22:39:13,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:13,014 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-20 22:39:13,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:13,016 INFO L225 Difference]: With dead ends: 541 [2022-07-20 22:39:13,016 INFO L226 Difference]: Without dead ends: 331 [2022-07-20 22:39:13,017 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-20 22:39:13,018 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 142 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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.8s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:13,018 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.8s Time] [2022-07-20 22:39:13,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-07-20 22:39:13,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 232. [2022-07-20 22:39:13,024 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-20 22:39:13,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 346 transitions. [2022-07-20 22:39:13,025 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 346 transitions. Word has length 69 [2022-07-20 22:39:13,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:13,026 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 346 transitions. [2022-07-20 22:39:13,026 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-20 22:39:13,026 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 346 transitions. [2022-07-20 22:39:13,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-20 22:39:13,027 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:13,027 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-20 22:39:13,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 22:39:13,027 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:13,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:13,028 INFO L85 PathProgramCache]: Analyzing trace with hash 122165287, now seen corresponding path program 1 times [2022-07-20 22:39:13,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:13,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821583728] [2022-07-20 22:39:13,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:13,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:13,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:13,145 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-20 22:39:13,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:13,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821583728] [2022-07-20 22:39:13,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821583728] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:13,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:13,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:13,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685966695] [2022-07-20 22:39:13,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:13,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:13,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:13,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:13,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:13,148 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-20 22:39:14,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:14,157 INFO L93 Difference]: Finished difference Result 542 states and 820 transitions. [2022-07-20 22:39:14,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:14,158 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-20 22:39:14,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:14,159 INFO L225 Difference]: With dead ends: 542 [2022-07-20 22:39:14,159 INFO L226 Difference]: Without dead ends: 331 [2022-07-20 22:39:14,160 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-20 22:39:14,160 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 146 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 1.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:14,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 334 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-20 22:39:14,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-07-20 22:39:14,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 232. [2022-07-20 22:39:14,166 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-20 22:39:14,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 342 transitions. [2022-07-20 22:39:14,168 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 342 transitions. Word has length 70 [2022-07-20 22:39:14,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:14,168 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 342 transitions. [2022-07-20 22:39:14,168 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-20 22:39:14,168 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 342 transitions. [2022-07-20 22:39:14,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-20 22:39:14,169 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:14,169 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-20 22:39:14,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-20 22:39:14,170 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:14,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:14,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1733152866, now seen corresponding path program 1 times [2022-07-20 22:39:14,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:14,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321347665] [2022-07-20 22:39:14,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:14,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:14,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:14,265 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-20 22:39:14,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:14,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321347665] [2022-07-20 22:39:14,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321347665] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:14,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:14,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:14,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386300363] [2022-07-20 22:39:14,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:14,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:14,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:14,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:14,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:14,268 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-20 22:39:14,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:14,925 INFO L93 Difference]: Finished difference Result 450 states and 669 transitions. [2022-07-20 22:39:14,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:14,925 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-20 22:39:14,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:14,927 INFO L225 Difference]: With dead ends: 450 [2022-07-20 22:39:14,927 INFO L226 Difference]: Without dead ends: 239 [2022-07-20 22:39:14,927 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-20 22:39:14,928 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 26 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:14,928 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.6s Time] [2022-07-20 22:39:14,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-07-20 22:39:14,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 232. [2022-07-20 22:39:14,943 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-20 22:39:14,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 341 transitions. [2022-07-20 22:39:14,944 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 341 transitions. Word has length 72 [2022-07-20 22:39:14,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:14,944 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 341 transitions. [2022-07-20 22:39:14,944 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-20 22:39:14,945 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 341 transitions. [2022-07-20 22:39:14,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-20 22:39:14,945 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:14,945 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-20 22:39:14,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 22:39:14,946 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:14,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:14,946 INFO L85 PathProgramCache]: Analyzing trace with hash 293504549, now seen corresponding path program 1 times [2022-07-20 22:39:14,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:14,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533307218] [2022-07-20 22:39:14,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:14,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:15,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:15,092 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-20 22:39:15,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:15,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533307218] [2022-07-20 22:39:15,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533307218] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:15,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:15,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:15,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005779651] [2022-07-20 22:39:15,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:15,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:15,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:15,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:15,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:15,096 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-20 22:39:16,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:16,359 INFO L93 Difference]: Finished difference Result 538 states and 797 transitions. [2022-07-20 22:39:16,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:16,359 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-20 22:39:16,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:16,361 INFO L225 Difference]: With dead ends: 538 [2022-07-20 22:39:16,361 INFO L226 Difference]: Without dead ends: 327 [2022-07-20 22:39:16,361 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-20 22:39:16,362 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 88 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.2s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:16,362 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.2s Time] [2022-07-20 22:39:16,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-07-20 22:39:16,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 263. [2022-07-20 22:39:16,367 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-20 22:39:16,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 387 transitions. [2022-07-20 22:39:16,368 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 387 transitions. Word has length 77 [2022-07-20 22:39:16,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:16,369 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 387 transitions. [2022-07-20 22:39:16,369 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-20 22:39:16,369 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 387 transitions. [2022-07-20 22:39:16,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-20 22:39:16,370 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:16,370 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-20 22:39:16,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-20 22:39:16,370 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:16,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:16,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1950478749, now seen corresponding path program 1 times [2022-07-20 22:39:16,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:16,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083164456] [2022-07-20 22:39:16,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:16,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:16,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:16,476 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-20 22:39:16,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:16,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083164456] [2022-07-20 22:39:16,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083164456] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:16,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:16,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:16,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155613888] [2022-07-20 22:39:16,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:16,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:16,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:16,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:16,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:16,479 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-20 22:39:16,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:16,904 INFO L93 Difference]: Finished difference Result 551 states and 815 transitions. [2022-07-20 22:39:16,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:16,905 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-20 22:39:16,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:16,906 INFO L225 Difference]: With dead ends: 551 [2022-07-20 22:39:16,906 INFO L226 Difference]: Without dead ends: 309 [2022-07-20 22:39:16,907 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-20 22:39:16,907 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 35 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:16,908 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.4s Time] [2022-07-20 22:39:16,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-07-20 22:39:16,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 287. [2022-07-20 22:39:16,915 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-20 22:39:16,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 422 transitions. [2022-07-20 22:39:16,916 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 422 transitions. Word has length 77 [2022-07-20 22:39:16,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:16,917 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 422 transitions. [2022-07-20 22:39:16,917 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-20 22:39:16,917 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 422 transitions. [2022-07-20 22:39:16,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-20 22:39:16,918 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:16,918 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-20 22:39:16,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-20 22:39:16,919 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:16,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:16,919 INFO L85 PathProgramCache]: Analyzing trace with hash 2009733770, now seen corresponding path program 1 times [2022-07-20 22:39:16,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:16,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131543047] [2022-07-20 22:39:16,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:16,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:16,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:17,016 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-20 22:39:17,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:17,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131543047] [2022-07-20 22:39:17,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131543047] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:17,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:17,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:17,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109887702] [2022-07-20 22:39:17,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:17,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:17,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:17,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:17,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:17,019 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-20 22:39:18,951 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 22:39:19,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:19,234 INFO L93 Difference]: Finished difference Result 617 states and 912 transitions. [2022-07-20 22:39:19,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:19,234 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-20 22:39:19,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:19,236 INFO L225 Difference]: With dead ends: 617 [2022-07-20 22:39:19,236 INFO L226 Difference]: Without dead ends: 351 [2022-07-20 22:39:19,237 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-20 22:39:19,237 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 77 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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, 2.2s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:19,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 469 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-20 22:39:19,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-07-20 22:39:19,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 297. [2022-07-20 22:39:19,244 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-20 22:39:19,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 441 transitions. [2022-07-20 22:39:19,245 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 441 transitions. Word has length 82 [2022-07-20 22:39:19,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:19,245 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 441 transitions. [2022-07-20 22:39:19,245 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-20 22:39:19,246 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 441 transitions. [2022-07-20 22:39:19,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-20 22:39:19,246 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:19,247 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-20 22:39:19,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-20 22:39:19,247 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:19,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:19,247 INFO L85 PathProgramCache]: Analyzing trace with hash -2129799745, now seen corresponding path program 1 times [2022-07-20 22:39:19,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:19,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787770207] [2022-07-20 22:39:19,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:19,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:19,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:19,343 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-20 22:39:19,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:19,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787770207] [2022-07-20 22:39:19,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787770207] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:19,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:19,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:19,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756346759] [2022-07-20 22:39:19,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:19,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:19,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:19,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:19,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:19,346 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-20 22:39:20,901 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 22:39:21,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:21,152 INFO L93 Difference]: Finished difference Result 621 states and 923 transitions. [2022-07-20 22:39:21,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:21,153 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-20 22:39:21,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:21,154 INFO L225 Difference]: With dead ends: 621 [2022-07-20 22:39:21,154 INFO L226 Difference]: Without dead ends: 345 [2022-07-20 22:39:21,155 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-20 22:39:21,155 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 70 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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.8s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:21,156 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.8s Time] [2022-07-20 22:39:21,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-07-20 22:39:21,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 298. [2022-07-20 22:39:21,162 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-20 22:39:21,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 442 transitions. [2022-07-20 22:39:21,177 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 442 transitions. Word has length 83 [2022-07-20 22:39:21,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:21,177 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 442 transitions. [2022-07-20 22:39:21,177 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-20 22:39:21,177 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 442 transitions. [2022-07-20 22:39:21,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-20 22:39:21,178 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:21,178 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-20 22:39:21,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-20 22:39:21,179 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:21,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:21,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1674400777, now seen corresponding path program 1 times [2022-07-20 22:39:21,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:21,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217449233] [2022-07-20 22:39:21,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:21,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:21,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:21,337 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-20 22:39:21,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:21,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217449233] [2022-07-20 22:39:21,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217449233] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:21,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:21,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 22:39:21,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762265673] [2022-07-20 22:39:21,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:21,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 22:39:21,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:21,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 22:39:21,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:39:21,340 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-20 22:39:22,467 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 22:39:23,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:23,249 INFO L93 Difference]: Finished difference Result 585 states and 872 transitions. [2022-07-20 22:39:23,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 22:39:23,249 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-20 22:39:23,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:23,250 INFO L225 Difference]: With dead ends: 585 [2022-07-20 22:39:23,250 INFO L226 Difference]: Without dead ends: 308 [2022-07-20 22:39:23,251 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-20 22:39:23,251 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 149 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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.9s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:23,251 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.9s Time] [2022-07-20 22:39:23,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-07-20 22:39:23,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 307. [2022-07-20 22:39:23,256 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-20 22:39:23,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 453 transitions. [2022-07-20 22:39:23,257 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 453 transitions. Word has length 94 [2022-07-20 22:39:23,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:23,257 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 453 transitions. [2022-07-20 22:39:23,257 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-20 22:39:23,258 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 453 transitions. [2022-07-20 22:39:23,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-20 22:39:23,259 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:23,259 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-20 22:39:23,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-20 22:39:23,259 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:23,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:23,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1278038072, now seen corresponding path program 1 times [2022-07-20 22:39:23,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:23,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578244126] [2022-07-20 22:39:23,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:23,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:23,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:23,372 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-20 22:39:23,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:23,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578244126] [2022-07-20 22:39:23,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578244126] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:23,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:23,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:23,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994271982] [2022-07-20 22:39:23,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:23,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:23,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:23,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:23,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:23,376 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-20 22:39:23,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:23,961 INFO L93 Difference]: Finished difference Result 682 states and 1021 transitions. [2022-07-20 22:39:23,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:23,961 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-20 22:39:23,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:23,963 INFO L225 Difference]: With dead ends: 682 [2022-07-20 22:39:23,963 INFO L226 Difference]: Without dead ends: 396 [2022-07-20 22:39:23,964 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-20 22:39:23,964 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 136 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:23,965 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.6s Time] [2022-07-20 22:39:23,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-07-20 22:39:23,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 307. [2022-07-20 22:39:23,973 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-20 22:39:23,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 448 transitions. [2022-07-20 22:39:23,974 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 448 transitions. Word has length 95 [2022-07-20 22:39:23,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:23,975 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 448 transitions. [2022-07-20 22:39:23,975 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-20 22:39:23,975 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 448 transitions. [2022-07-20 22:39:23,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-20 22:39:23,976 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:23,976 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-20 22:39:23,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-20 22:39:23,977 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:23,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:23,977 INFO L85 PathProgramCache]: Analyzing trace with hash 868200130, now seen corresponding path program 1 times [2022-07-20 22:39:23,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:23,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272079080] [2022-07-20 22:39:23,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:23,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:24,094 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-20 22:39:24,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:24,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272079080] [2022-07-20 22:39:24,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272079080] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:24,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:24,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:24,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785384580] [2022-07-20 22:39:24,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:24,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:24,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:24,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:24,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:24,097 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-20 22:39:24,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:24,806 INFO L93 Difference]: Finished difference Result 630 states and 922 transitions. [2022-07-20 22:39:24,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:24,807 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-20 22:39:24,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:24,808 INFO L225 Difference]: With dead ends: 630 [2022-07-20 22:39:24,808 INFO L226 Difference]: Without dead ends: 344 [2022-07-20 22:39:24,809 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-20 22:39:24,809 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 77 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:24,810 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.7s Time] [2022-07-20 22:39:24,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2022-07-20 22:39:24,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 307. [2022-07-20 22:39:24,817 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-20 22:39:24,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 447 transitions. [2022-07-20 22:39:24,818 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 447 transitions. Word has length 99 [2022-07-20 22:39:24,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:24,818 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 447 transitions. [2022-07-20 22:39:24,819 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-20 22:39:24,819 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 447 transitions. [2022-07-20 22:39:24,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-20 22:39:24,820 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:24,820 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-20 22:39:24,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-20 22:39:24,820 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:24,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:24,821 INFO L85 PathProgramCache]: Analyzing trace with hash 908874880, now seen corresponding path program 1 times [2022-07-20 22:39:24,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:24,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708193836] [2022-07-20 22:39:24,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:24,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:24,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:24,936 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-20 22:39:24,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:24,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708193836] [2022-07-20 22:39:24,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708193836] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:24,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:24,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:39:24,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791163683] [2022-07-20 22:39:24,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:24,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:39:24,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:24,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:39:24,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:39:24,939 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-20 22:39:24,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:24,984 INFO L93 Difference]: Finished difference Result 874 states and 1287 transitions. [2022-07-20 22:39:24,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:39:24,985 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-20 22:39:24,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:24,987 INFO L225 Difference]: With dead ends: 874 [2022-07-20 22:39:24,987 INFO L226 Difference]: Without dead ends: 588 [2022-07-20 22:39:24,988 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-20 22:39:24,988 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-20 22:39:24,989 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-20 22:39:24,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2022-07-20 22:39:25,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2022-07-20 22:39:25,002 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-20 22:39:25,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 855 transitions. [2022-07-20 22:39:25,003 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 855 transitions. Word has length 99 [2022-07-20 22:39:25,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:25,004 INFO L495 AbstractCegarLoop]: Abstraction has 588 states and 855 transitions. [2022-07-20 22:39:25,004 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-20 22:39:25,004 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 855 transitions. [2022-07-20 22:39:25,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-20 22:39:25,006 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:25,006 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-20 22:39:25,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-20 22:39:25,006 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:25,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:25,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1342603966, now seen corresponding path program 1 times [2022-07-20 22:39:25,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:25,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096280747] [2022-07-20 22:39:25,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:25,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:25,087 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-20 22:39:25,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:25,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096280747] [2022-07-20 22:39:25,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096280747] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:25,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:25,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:39:25,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622687035] [2022-07-20 22:39:25,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:25,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:39:25,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:25,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:39:25,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:39:25,090 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-20 22:39:25,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:25,123 INFO L93 Difference]: Finished difference Result 1182 states and 1722 transitions. [2022-07-20 22:39:25,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:39:25,124 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-20 22:39:25,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:25,126 INFO L225 Difference]: With dead ends: 1182 [2022-07-20 22:39:25,126 INFO L226 Difference]: Without dead ends: 615 [2022-07-20 22:39:25,127 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-20 22:39:25,128 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-20 22:39:25,128 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-20 22:39:25,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2022-07-20 22:39:25,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2022-07-20 22:39:25,143 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-20 22:39:25,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 890 transitions. [2022-07-20 22:39:25,144 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 890 transitions. Word has length 99 [2022-07-20 22:39:25,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:25,145 INFO L495 AbstractCegarLoop]: Abstraction has 615 states and 890 transitions. [2022-07-20 22:39:25,145 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-20 22:39:25,145 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 890 transitions. [2022-07-20 22:39:25,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-20 22:39:25,147 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:25,147 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-20 22:39:25,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-20 22:39:25,147 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:25,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:25,148 INFO L85 PathProgramCache]: Analyzing trace with hash -2113329668, now seen corresponding path program 1 times [2022-07-20 22:39:25,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:25,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626636227] [2022-07-20 22:39:25,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:25,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:25,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:25,232 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-20 22:39:25,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:25,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626636227] [2022-07-20 22:39:25,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626636227] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:25,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:25,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:39:25,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426892727] [2022-07-20 22:39:25,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:25,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:39:25,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:25,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:39:25,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:39:25,234 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-20 22:39:25,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:25,258 INFO L93 Difference]: Finished difference Result 1211 states and 1758 transitions. [2022-07-20 22:39:25,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:39:25,259 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-20 22:39:25,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:25,261 INFO L225 Difference]: With dead ends: 1211 [2022-07-20 22:39:25,261 INFO L226 Difference]: Without dead ends: 617 [2022-07-20 22:39:25,265 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-20 22:39:25,266 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-20 22:39:25,268 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-20 22:39:25,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2022-07-20 22:39:25,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2022-07-20 22:39:25,285 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-20 22:39:25,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 892 transitions. [2022-07-20 22:39:25,287 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 892 transitions. Word has length 99 [2022-07-20 22:39:25,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:25,287 INFO L495 AbstractCegarLoop]: Abstraction has 617 states and 892 transitions. [2022-07-20 22:39:25,288 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-20 22:39:25,288 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 892 transitions. [2022-07-20 22:39:25,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-20 22:39:25,289 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:25,290 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-20 22:39:25,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-20 22:39:25,290 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:25,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:25,291 INFO L85 PathProgramCache]: Analyzing trace with hash -254845290, now seen corresponding path program 1 times [2022-07-20 22:39:25,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:25,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513782694] [2022-07-20 22:39:25,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:25,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:25,408 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-20 22:39:25,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:25,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513782694] [2022-07-20 22:39:25,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513782694] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:25,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:25,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:39:25,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022060139] [2022-07-20 22:39:25,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:25,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:39:25,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:25,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:39:25,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:39:25,412 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-20 22:39:25,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:25,460 INFO L93 Difference]: Finished difference Result 1497 states and 2179 transitions. [2022-07-20 22:39:25,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:39:25,460 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-20 22:39:25,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:25,463 INFO L225 Difference]: With dead ends: 1497 [2022-07-20 22:39:25,464 INFO L226 Difference]: Without dead ends: 903 [2022-07-20 22:39:25,465 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-20 22:39:25,465 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-20 22:39:25,467 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-20 22:39:25,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2022-07-20 22:39:25,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 901. [2022-07-20 22:39:25,489 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-20 22:39:25,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1311 transitions. [2022-07-20 22:39:25,490 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1311 transitions. Word has length 101 [2022-07-20 22:39:25,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:25,491 INFO L495 AbstractCegarLoop]: Abstraction has 901 states and 1311 transitions. [2022-07-20 22:39:25,491 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-20 22:39:25,491 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1311 transitions. [2022-07-20 22:39:25,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-20 22:39:25,493 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:25,493 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-20 22:39:25,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-20 22:39:25,493 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:25,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:25,494 INFO L85 PathProgramCache]: Analyzing trace with hash 34857145, now seen corresponding path program 1 times [2022-07-20 22:39:25,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:25,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426553107] [2022-07-20 22:39:25,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:25,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:25,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:25,595 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-20 22:39:25,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:25,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426553107] [2022-07-20 22:39:25,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426553107] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:25,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:25,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:39:25,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332527029] [2022-07-20 22:39:25,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:25,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:39:25,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:25,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:39:25,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:39:25,600 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-20 22:39:25,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:25,665 INFO L93 Difference]: Finished difference Result 2065 states and 3015 transitions. [2022-07-20 22:39:25,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:39:25,665 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-20 22:39:25,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:25,669 INFO L225 Difference]: With dead ends: 2065 [2022-07-20 22:39:25,670 INFO L226 Difference]: Without dead ends: 1187 [2022-07-20 22:39:25,671 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-20 22:39:25,672 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.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:25,673 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.0s Time] [2022-07-20 22:39:25,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2022-07-20 22:39:25,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1185. [2022-07-20 22:39:25,700 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-20 22:39:25,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1716 transitions. [2022-07-20 22:39:25,703 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1716 transitions. Word has length 106 [2022-07-20 22:39:25,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:25,703 INFO L495 AbstractCegarLoop]: Abstraction has 1185 states and 1716 transitions. [2022-07-20 22:39:25,703 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-20 22:39:25,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1716 transitions. [2022-07-20 22:39:25,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-20 22:39:25,706 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:25,706 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-20 22:39:25,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-20 22:39:25,706 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:25,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:25,707 INFO L85 PathProgramCache]: Analyzing trace with hash -285519407, now seen corresponding path program 1 times [2022-07-20 22:39:25,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:25,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718177181] [2022-07-20 22:39:25,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:25,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:25,816 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-20 22:39:25,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:25,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718177181] [2022-07-20 22:39:25,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718177181] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:25,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:25,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:39:25,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026091557] [2022-07-20 22:39:25,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:25,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:39:25,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:25,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:39:25,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:39:25,819 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-20 22:39:25,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:25,886 INFO L93 Difference]: Finished difference Result 2626 states and 3817 transitions. [2022-07-20 22:39:25,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:39:25,887 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-20 22:39:25,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:25,892 INFO L225 Difference]: With dead ends: 2626 [2022-07-20 22:39:25,892 INFO L226 Difference]: Without dead ends: 1464 [2022-07-20 22:39:25,894 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-20 22:39:25,894 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-20 22:39:25,895 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-20 22:39:25,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2022-07-20 22:39:25,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1464. [2022-07-20 22:39:25,931 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-20 22:39:25,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 2121 transitions. [2022-07-20 22:39:25,934 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 2121 transitions. Word has length 123 [2022-07-20 22:39:25,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:25,935 INFO L495 AbstractCegarLoop]: Abstraction has 1464 states and 2121 transitions. [2022-07-20 22:39:25,935 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-20 22:39:25,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 2121 transitions. [2022-07-20 22:39:25,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-20 22:39:25,938 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:25,938 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-20 22:39:25,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-20 22:39:25,938 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:25,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:25,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1271906027, now seen corresponding path program 1 times [2022-07-20 22:39:25,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:25,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014192578] [2022-07-20 22:39:25,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:25,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:26,082 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-20 22:39:26,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:26,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014192578] [2022-07-20 22:39:26,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014192578] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:26,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:26,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:39:26,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211224759] [2022-07-20 22:39:26,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:26,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:39:26,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:26,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:39:26,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:39:26,084 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-20 22:39:26,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:26,143 INFO L93 Difference]: Finished difference Result 1752 states and 2537 transitions. [2022-07-20 22:39:26,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:39:26,144 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-20 22:39:26,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:26,150 INFO L225 Difference]: With dead ends: 1752 [2022-07-20 22:39:26,150 INFO L226 Difference]: Without dead ends: 1750 [2022-07-20 22:39:26,152 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-20 22:39:26,156 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-20 22:39:26,156 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-20 22:39:26,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states. [2022-07-20 22:39:26,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1748. [2022-07-20 22:39:26,216 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-20 22:39:26,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2534 transitions. [2022-07-20 22:39:26,221 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2534 transitions. Word has length 129 [2022-07-20 22:39:26,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:26,221 INFO L495 AbstractCegarLoop]: Abstraction has 1748 states and 2534 transitions. [2022-07-20 22:39:26,222 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-20 22:39:26,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2534 transitions. [2022-07-20 22:39:26,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-20 22:39:26,225 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:26,225 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-20 22:39:26,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-20 22:39:26,226 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:26,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:26,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1650407178, now seen corresponding path program 1 times [2022-07-20 22:39:26,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:26,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989518041] [2022-07-20 22:39:26,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:26,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:26,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:26,355 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-20 22:39:26,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:26,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989518041] [2022-07-20 22:39:26,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989518041] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:26,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:26,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:39:26,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711513611] [2022-07-20 22:39:26,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:26,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:39:26,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:26,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:39:26,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:39:26,357 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-20 22:39:26,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:26,428 INFO L93 Difference]: Finished difference Result 3756 states and 5459 transitions. [2022-07-20 22:39:26,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:39:26,428 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-20 22:39:26,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:26,436 INFO L225 Difference]: With dead ends: 3756 [2022-07-20 22:39:26,436 INFO L226 Difference]: Without dead ends: 2031 [2022-07-20 22:39:26,439 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-20 22:39:26,439 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-20 22:39:26,441 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-20 22:39:26,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2031 states. [2022-07-20 22:39:26,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2031 to 2031. [2022-07-20 22:39:26,497 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-20 22:39:26,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2031 states to 2031 states and 2944 transitions. [2022-07-20 22:39:26,501 INFO L78 Accepts]: Start accepts. Automaton has 2031 states and 2944 transitions. Word has length 166 [2022-07-20 22:39:26,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:26,501 INFO L495 AbstractCegarLoop]: Abstraction has 2031 states and 2944 transitions. [2022-07-20 22:39:26,502 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-20 22:39:26,502 INFO L276 IsEmpty]: Start isEmpty. Operand 2031 states and 2944 transitions. [2022-07-20 22:39:26,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-20 22:39:26,505 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:26,505 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-20 22:39:26,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-20 22:39:26,506 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:26,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:26,506 INFO L85 PathProgramCache]: Analyzing trace with hash -2051323133, now seen corresponding path program 1 times [2022-07-20 22:39:26,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:26,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54358542] [2022-07-20 22:39:26,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:26,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:26,649 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-20 22:39:26,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:26,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54358542] [2022-07-20 22:39:26,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54358542] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:26,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:26,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:26,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190640985] [2022-07-20 22:39:26,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:26,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:26,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:26,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:26,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:26,651 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-20 22:39:27,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:27,664 INFO L93 Difference]: Finished difference Result 4814 states and 7033 transitions. [2022-07-20 22:39:27,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:27,665 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-20 22:39:27,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:27,675 INFO L225 Difference]: With dead ends: 4814 [2022-07-20 22:39:27,675 INFO L226 Difference]: Without dead ends: 2806 [2022-07-20 22:39:27,678 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-20 22:39:27,679 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 106 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.9s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:27,679 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.9s Time] [2022-07-20 22:39:27,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2806 states. [2022-07-20 22:39:27,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2806 to 2374. [2022-07-20 22:39:27,750 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-20 22:39:27,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2374 states to 2374 states and 3539 transitions. [2022-07-20 22:39:27,755 INFO L78 Accepts]: Start accepts. Automaton has 2374 states and 3539 transitions. Word has length 175 [2022-07-20 22:39:27,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:27,756 INFO L495 AbstractCegarLoop]: Abstraction has 2374 states and 3539 transitions. [2022-07-20 22:39:27,756 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-20 22:39:27,756 INFO L276 IsEmpty]: Start isEmpty. Operand 2374 states and 3539 transitions. [2022-07-20 22:39:27,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-07-20 22:39:27,762 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:27,762 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-20 22:39:27,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-20 22:39:27,763 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:27,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:27,763 INFO L85 PathProgramCache]: Analyzing trace with hash 84722404, now seen corresponding path program 1 times [2022-07-20 22:39:27,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:27,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143901378] [2022-07-20 22:39:27,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:27,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:27,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:27,905 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-20 22:39:27,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:27,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143901378] [2022-07-20 22:39:27,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143901378] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:27,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:27,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:27,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380355390] [2022-07-20 22:39:27,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:27,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:27,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:27,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:27,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:27,907 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-20 22:39:28,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:28,448 INFO L93 Difference]: Finished difference Result 5242 states and 7796 transitions. [2022-07-20 22:39:28,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:28,449 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-20 22:39:28,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:28,458 INFO L225 Difference]: With dead ends: 5242 [2022-07-20 22:39:28,458 INFO L226 Difference]: Without dead ends: 2877 [2022-07-20 22:39:28,461 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-20 22:39:28,461 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.5s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:28,462 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.5s Time] [2022-07-20 22:39:28,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2877 states. [2022-07-20 22:39:28,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2877 to 2457. [2022-07-20 22:39:28,522 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-20 22:39:28,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3699 transitions. [2022-07-20 22:39:28,527 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3699 transitions. Word has length 176 [2022-07-20 22:39:28,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:28,528 INFO L495 AbstractCegarLoop]: Abstraction has 2457 states and 3699 transitions. [2022-07-20 22:39:28,528 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-20 22:39:28,528 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3699 transitions. [2022-07-20 22:39:28,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-07-20 22:39:28,533 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:28,533 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-20 22:39:28,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-20 22:39:28,534 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:28,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:28,534 INFO L85 PathProgramCache]: Analyzing trace with hash 875181898, now seen corresponding path program 1 times [2022-07-20 22:39:28,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:28,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136335025] [2022-07-20 22:39:28,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:28,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:28,671 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-20 22:39:28,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:28,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136335025] [2022-07-20 22:39:28,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136335025] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:39:28,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:39:28,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:39:28,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371164258] [2022-07-20 22:39:28,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:28,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:28,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:28,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:28,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:39:28,674 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-20 22:39:29,782 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 22:39:30,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:30,099 INFO L93 Difference]: Finished difference Result 5045 states and 7584 transitions. [2022-07-20 22:39:30,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:30,100 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-20 22:39:30,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:30,108 INFO L225 Difference]: With dead ends: 5045 [2022-07-20 22:39:30,109 INFO L226 Difference]: Without dead ends: 2611 [2022-07-20 22:39:30,112 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-20 22:39:30,113 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 41 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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, 1.4s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:30,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 590 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-20 22:39:30,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2611 states. [2022-07-20 22:39:30,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2611 to 2457. [2022-07-20 22:39:30,183 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-20 22:39:30,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3692 transitions. [2022-07-20 22:39:30,192 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3692 transitions. Word has length 204 [2022-07-20 22:39:30,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:30,193 INFO L495 AbstractCegarLoop]: Abstraction has 2457 states and 3692 transitions. [2022-07-20 22:39:30,193 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-20 22:39:30,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3692 transitions. [2022-07-20 22:39:30,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-07-20 22:39:30,200 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:30,200 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-20 22:39:30,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-20 22:39:30,201 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:30,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:30,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1278157357, now seen corresponding path program 1 times [2022-07-20 22:39:30,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:30,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705641012] [2022-07-20 22:39:30,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:30,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:30,401 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-20 22:39:30,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:30,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705641012] [2022-07-20 22:39:30,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705641012] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:39:30,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638516638] [2022-07-20 22:39:30,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:30,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:39:30,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:39:30,407 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-20 22:39:30,415 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-20 22:39:31,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:31,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 1307 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-20 22:39:31,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:39:31,276 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-20 22:39:31,277 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-20 22:39:31,318 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-20 22:39:31,319 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-20 22:39:31,328 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-20 22:39:31,352 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-20 22:39:31,353 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-20 22:39:31,415 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-20 22:39:31,429 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-20 22:39:31,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:39:31,504 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-20 22:39:31,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638516638] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-20 22:39:31,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-20 22:39:31,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 11 [2022-07-20 22:39:31,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232062039] [2022-07-20 22:39:31,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:31,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:39:31,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:31,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:39:31,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-20 22:39:31,507 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-20 22:39:33,390 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 22:39:33,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:33,821 INFO L93 Difference]: Finished difference Result 5584 states and 8370 transitions. [2022-07-20 22:39:33,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:39:33,821 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-20 22:39:33,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:33,845 INFO L225 Difference]: With dead ends: 5584 [2022-07-20 22:39:33,845 INFO L226 Difference]: Without dead ends: 3150 [2022-07-20 22:39:33,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 448 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-20 22:39:33,850 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 115 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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, 2.2s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:33,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 384 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-20 22:39:33,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3150 states. [2022-07-20 22:39:33,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3150 to 2681. [2022-07-20 22:39:33,923 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-20 22:39:33,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2681 states to 2681 states and 4022 transitions. [2022-07-20 22:39:33,928 INFO L78 Accepts]: Start accepts. Automaton has 2681 states and 4022 transitions. Word has length 226 [2022-07-20 22:39:33,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:33,929 INFO L495 AbstractCegarLoop]: Abstraction has 2681 states and 4022 transitions. [2022-07-20 22:39:33,929 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-20 22:39:33,929 INFO L276 IsEmpty]: Start isEmpty. Operand 2681 states and 4022 transitions. [2022-07-20 22:39:33,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2022-07-20 22:39:33,935 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:33,935 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-20 22:39:33,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-20 22:39:34,150 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-20 22:39:34,151 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:34,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:34,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1639861597, now seen corresponding path program 1 times [2022-07-20 22:39:34,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:34,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976661220] [2022-07-20 22:39:34,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:34,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:34,467 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-20 22:39:34,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:34,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976661220] [2022-07-20 22:39:34,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976661220] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:39:34,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866129298] [2022-07-20 22:39:34,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:34,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:39:34,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:39:34,469 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-20 22:39:34,470 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-20 22:39:35,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:35,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 1381 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-20 22:39:35,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:39:35,299 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-20 22:39:35,300 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-20 22:39:35,340 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-20 22:39:35,341 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-20 22:39:35,358 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-20 22:39:35,366 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-20 22:39:35,390 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-20 22:39:35,394 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-20 22:39:35,412 INFO L356 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-07-20 22:39:35,413 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-20 22:39:35,486 INFO L356 Elim1Store]: treesize reduction 66, result has 30.5 percent of original size [2022-07-20 22:39:35,487 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-20 22:39:35,603 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-20 22:39:35,618 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-20 22:39:35,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:39:35,662 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-20 22:39:35,665 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-20 22:39:36,506 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-20 22:39:36,518 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-20 22:39:36,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866129298] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-20 22:39:36,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-20 22:39:36,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 10] total 13 [2022-07-20 22:39:36,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356673714] [2022-07-20 22:39:36,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:36,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 22:39:36,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:36,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 22:39:36,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=102, Unknown=1, NotChecked=20, Total=156 [2022-07-20 22:39:36,520 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-20 22:39:38,641 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-20 22:39:38,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:38,751 INFO L93 Difference]: Finished difference Result 6017 states and 8995 transitions. [2022-07-20 22:39:38,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 22:39:38,752 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-20 22:39:38,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:38,759 INFO L225 Difference]: With dead ends: 6017 [2022-07-20 22:39:38,759 INFO L226 Difference]: Without dead ends: 3359 [2022-07-20 22:39:38,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 467 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=40, Invalid=122, Unknown=2, NotChecked=46, Total=210 [2022-07-20 22:39:38,762 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 119 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.3s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:38,763 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.3s Time] [2022-07-20 22:39:38,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3359 states. [2022-07-20 22:39:38,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3359 to 2861. [2022-07-20 22:39:38,828 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-20 22:39:38,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2861 states to 2861 states and 4272 transitions. [2022-07-20 22:39:38,832 INFO L78 Accepts]: Start accepts. Automaton has 2861 states and 4272 transitions. Word has length 235 [2022-07-20 22:39:38,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:38,833 INFO L495 AbstractCegarLoop]: Abstraction has 2861 states and 4272 transitions. [2022-07-20 22:39:38,833 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-20 22:39:38,833 INFO L276 IsEmpty]: Start isEmpty. Operand 2861 states and 4272 transitions. [2022-07-20 22:39:38,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2022-07-20 22:39:38,839 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:38,839 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-20 22:39:38,871 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-20 22:39:39,068 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-20 22:39:39,068 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:39,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:39,069 INFO L85 PathProgramCache]: Analyzing trace with hash 411122401, now seen corresponding path program 1 times [2022-07-20 22:39:39,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:39,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719047907] [2022-07-20 22:39:39,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:39,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:39,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:39,429 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-20 22:39:39,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:39,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719047907] [2022-07-20 22:39:39,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719047907] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:39:39,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330717917] [2022-07-20 22:39:39,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:39,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:39:39,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:39:39,432 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-20 22:39:39,458 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-20 22:39:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:40,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 1382 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-20 22:39:40,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:39:40,237 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-20 22:39:40,238 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-20 22:39:40,275 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-20 22:39:40,275 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-20 22:39:40,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-20 22:39:40,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-20 22:39:40,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 31 treesize of output 19 [2022-07-20 22:39:40,310 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-20 22:39:40,327 INFO L356 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-07-20 22:39:40,327 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-20 22:39:40,380 INFO L356 Elim1Store]: treesize reduction 66, result has 30.5 percent of original size [2022-07-20 22:39:40,382 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-20 22:39:40,490 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-20 22:39:40,503 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-20 22:39:40,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:39:40,544 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-20 22:39:40,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 26 treesize of output 20 [2022-07-20 22:39:42,551 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-20 22:39:42,561 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-20 22:39:42,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330717917] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-20 22:39:42,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-20 22:39:42,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 10] total 13 [2022-07-20 22:39:42,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752798588] [2022-07-20 22:39:42,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:39:42,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 22:39:42,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:42,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 22:39:42,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=102, Unknown=1, NotChecked=20, Total=156 [2022-07-20 22:39:42,564 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-20 22:39:44,201 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 22:39:46,499 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-20 22:39:46,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:39:46,602 INFO L93 Difference]: Finished difference Result 6371 states and 9483 transitions. [2022-07-20 22:39:46,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 22:39:46,603 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-20 22:39:46,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:39:46,610 INFO L225 Difference]: With dead ends: 6371 [2022-07-20 22:39:46,611 INFO L226 Difference]: Without dead ends: 3533 [2022-07-20 22:39:46,615 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-20 22:39:46,616 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 119 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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.9s IncrementalHoareTripleChecker+Time [2022-07-20 22:39:46,616 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.9s Time] [2022-07-20 22:39:46,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3533 states. [2022-07-20 22:39:46,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3533 to 2681. [2022-07-20 22:39:46,682 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-20 22:39:46,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2681 states to 2681 states and 4002 transitions. [2022-07-20 22:39:46,686 INFO L78 Accepts]: Start accepts. Automaton has 2681 states and 4002 transitions. Word has length 235 [2022-07-20 22:39:46,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:39:46,687 INFO L495 AbstractCegarLoop]: Abstraction has 2681 states and 4002 transitions. [2022-07-20 22:39:46,687 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-20 22:39:46,687 INFO L276 IsEmpty]: Start isEmpty. Operand 2681 states and 4002 transitions. [2022-07-20 22:39:46,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2022-07-20 22:39:46,692 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:39:46,692 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-20 22:39:46,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-20 22:39:46,919 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-20 22:39:46,920 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:39:46,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:39:46,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1613009689, now seen corresponding path program 1 times [2022-07-20 22:39:46,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:39:46,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274352062] [2022-07-20 22:39:46,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:46,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:39:47,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:47,482 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-20 22:39:47,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:39:47,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274352062] [2022-07-20 22:39:47,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274352062] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:39:47,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091039216] [2022-07-20 22:39:47,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:39:47,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:39:47,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:39:47,488 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-20 22:39:47,489 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-20 22:39:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:39:48,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 1313 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-20 22:39:48,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:39:48,335 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-20 22:39:48,335 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-20 22:39:48,373 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-20 22:39:48,374 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-20 22:39:48,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:39:48,432 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-20 22:39:48,475 INFO L356 Elim1Store]: treesize reduction 50, result has 58.3 percent of original size [2022-07-20 22:39:48,476 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-20 22:39:48,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:39:48,481 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-20 22:39:49,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:39:49,234 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-20 22:39:49,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:39:49,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, 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-20 22:39:49,251 INFO L356 Elim1Store]: treesize reduction 99, result has 17.5 percent of original size [2022-07-20 22:39:49,255 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-20 22:39:49,287 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-20 22:39:49,290 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-20 22:39:49,305 INFO L356 Elim1Store]: treesize reduction 39, result has 35.0 percent of original size [2022-07-20 22:39:49,306 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-20 22:39:49,320 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-20 22:39:49,320 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-20 22:39:49,373 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-20 22:39:49,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:39:49,917 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-20 22:39:49,925 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-20 22:39:50,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:39:50,019 INFO L356 Elim1Store]: treesize reduction 3, result has 25.0 percent of original size [2022-07-20 22:39:50,020 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-20 22:39:50,023 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-20 22:39:50,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091039216] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:39:50,024 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:39:50,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2022-07-20 22:39:50,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776341013] [2022-07-20 22:39:50,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:39:50,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-20 22:39:50,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:39:50,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-20 22:39:50,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2022-07-20 22:39:50,026 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-20 22:39:52,039 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 22:40:00,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:40:00,573 INFO L93 Difference]: Finished difference Result 9218 states and 13547 transitions. [2022-07-20 22:40:00,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-20 22:40:00,573 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-20 22:40:00,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:40:00,585 INFO L225 Difference]: With dead ends: 9218 [2022-07-20 22:40:00,586 INFO L226 Difference]: Without dead ends: 6560 [2022-07-20 22:40:00,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 490 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=614, Invalid=3046, Unknown=0, NotChecked=0, Total=3660 [2022-07-20 22:40:00,590 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.6s IncrementalHoareTripleChecker+Time [2022-07-20 22:40:00,591 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.6s Time] [2022-07-20 22:40:00,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6560 states. [2022-07-20 22:40:00,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6560 to 3419. [2022-07-20 22:40:00,717 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-20 22:40:00,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3419 states to 3419 states and 5112 transitions. [2022-07-20 22:40:00,746 INFO L78 Accepts]: Start accepts. Automaton has 3419 states and 5112 transitions. Word has length 239 [2022-07-20 22:40:00,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:40:00,746 INFO L495 AbstractCegarLoop]: Abstraction has 3419 states and 5112 transitions. [2022-07-20 22:40:00,746 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-20 22:40:00,747 INFO L276 IsEmpty]: Start isEmpty. Operand 3419 states and 5112 transitions. [2022-07-20 22:40:00,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2022-07-20 22:40:00,756 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:40:00,756 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-20 22:40:00,786 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-20 22:40:00,965 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-20 22:40:00,966 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:40:00,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:40:00,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1335983160, now seen corresponding path program 1 times [2022-07-20 22:40:00,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:40:00,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126669891] [2022-07-20 22:40:00,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:40:00,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:40:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:40:01,462 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-20 22:40:01,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:40:01,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126669891] [2022-07-20 22:40:01,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126669891] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:40:01,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374925530] [2022-07-20 22:40:01,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:40:01,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:40:01,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:40:01,464 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-20 22:40:01,465 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-20 22:40:02,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:40:02,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 1316 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-20 22:40:02,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:40:02,269 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-20 22:40:02,269 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-20 22:40:02,299 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-20 22:40:02,300 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-20 22:40:02,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:02,359 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-20 22:40:02,391 INFO L356 Elim1Store]: treesize reduction 50, result has 58.3 percent of original size [2022-07-20 22:40:02,391 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-20 22:40:02,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:02,395 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-20 22:40:02,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:02,883 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-20 22:40:02,899 INFO L356 Elim1Store]: treesize reduction 99, result has 17.5 percent of original size [2022-07-20 22:40:02,899 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-20 22:40:02,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:02,908 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-20 22:40:02,936 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-20 22:40:02,938 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-20 22:40:02,953 INFO L356 Elim1Store]: treesize reduction 39, result has 35.0 percent of original size [2022-07-20 22:40:02,953 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-20 22:40:02,965 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-20 22:40:02,965 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-20 22:40:03,013 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-20 22:40:03,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:40:03,506 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-20 22:40:03,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:40:03,588 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-20 22:40:03,595 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-20 22:40:03,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374925530] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:40:03,596 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:40:03,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 25 [2022-07-20 22:40:03,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695442143] [2022-07-20 22:40:03,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:40:03,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-20 22:40:03,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:40:03,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-20 22:40:03,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2022-07-20 22:40:03,598 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-20 22:40:04,851 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 22:40:06,222 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 22:40:09,440 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 22:40:11,775 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 22:40:13,792 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 22:40:19,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:40:19,942 INFO L93 Difference]: Finished difference Result 16836 states and 24454 transitions. [2022-07-20 22:40:19,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-07-20 22:40:19,943 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-20 22:40:19,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:40:19,967 INFO L225 Difference]: With dead ends: 16836 [2022-07-20 22:40:19,967 INFO L226 Difference]: Without dead ends: 13440 [2022-07-20 22:40:19,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 492 SyntacticMatches, 6 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1491 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=995, Invalid=3975, Unknown=0, NotChecked=0, Total=4970 [2022-07-20 22:40:19,973 INFO L413 NwaCegarLoop]: 489 mSDtfsCounter, 2234 mSDsluCounter, 5145 mSDsCounter, 0 mSdLazyCounter, 5017 mSolverCounterSat, 472 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2234 SdHoareTripleChecker+Valid, 5634 SdHoareTripleChecker+Invalid, 6412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 472 IncrementalHoareTripleChecker+Valid, 5017 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 922 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2022-07-20 22:40:19,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2234 Valid, 5634 Invalid, 6412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [472 Valid, 5017 Invalid, 1 Unknown, 922 Unchecked, 14.5s Time] [2022-07-20 22:40:19,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13440 states. [2022-07-20 22:40:20,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13440 to 3379. [2022-07-20 22:40:20,180 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-20 22:40:20,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3379 states to 3379 states and 5054 transitions. [2022-07-20 22:40:20,185 INFO L78 Accepts]: Start accepts. Automaton has 3379 states and 5054 transitions. Word has length 240 [2022-07-20 22:40:20,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:40:20,185 INFO L495 AbstractCegarLoop]: Abstraction has 3379 states and 5054 transitions. [2022-07-20 22:40:20,186 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-20 22:40:20,186 INFO L276 IsEmpty]: Start isEmpty. Operand 3379 states and 5054 transitions. [2022-07-20 22:40:20,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2022-07-20 22:40:20,192 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:40:20,192 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-20 22:40:20,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-20 22:40:20,395 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-20 22:40:20,395 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:40:20,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:40:20,396 INFO L85 PathProgramCache]: Analyzing trace with hash -961336381, now seen corresponding path program 1 times [2022-07-20 22:40:20,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:40:20,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802907650] [2022-07-20 22:40:20,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:40:20,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:40:20,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:40:20,716 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-20 22:40:20,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:40:20,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802907650] [2022-07-20 22:40:20,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802907650] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:40:20,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783688189] [2022-07-20 22:40:20,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:40:20,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:40:20,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:40:20,732 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-20 22:40:20,830 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-20 22:40:21,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:40:21,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 1369 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-20 22:40:21,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:40:21,714 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-20 22:40:21,714 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-20 22:40:21,787 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-20 22:40:21,787 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-20 22:40:21,821 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-20 22:40:21,844 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-20 22:40:21,858 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-20 22:40:21,861 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-20 22:40:21,876 INFO L356 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-07-20 22:40:21,876 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-20 22:40:21,932 INFO L356 Elim1Store]: treesize reduction 66, result has 30.5 percent of original size [2022-07-20 22:40:21,933 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-20 22:40:22,080 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-20 22:40:22,102 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-20 22:40:22,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:40:22,180 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-20 22:40:22,188 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 22:40:22,188 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-20 22:40:22,190 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-20 22:40:22,194 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-20 22:40:22,265 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-20 22:40:22,449 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:40:22,450 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-20 22:40:22,460 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-20 22:40:22,462 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-20 22:40:24,467 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-20 22:40:24,476 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-20 22:40:24,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783688189] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:40:24,476 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:40:24,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 24 [2022-07-20 22:40:24,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089341293] [2022-07-20 22:40:24,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:40:24,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-20 22:40:24,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:40:24,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-20 22:40:24,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=359, Unknown=4, NotChecked=120, Total=552 [2022-07-20 22:40:24,478 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-20 22:40:27,523 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 22:40:30,926 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-20 22:40:33,452 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-20 22:40:33,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:40:33,566 INFO L93 Difference]: Finished difference Result 10377 states and 15332 transitions. [2022-07-20 22:40:33,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-20 22:40:33,566 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-20 22:40:33,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:40:33,578 INFO L225 Difference]: With dead ends: 10377 [2022-07-20 22:40:33,578 INFO L226 Difference]: Without dead ends: 7021 [2022-07-20 22:40:33,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 508 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=409, Invalid=2155, Unknown=6, NotChecked=510, Total=3080 [2022-07-20 22:40:33,583 INFO L413 NwaCegarLoop]: 291 mSDtfsCounter, 2491 mSDsluCounter, 2657 mSDsCounter, 0 mSdLazyCounter, 2106 mSolverCounterSat, 636 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s 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.4s IncrementalHoareTripleChecker+Time [2022-07-20 22:40:33,584 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.4s Time] [2022-07-20 22:40:33,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7021 states. [2022-07-20 22:40:33,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7021 to 3586. [2022-07-20 22:40:33,748 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-20 22:40:33,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3586 states to 3586 states and 5375 transitions. [2022-07-20 22:40:33,754 INFO L78 Accepts]: Start accepts. Automaton has 3586 states and 5375 transitions. Word has length 251 [2022-07-20 22:40:33,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:40:33,754 INFO L495 AbstractCegarLoop]: Abstraction has 3586 states and 5375 transitions. [2022-07-20 22:40:33,754 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-20 22:40:33,755 INFO L276 IsEmpty]: Start isEmpty. Operand 3586 states and 5375 transitions. [2022-07-20 22:40:33,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2022-07-20 22:40:33,761 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:40:33,761 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-20 22:40:33,793 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-20 22:40:33,987 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-20 22:40:33,987 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:40:33,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:40:33,988 INFO L85 PathProgramCache]: Analyzing trace with hash -14298495, now seen corresponding path program 1 times [2022-07-20 22:40:33,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:40:33,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996376490] [2022-07-20 22:40:33,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:40:33,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:40:34,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:40:34,224 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-20 22:40:34,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:40:34,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996376490] [2022-07-20 22:40:34,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996376490] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:40:34,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31403172] [2022-07-20 22:40:34,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:40:34,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:40:34,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:40:34,226 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-20 22:40:34,244 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-20 22:40:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:40:35,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 1370 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-20 22:40:35,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:40:35,050 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-20 22:40:35,051 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-20 22:40:35,077 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-20 22:40:35,078 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-20 22:40:35,106 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-20 22:40:35,118 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-20 22:40:35,134 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-20 22:40:35,136 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-20 22:40:35,150 INFO L356 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-07-20 22:40:35,150 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-20 22:40:35,199 INFO L356 Elim1Store]: treesize reduction 66, result has 30.5 percent of original size [2022-07-20 22:40:35,200 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-20 22:40:35,332 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-20 22:40:35,350 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-20 22:40:35,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:40:35,413 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-20 22:40:35,419 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 22:40:35,420 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-20 22:40:35,422 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-20 22:40:35,426 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-20 22:40:35,507 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-20 22:40:35,693 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:40:35,693 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-20 22:40:35,701 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-20 22:40:35,703 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-20 22:40:37,708 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-20 22:40:37,714 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-20 22:40:37,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31403172] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:40:37,714 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:40:37,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 25 [2022-07-20 22:40:37,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145240933] [2022-07-20 22:40:37,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:40:37,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-20 22:40:37,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:40:37,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-20 22:40:37,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=398, Unknown=4, NotChecked=126, Total=600 [2022-07-20 22:40:37,716 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-20 22:40:41,479 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-20 22:40:42,634 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 22:40:46,478 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-20 22:40:47,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:40:47,453 INFO L93 Difference]: Finished difference Result 10695 states and 15797 transitions. [2022-07-20 22:40:47,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-07-20 22:40:47,454 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-20 22:40:47,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:40:47,464 INFO L225 Difference]: With dead ends: 10695 [2022-07-20 22:40:47,464 INFO L226 Difference]: Without dead ends: 7132 [2022-07-20 22:40:47,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 564 GetRequests, 502 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 955 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=544, Invalid=2773, Unknown=5, NotChecked=460, Total=3782 [2022-07-20 22:40:47,469 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 2709 mSDsluCounter, 3133 mSDsCounter, 0 mSdLazyCounter, 2545 mSolverCounterSat, 613 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s 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, 7.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:40:47,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2709 Valid, 3404 Invalid, 5184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [613 Valid, 2545 Invalid, 0 Unknown, 2026 Unchecked, 7.1s Time] [2022-07-20 22:40:47,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7132 states. [2022-07-20 22:40:47,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7132 to 3386. [2022-07-20 22:40:47,646 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-20 22:40:47,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 5055 transitions. [2022-07-20 22:40:47,651 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 5055 transitions. Word has length 251 [2022-07-20 22:40:47,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:40:47,652 INFO L495 AbstractCegarLoop]: Abstraction has 3386 states and 5055 transitions. [2022-07-20 22:40:47,652 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-20 22:40:47,652 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 5055 transitions. [2022-07-20 22:40:47,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2022-07-20 22:40:47,658 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:40:47,658 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-20 22:40:47,687 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-20 22:40:47,883 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-20 22:40:47,884 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:40:47,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:40:47,884 INFO L85 PathProgramCache]: Analyzing trace with hash 93515086, now seen corresponding path program 1 times [2022-07-20 22:40:47,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:40:47,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432562681] [2022-07-20 22:40:47,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:40:47,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:40:48,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:40:48,130 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-20 22:40:48,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:40:48,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432562681] [2022-07-20 22:40:48,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432562681] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:40:48,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:40:48,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 22:40:48,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896934665] [2022-07-20 22:40:48,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:40:48,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 22:40:48,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:40:48,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 22:40:48,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-20 22:40:48,134 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-20 22:40:49,503 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 22:40:51,262 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 22:40:53,279 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 22:40:54,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:40:54,390 INFO L93 Difference]: Finished difference Result 8862 states and 13053 transitions. [2022-07-20 22:40:54,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 22:40:54,391 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-20 22:40:54,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:40:54,397 INFO L225 Difference]: With dead ends: 8862 [2022-07-20 22:40:54,397 INFO L226 Difference]: Without dead ends: 5499 [2022-07-20 22:40:54,400 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-20 22:40:54,400 INFO L413 NwaCegarLoop]: 358 mSDtfsCounter, 503 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-07-20 22:40:54,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 1193 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 901 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2022-07-20 22:40:54,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5499 states. [2022-07-20 22:40:54,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5499 to 3386. [2022-07-20 22:40:54,596 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-20 22:40:54,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 5048 transitions. [2022-07-20 22:40:54,602 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 5048 transitions. Word has length 252 [2022-07-20 22:40:54,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:40:54,602 INFO L495 AbstractCegarLoop]: Abstraction has 3386 states and 5048 transitions. [2022-07-20 22:40:54,602 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-20 22:40:54,602 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 5048 transitions. [2022-07-20 22:40:54,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2022-07-20 22:40:54,608 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:40:54,609 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-20 22:40:54,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-07-20 22:40:54,609 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:40:54,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:40:54,610 INFO L85 PathProgramCache]: Analyzing trace with hash -613081520, now seen corresponding path program 1 times [2022-07-20 22:40:54,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:40:54,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895456747] [2022-07-20 22:40:54,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:40:54,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:40:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:40:54,829 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-20 22:40:54,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:40:54,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895456747] [2022-07-20 22:40:54,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895456747] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:40:54,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:40:54,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 22:40:54,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850487436] [2022-07-20 22:40:54,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:40:54,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 22:40:54,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:40:54,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 22:40:54,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-20 22:40:54,832 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-20 22:40:57,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:40:57,262 INFO L93 Difference]: Finished difference Result 9526 states and 14059 transitions. [2022-07-20 22:40:57,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 22:40:57,263 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-20 22:40:57,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:40:57,269 INFO L225 Difference]: With dead ends: 9526 [2022-07-20 22:40:57,269 INFO L226 Difference]: Without dead ends: 6139 [2022-07-20 22:40:57,271 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-20 22:40:57,272 INFO L413 NwaCegarLoop]: 369 mSDtfsCounter, 505 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:40:57,272 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.1s Time] [2022-07-20 22:40:57,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6139 states. [2022-07-20 22:40:57,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6139 to 3826. [2022-07-20 22:40:57,464 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-20 22:40:57,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 5727 transitions. [2022-07-20 22:40:57,468 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 5727 transitions. Word has length 252 [2022-07-20 22:40:57,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:40:57,468 INFO L495 AbstractCegarLoop]: Abstraction has 3826 states and 5727 transitions. [2022-07-20 22:40:57,468 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-20 22:40:57,469 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 5727 transitions. [2022-07-20 22:40:57,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2022-07-20 22:40:57,475 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:40:57,475 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-20 22:40:57,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-07-20 22:40:57,475 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:40:57,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:40:57,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1799400237, now seen corresponding path program 1 times [2022-07-20 22:40:57,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:40:57,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997276295] [2022-07-20 22:40:57,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:40:57,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:40:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:40:57,613 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-20 22:40:57,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:40:57,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997276295] [2022-07-20 22:40:57,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997276295] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:40:57,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:40:57,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:40:57,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629039950] [2022-07-20 22:40:57,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:40:57,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:40:57,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:40:57,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:40:57,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:40:57,615 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-20 22:40:58,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:40:58,636 INFO L93 Difference]: Finished difference Result 7909 states and 11822 transitions. [2022-07-20 22:40:58,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:40:58,637 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-20 22:40:58,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:40:58,641 INFO L225 Difference]: With dead ends: 7909 [2022-07-20 22:40:58,641 INFO L226 Difference]: Without dead ends: 4106 [2022-07-20 22:40:58,643 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-20 22:40:58,644 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 30 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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-20 22:40:58,644 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-20 22:40:58,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2022-07-20 22:40:58,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 4008. [2022-07-20 22:40:58,821 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-20 22:40:58,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4008 states to 4008 states and 5993 transitions. [2022-07-20 22:40:58,825 INFO L78 Accepts]: Start accepts. Automaton has 4008 states and 5993 transitions. Word has length 262 [2022-07-20 22:40:58,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:40:58,826 INFO L495 AbstractCegarLoop]: Abstraction has 4008 states and 5993 transitions. [2022-07-20 22:40:58,826 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-20 22:40:58,826 INFO L276 IsEmpty]: Start isEmpty. Operand 4008 states and 5993 transitions. [2022-07-20 22:40:58,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2022-07-20 22:40:58,832 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:40:58,832 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-20 22:40:58,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-07-20 22:40:58,832 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:40:58,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:40:58,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1317501989, now seen corresponding path program 1 times [2022-07-20 22:40:58,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:40:58,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106716880] [2022-07-20 22:40:58,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:40:58,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:40:59,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:40:59,158 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-20 22:40:59,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:40:59,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106716880] [2022-07-20 22:40:59,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106716880] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:40:59,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118788306] [2022-07-20 22:40:59,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:40:59,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:40:59,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:40:59,161 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-20 22:40:59,162 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-20 22:41:00,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:41:00,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 1492 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-20 22:41:00,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:41:00,204 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-20 22:41:00,205 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-20 22:41:00,233 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-20 22:41:00,234 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-20 22:41:00,244 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-20 22:41:00,249 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-20 22:41:00,259 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-20 22:41:00,262 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-20 22:41:00,276 INFO L356 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-07-20 22:41:00,276 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-20 22:41:00,320 INFO L356 Elim1Store]: treesize reduction 66, result has 30.5 percent of original size [2022-07-20 22:41:00,321 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-20 22:41:00,387 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-20 22:41:00,399 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-20 22:41:00,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:41:00,427 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-20 22:41:00,428 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-20 22:41:01,300 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-20 22:41:01,308 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-20 22:41:01,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118788306] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-20 22:41:01,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-20 22:41:01,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 10] total 13 [2022-07-20 22:41:01,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308313012] [2022-07-20 22:41:01,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:41:01,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 22:41:01,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:41:01,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 22:41:01,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=102, Unknown=1, NotChecked=20, Total=156 [2022-07-20 22:41:01,309 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-20 22:41:03,615 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-20 22:41:03,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:41:03,826 INFO L93 Difference]: Finished difference Result 8625 states and 12851 transitions. [2022-07-20 22:41:03,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 22:41:03,826 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-20 22:41:03,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:41:03,831 INFO L225 Difference]: With dead ends: 8625 [2022-07-20 22:41:03,831 INFO L226 Difference]: Without dead ends: 4640 [2022-07-20 22:41:03,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 521 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=40, Invalid=122, Unknown=2, NotChecked=46, Total=210 [2022-07-20 22:41:03,834 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.8s IncrementalHoareTripleChecker+Time [2022-07-20 22:41:03,834 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.8s Time] [2022-07-20 22:41:03,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4640 states. [2022-07-20 22:41:03,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4640 to 4170. [2022-07-20 22:41:03,995 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-20 22:41:04,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4170 states to 4170 states and 6173 transitions. [2022-07-20 22:41:04,001 INFO L78 Accepts]: Start accepts. Automaton has 4170 states and 6173 transitions. Word has length 262 [2022-07-20 22:41:04,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:41:04,002 INFO L495 AbstractCegarLoop]: Abstraction has 4170 states and 6173 transitions. [2022-07-20 22:41:04,002 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-20 22:41:04,002 INFO L276 IsEmpty]: Start isEmpty. Operand 4170 states and 6173 transitions. [2022-07-20 22:41:04,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2022-07-20 22:41:04,009 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:41:04,009 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-20 22:41:04,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-20 22:41:04,219 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-20 22:41:04,220 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:41:04,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:41:04,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1015890649, now seen corresponding path program 1 times [2022-07-20 22:41:04,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:41:04,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114121673] [2022-07-20 22:41:04,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:41:04,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:41:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:41:04,511 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-20 22:41:04,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:41:04,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114121673] [2022-07-20 22:41:04,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114121673] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:41:04,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511332363] [2022-07-20 22:41:04,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:41:04,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:41:04,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:41:04,513 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-20 22:41:04,515 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-20 22:41:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:41:05,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 1493 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-20 22:41:05,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:41:05,503 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-20 22:41:05,503 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-20 22:41:05,528 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-20 22:41:05,529 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-20 22:41:05,539 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-20 22:41:05,542 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-20 22:41:05,545 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-20 22:41:05,548 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-20 22:41:05,556 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-20 22:41:05,558 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-20 22:41:05,576 INFO L356 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-07-20 22:41:05,577 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-20 22:41:05,619 INFO L356 Elim1Store]: treesize reduction 66, result has 30.5 percent of original size [2022-07-20 22:41:05,619 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-20 22:41:06,189 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 22:41:06,189 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-20 22:41:06,214 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-20 22:41:06,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:41:06,242 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-20 22:41:06,253 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-20 22:41:06,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511332363] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-20 22:41:06,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-20 22:41:06,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 10] total 12 [2022-07-20 22:41:06,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430823157] [2022-07-20 22:41:06,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:41:06,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:41:06,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:41:06,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:41:06,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-20 22:41:06,256 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-20 22:41:07,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:41:07,596 INFO L93 Difference]: Finished difference Result 8711 states and 12847 transitions. [2022-07-20 22:41:07,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:41:07,596 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-20 22:41:07,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:41:07,600 INFO L225 Difference]: With dead ends: 8711 [2022-07-20 22:41:07,601 INFO L226 Difference]: Without dead ends: 4564 [2022-07-20 22:41:07,603 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-20 22:41:07,604 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 121 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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, 1.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:41:07,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 372 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-20 22:41:07,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4564 states. [2022-07-20 22:41:07,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4564 to 4008. [2022-07-20 22:41:07,753 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-20 22:41:07,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4008 states to 4008 states and 5928 transitions. [2022-07-20 22:41:07,757 INFO L78 Accepts]: Start accepts. Automaton has 4008 states and 5928 transitions. Word has length 262 [2022-07-20 22:41:07,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:41:07,757 INFO L495 AbstractCegarLoop]: Abstraction has 4008 states and 5928 transitions. [2022-07-20 22:41:07,757 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-20 22:41:07,757 INFO L276 IsEmpty]: Start isEmpty. Operand 4008 states and 5928 transitions. [2022-07-20 22:41:07,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-07-20 22:41:07,762 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:41:07,762 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-20 22:41:07,783 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-20 22:41:07,962 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-20 22:41:07,963 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:41:07,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:41:07,963 INFO L85 PathProgramCache]: Analyzing trace with hash -107756293, now seen corresponding path program 1 times [2022-07-20 22:41:07,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:41:07,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436936196] [2022-07-20 22:41:07,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:41:07,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:41:08,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:41:08,890 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-20 22:41:08,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:41:08,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436936196] [2022-07-20 22:41:08,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436936196] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:41:08,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188797433] [2022-07-20 22:41:08,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:41:08,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:41:08,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:41:08,892 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-20 22:41:08,893 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-20 22:41:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:41:09,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 1495 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-20 22:41:09,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:41:09,867 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-20 22:41:09,867 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-20 22:41:09,894 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-20 22:41:09,894 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-20 22:41:09,913 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-20 22:41:09,930 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-20 22:41:09,944 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-20 22:41:09,947 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-20 22:41:09,961 INFO L356 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-07-20 22:41:09,962 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-20 22:41:10,014 INFO L356 Elim1Store]: treesize reduction 66, result has 30.5 percent of original size [2022-07-20 22:41:10,014 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-20 22:41:10,091 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-20 22:41:10,107 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-20 22:41:10,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:41:10,151 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-20 22:41:10,153 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-20 22:41:12,157 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-20 22:41:12,163 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-20 22:41:12,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188797433] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-20 22:41:12,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-20 22:41:12,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14, 10] total 22 [2022-07-20 22:41:12,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80001946] [2022-07-20 22:41:12,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:41:12,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 22:41:12,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:41:12,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 22:41:12,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=360, Unknown=1, NotChecked=38, Total=462 [2022-07-20 22:41:12,165 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-20 22:41:13,955 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-20 22:41:14,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:41:14,187 INFO L93 Difference]: Finished difference Result 8625 states and 12715 transitions. [2022-07-20 22:41:14,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 22:41:14,187 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-20 22:41:14,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:41:14,193 INFO L225 Difference]: With dead ends: 8625 [2022-07-20 22:41:14,193 INFO L226 Difference]: Without dead ends: 4640 [2022-07-20 22:41:14,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 523 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=69, Invalid=399, Unknown=2, NotChecked=82, Total=552 [2022-07-20 22:41:14,198 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 120 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 0.9s IncrementalHoareTripleChecker+Time [2022-07-20 22:41:14,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 474 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 239 Invalid, 0 Unknown, 265 Unchecked, 0.9s Time] [2022-07-20 22:41:14,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4640 states. [2022-07-20 22:41:14,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4640 to 4176. [2022-07-20 22:41:14,408 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-20 22:41:14,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4176 states to 4176 states and 6114 transitions. [2022-07-20 22:41:14,415 INFO L78 Accepts]: Start accepts. Automaton has 4176 states and 6114 transitions. Word has length 263 [2022-07-20 22:41:14,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:41:14,416 INFO L495 AbstractCegarLoop]: Abstraction has 4176 states and 6114 transitions. [2022-07-20 22:41:14,416 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-20 22:41:14,416 INFO L276 IsEmpty]: Start isEmpty. Operand 4176 states and 6114 transitions. [2022-07-20 22:41:14,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-07-20 22:41:14,423 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:41:14,423 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-20 22:41:14,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-20 22:41:14,637 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-20 22:41:14,637 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:41:14,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:41:14,638 INFO L85 PathProgramCache]: Analyzing trace with hash -830624380, now seen corresponding path program 1 times [2022-07-20 22:41:14,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:41:14,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869354903] [2022-07-20 22:41:14,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:41:14,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:41:15,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:41:15,182 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-20 22:41:15,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:41:15,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869354903] [2022-07-20 22:41:15,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869354903] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:41:15,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:41:15,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 22:41:15,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575845570] [2022-07-20 22:41:15,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:41:15,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 22:41:15,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:41:15,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 22:41:15,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:41:15,185 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-20 22:41:17,192 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 22:41:19,126 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 22:41:19,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:41:19,521 INFO L93 Difference]: Finished difference Result 8349 states and 12224 transitions. [2022-07-20 22:41:19,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 22:41:19,522 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-20 22:41:19,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:41:19,527 INFO L225 Difference]: With dead ends: 8349 [2022-07-20 22:41:19,527 INFO L226 Difference]: Without dead ends: 4176 [2022-07-20 22:41:19,530 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-20 22:41:19,531 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 7 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.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, 167 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:41:19,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 671 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2022-07-20 22:41:19,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4176 states. [2022-07-20 22:41:19,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4176 to 4176. [2022-07-20 22:41:19,676 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-20 22:41:19,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4176 states to 4176 states and 6113 transitions. [2022-07-20 22:41:19,680 INFO L78 Accepts]: Start accepts. Automaton has 4176 states and 6113 transitions. Word has length 263 [2022-07-20 22:41:19,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:41:19,680 INFO L495 AbstractCegarLoop]: Abstraction has 4176 states and 6113 transitions. [2022-07-20 22:41:19,680 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-20 22:41:19,680 INFO L276 IsEmpty]: Start isEmpty. Operand 4176 states and 6113 transitions. [2022-07-20 22:41:19,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-07-20 22:41:19,686 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:41:19,686 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-20 22:41:19,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-07-20 22:41:19,687 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:41:19,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:41:19,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1001757830, now seen corresponding path program 1 times [2022-07-20 22:41:19,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:41:19,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777903453] [2022-07-20 22:41:19,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:41:19,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:41:20,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:41:20,697 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-20 22:41:20,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:41:20,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777903453] [2022-07-20 22:41:20,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777903453] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:41:20,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837181544] [2022-07-20 22:41:20,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:41:20,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:41:20,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:41:20,704 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-20 22:41:20,705 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-20 22:41:21,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:41:21,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 1497 conjuncts, 72 conjunts are in the unsatisfiable core [2022-07-20 22:41:21,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:41:21,989 INFO L356 Elim1Store]: treesize reduction 71, result has 37.7 percent of original size [2022-07-20 22:41:21,990 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-20 22:41:22,557 INFO L356 Elim1Store]: treesize reduction 126, result has 49.0 percent of original size [2022-07-20 22:41:22,557 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-20 22:41:22,745 INFO L356 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2022-07-20 22:41:22,747 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-20 22:41:22,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-20 22:41:22,947 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-20 22:41:22,948 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 160 context size 160 output size 160 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:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java: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-20 22:41:22,951 INFO L158 Benchmark]: Toolchain (without parser) took 146998.63ms. Allocated memory was 54.5MB in the beginning and 539.0MB in the end (delta: 484.4MB). Free memory was 29.5MB in the beginning and 158.8MB in the end (delta: -129.2MB). Peak memory consumption was 355.9MB. Max. memory is 16.1GB. [2022-07-20 22:41:22,951 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 54.5MB. Free memory is still 36.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 22:41:22,952 INFO L158 Benchmark]: CACSL2BoogieTranslator took 592.21ms. Allocated memory was 54.5MB in the beginning and 73.4MB in the end (delta: 18.9MB). Free memory was 29.3MB in the beginning and 51.7MB in the end (delta: -22.5MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2022-07-20 22:41:22,952 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.79ms. Allocated memory is still 73.4MB. Free memory was 51.7MB in the beginning and 46.7MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-20 22:41:22,952 INFO L158 Benchmark]: Boogie Preprocessor took 106.03ms. Allocated memory is still 73.4MB. Free memory was 46.7MB in the beginning and 39.7MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-20 22:41:22,952 INFO L158 Benchmark]: RCFGBuilder took 1347.27ms. Allocated memory was 73.4MB in the beginning and 98.6MB in the end (delta: 25.2MB). Free memory was 39.5MB in the beginning and 70.2MB in the end (delta: -30.7MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2022-07-20 22:41:22,952 INFO L158 Benchmark]: TraceAbstraction took 144841.20ms. Allocated memory was 98.6MB in the beginning and 539.0MB in the end (delta: 440.4MB). Free memory was 70.2MB in the beginning and 158.8MB in the end (delta: -88.6MB). Peak memory consumption was 353.1MB. Max. memory is 16.1GB. [2022-07-20 22:41:22,953 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.22ms. Allocated memory is still 54.5MB. Free memory is still 36.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 592.21ms. Allocated memory was 54.5MB in the beginning and 73.4MB in the end (delta: 18.9MB). Free memory was 29.3MB in the beginning and 51.7MB in the end (delta: -22.5MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 105.79ms. Allocated memory is still 73.4MB. Free memory was 51.7MB in the beginning and 46.7MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.03ms. Allocated memory is still 73.4MB. Free memory was 46.7MB in the beginning and 39.7MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1347.27ms. Allocated memory was 73.4MB in the beginning and 98.6MB in the end (delta: 25.2MB). Free memory was 39.5MB in the beginning and 70.2MB in the end (delta: -30.7MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. * TraceAbstraction took 144841.20ms. Allocated memory was 98.6MB in the beginning and 539.0MB in the end (delta: 440.4MB). Free memory was 70.2MB in the beginning and 158.8MB in the end (delta: -88.6MB). Peak memory consumption was 353.1MB. 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 160 context size 160 output size 160 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_752| input size 160 context size 160 output size 160: 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-20 22:41:22,991 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-?-3598765 [2022-07-20 22:41:24,891 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 22:41:24,894 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 22:41:24,938 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 22:41:24,939 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 22:41:24,940 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 22:41:24,944 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 22:41:24,947 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 22:41:24,949 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 22:41:24,955 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 22:41:24,957 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 22:41:24,962 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 22:41:24,962 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 22:41:24,964 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 22:41:24,966 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 22:41:24,969 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 22:41:24,969 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 22:41:24,971 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 22:41:24,972 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 22:41:24,978 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 22:41:24,979 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 22:41:24,980 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 22:41:24,982 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 22:41:24,983 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 22:41:24,984 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 22:41:24,987 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 22:41:24,987 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 22:41:24,988 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 22:41:24,988 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 22:41:24,989 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 22:41:24,989 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 22:41:24,990 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 22:41:24,991 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 22:41:24,992 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 22:41:24,993 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 22:41:24,994 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 22:41:24,994 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 22:41:24,995 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 22:41:24,995 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 22:41:24,995 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 22:41:24,996 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 22:41:24,997 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 22:41:24,997 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-20 22:41:25,029 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 22:41:25,030 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 22:41:25,031 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 22:41:25,031 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 22:41:25,032 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 22:41:25,032 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 22:41:25,033 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 22:41:25,033 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 22:41:25,033 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 22:41:25,034 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 22:41:25,034 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 22:41:25,034 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 22:41:25,034 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 22:41:25,035 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 22:41:25,035 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 22:41:25,035 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 22:41:25,035 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 22:41:25,035 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-20 22:41:25,035 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-20 22:41:25,036 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 22:41:25,036 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 22:41:25,036 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 22:41:25,036 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 22:41:25,036 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 22:41:25,037 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 22:41:25,037 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 22:41:25,037 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 22:41:25,037 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 22:41:25,037 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 22:41:25,038 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 22:41:25,038 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-20 22:41:25,038 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-20 22:41:25,038 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 22:41:25,038 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 22:41:25,039 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 22:41:25,039 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-20 22:41:25,039 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-20 22:41:25,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 22:41:25,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 22:41:25,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 22:41:25,438 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 22:41:25,439 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 22:41:25,440 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-20 22:41:25,506 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4429b3e1e/12deba068f754a6199a282d3f3c46ec2/FLAG66f22c1f2 [2022-07-20 22:41:26,070 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 22:41:26,071 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.09.i.cil-1.c [2022-07-20 22:41:26,100 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4429b3e1e/12deba068f754a6199a282d3f3c46ec2/FLAG66f22c1f2 [2022-07-20 22:41:26,340 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4429b3e1e/12deba068f754a6199a282d3f3c46ec2 [2022-07-20 22:41:26,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 22:41:26,344 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 22:41:26,347 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 22:41:26,348 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 22:41:26,351 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 22:41:26,352 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:41:26" (1/1) ... [2022-07-20 22:41:26,355 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b0677cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:41:26, skipping insertion in model container [2022-07-20 22:41:26,356 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:41:26" (1/1) ... [2022-07-20 22:41:26,362 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 22:41:26,413 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 22:41:26,835 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-20 22:41:26,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 22:41:26,857 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-20 22:41:26,869 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 22:41:27,013 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-20 22:41:27,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 22:41:27,030 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 22:41:27,129 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-20 22:41:27,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 22:41:27,146 INFO L208 MainTranslator]: Completed translation [2022-07-20 22:41:27,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:41:27 WrapperNode [2022-07-20 22:41:27,147 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 22:41:27,148 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 22:41:27,149 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 22:41:27,149 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 22:41:27,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:41:27" (1/1) ... [2022-07-20 22:41:27,179 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:41:27" (1/1) ... [2022-07-20 22:41:27,232 INFO L137 Inliner]: procedures = 35, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 762 [2022-07-20 22:41:27,232 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 22:41:27,233 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 22:41:27,233 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 22:41:27,233 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 22:41:27,242 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:41:27" (1/1) ... [2022-07-20 22:41:27,242 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:41:27" (1/1) ... [2022-07-20 22:41:27,250 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:41:27" (1/1) ... [2022-07-20 22:41:27,251 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:41:27" (1/1) ... [2022-07-20 22:41:27,323 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:41:27" (1/1) ... [2022-07-20 22:41:27,336 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:41:27" (1/1) ... [2022-07-20 22:41:27,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:41:27" (1/1) ... [2022-07-20 22:41:27,353 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 22:41:27,362 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 22:41:27,362 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 22:41:27,363 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 22:41:27,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:41:27" (1/1) ... [2022-07-20 22:41:27,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 22:41:27,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:41:27,391 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-20 22:41:27,419 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-20 22:41:27,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 22:41:27,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-20 22:41:27,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 22:41:27,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-20 22:41:27,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 22:41:27,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 22:41:27,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 22:41:27,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 22:41:27,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-20 22:41:27,613 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 22:41:27,615 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 22:41:27,630 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-20 22:41:35,578 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-20 22:41:35,579 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-20 22:41:35,579 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 22:41:35,585 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 22:41:35,586 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-20 22:41:35,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:41:35 BoogieIcfgContainer [2022-07-20 22:41:35,588 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 22:41:35,594 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 22:41:35,595 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 22:41:35,597 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 22:41:35,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 10:41:26" (1/3) ... [2022-07-20 22:41:35,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@627460db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:41:35, skipping insertion in model container [2022-07-20 22:41:35,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:41:27" (2/3) ... [2022-07-20 22:41:35,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@627460db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:41:35, skipping insertion in model container [2022-07-20 22:41:35,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:41:35" (3/3) ... [2022-07-20 22:41:35,601 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.09.i.cil-1.c [2022-07-20 22:41:35,614 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 22:41:35,614 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 22:41:35,687 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 22:41:35,695 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@7bf4a596, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@13cdf330 [2022-07-20 22:41:35,695 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 22:41:35,701 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-20 22:41:35,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-20 22:41:35,711 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:41:35,712 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-20 22:41:35,712 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:41:35,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:41:35,718 INFO L85 PathProgramCache]: Analyzing trace with hash -442385418, now seen corresponding path program 1 times [2022-07-20 22:41:35,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:41:35,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [132832660] [2022-07-20 22:41:35,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:41:35,733 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:41:35,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:41:35,739 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-20 22:41:35,776 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-20 22:41:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:41:36,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 22:41:36,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:41:36,456 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-20 22:41:36,456 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 22:41:36,457 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 22:41:36,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [132832660] [2022-07-20 22:41:36,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [132832660] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:41:36,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:41:36,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:41:36,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069475370] [2022-07-20 22:41:36,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:41:36,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:41:36,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 22:41:36,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:41:36,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:41:36,489 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-20 22:41:36,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:41:36,609 INFO L93 Difference]: Finished difference Result 427 states and 728 transitions. [2022-07-20 22:41:36,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:41:36,612 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-20 22:41:36,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:41:36,622 INFO L225 Difference]: With dead ends: 427 [2022-07-20 22:41:36,622 INFO L226 Difference]: Without dead ends: 261 [2022-07-20 22:41:36,625 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-20 22:41:36,628 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 201 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-20 22:41:36,629 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-20 22:41:36,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-07-20 22:41:36,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2022-07-20 22:41:36,676 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-20 22:41:36,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 394 transitions. [2022-07-20 22:41:36,681 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 394 transitions. Word has length 37 [2022-07-20 22:41:36,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:41:36,682 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 394 transitions. [2022-07-20 22:41:36,682 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-20 22:41:36,683 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 394 transitions. [2022-07-20 22:41:36,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-20 22:41:36,688 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:41:36,688 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-20 22:41:36,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-20 22:41:36,907 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-20 22:41:36,908 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:41:36,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:41:36,908 INFO L85 PathProgramCache]: Analyzing trace with hash 242366870, now seen corresponding path program 1 times [2022-07-20 22:41:36,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:41:36,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1549149041] [2022-07-20 22:41:36,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:41:36,910 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:41:36,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:41:36,911 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-20 22:41:36,913 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-20 22:41:37,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:41:37,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 22:41:37,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:41:37,582 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-20 22:41:37,583 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 22:41:37,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 22:41:37,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1549149041] [2022-07-20 22:41:37,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1549149041] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:41:37,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:41:37,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:41:37,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033128934] [2022-07-20 22:41:37,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:41:37,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:41:37,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 22:41:37,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:41:37,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:41:37,585 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-20 22:41:38,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:41:38,124 INFO L93 Difference]: Finished difference Result 510 states and 781 transitions. [2022-07-20 22:41:38,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:41:38,125 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-20 22:41:38,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:41:38,128 INFO L225 Difference]: With dead ends: 510 [2022-07-20 22:41:38,128 INFO L226 Difference]: Without dead ends: 383 [2022-07-20 22:41:38,129 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-20 22:41:38,130 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-20 22:41:38,130 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-20 22:41:38,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-07-20 22:41:38,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2022-07-20 22:41:38,170 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-20 22:41:38,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 575 transitions. [2022-07-20 22:41:38,171 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 575 transitions. Word has length 54 [2022-07-20 22:41:38,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:41:38,172 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 575 transitions. [2022-07-20 22:41:38,172 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-20 22:41:38,172 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 575 transitions. [2022-07-20 22:41:38,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-20 22:41:38,180 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:41:38,180 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-20 22:41:38,202 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-20 22:41:38,399 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-20 22:41:38,400 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:41:38,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:41:38,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1040793707, now seen corresponding path program 1 times [2022-07-20 22:41:38,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:41:38,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [309697491] [2022-07-20 22:41:38,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:41:38,402 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:41:38,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:41:38,403 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-20 22:41:38,405 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-20 22:41:38,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:41:38,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 22:41:38,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:41:39,054 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-20 22:41:39,054 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 22:41:39,054 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 22:41:39,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [309697491] [2022-07-20 22:41:39,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [309697491] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:41:39,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:41:39,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:41:39,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968662842] [2022-07-20 22:41:39,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:41:39,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:41:39,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 22:41:39,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:41:39,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:41:39,056 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-20 22:41:39,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:41:39,408 INFO L93 Difference]: Finished difference Result 754 states and 1144 transitions. [2022-07-20 22:41:39,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:41:39,408 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-20 22:41:39,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:41:39,411 INFO L225 Difference]: With dead ends: 754 [2022-07-20 22:41:39,411 INFO L226 Difference]: Without dead ends: 505 [2022-07-20 22:41:39,412 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-20 22:41:39,413 INFO L413 NwaCegarLoop]: 380 mSDtfsCounter, 148 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-07-20 22:41:39,413 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.3s Time] [2022-07-20 22:41:39,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-07-20 22:41:39,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2022-07-20 22:41:39,429 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-20 22:41:39,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 757 transitions. [2022-07-20 22:41:39,431 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 757 transitions. Word has length 76 [2022-07-20 22:41:39,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:41:39,431 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 757 transitions. [2022-07-20 22:41:39,431 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-20 22:41:39,431 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 757 transitions. [2022-07-20 22:41:39,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-20 22:41:39,433 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:41:39,433 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-20 22:41:39,455 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-20 22:41:39,652 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-20 22:41:39,653 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:41:39,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:41:39,653 INFO L85 PathProgramCache]: Analyzing trace with hash -792001576, now seen corresponding path program 1 times [2022-07-20 22:41:39,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:41:39,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1659135880] [2022-07-20 22:41:39,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:41:39,655 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:41:39,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:41:39,656 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-20 22:41:39,658 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-20 22:41:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:41:40,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 22:41:40,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:41:40,398 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-20 22:41:40,398 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 22:41:40,399 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 22:41:40,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1659135880] [2022-07-20 22:41:40,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1659135880] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:41:40,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:41:40,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:41:40,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161515998] [2022-07-20 22:41:40,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:41:40,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:41:40,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 22:41:40,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:41:40,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:41:40,400 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-20 22:41:40,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:41:40,751 INFO L93 Difference]: Finished difference Result 1000 states and 1510 transitions. [2022-07-20 22:41:40,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:41:40,752 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-20 22:41:40,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:41:40,754 INFO L225 Difference]: With dead ends: 1000 [2022-07-20 22:41:40,755 INFO L226 Difference]: Without dead ends: 629 [2022-07-20 22:41:40,755 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-20 22:41:40,756 INFO L413 NwaCegarLoop]: 383 mSDtfsCounter, 152 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-07-20 22:41:40,756 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.3s Time] [2022-07-20 22:41:40,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2022-07-20 22:41:40,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2022-07-20 22:41:40,768 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-20 22:41:40,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 941 transitions. [2022-07-20 22:41:40,770 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 941 transitions. Word has length 100 [2022-07-20 22:41:40,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:41:40,771 INFO L495 AbstractCegarLoop]: Abstraction has 629 states and 941 transitions. [2022-07-20 22:41:40,771 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-20 22:41:40,771 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 941 transitions. [2022-07-20 22:41:40,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-20 22:41:40,772 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:41:40,773 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-20 22:41:40,790 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-20 22:41:40,983 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-20 22:41:40,983 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:41:40,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:41:40,984 INFO L85 PathProgramCache]: Analyzing trace with hash -483706638, now seen corresponding path program 1 times [2022-07-20 22:41:40,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:41:40,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [735272132] [2022-07-20 22:41:40,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:41:40,985 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:41:40,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:41:40,986 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-20 22:41:40,988 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-20 22:41:41,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:41:41,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 22:41:41,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:41:41,650 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-20 22:41:41,651 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 22:41:41,651 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 22:41:41,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [735272132] [2022-07-20 22:41:41,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [735272132] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:41:41,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:41:41,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:41:41,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577886049] [2022-07-20 22:41:41,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:41:41,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:41:41,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 22:41:41,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:41:41,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:41:41,654 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-20 22:41:42,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:41:42,193 INFO L93 Difference]: Finished difference Result 1244 states and 1871 transitions. [2022-07-20 22:41:42,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:41:42,194 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-20 22:41:42,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:41:42,197 INFO L225 Difference]: With dead ends: 1244 [2022-07-20 22:41:42,197 INFO L226 Difference]: Without dead ends: 749 [2022-07-20 22:41:42,198 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-20 22:41:42,199 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-20 22:41:42,199 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-20 22:41:42,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2022-07-20 22:41:42,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 749. [2022-07-20 22:41:42,225 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-20 22:41:42,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1120 transitions. [2022-07-20 22:41:42,229 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1120 transitions. Word has length 117 [2022-07-20 22:41:42,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:41:42,230 INFO L495 AbstractCegarLoop]: Abstraction has 749 states and 1120 transitions. [2022-07-20 22:41:42,230 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-20 22:41:42,230 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1120 transitions. [2022-07-20 22:41:42,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-20 22:41:42,235 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:41:42,235 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-20 22:41:42,261 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-20 22:41:42,455 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-20 22:41:42,456 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:41:42,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:41:42,456 INFO L85 PathProgramCache]: Analyzing trace with hash 686668759, now seen corresponding path program 1 times [2022-07-20 22:41:42,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:41:42,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [845250049] [2022-07-20 22:41:42,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:41:42,457 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:41:42,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:41:42,458 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-20 22:41:42,459 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-20 22:41:43,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:41:43,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 22:41:43,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:41:43,220 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-20 22:41:43,220 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 22:41:43,220 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 22:41:43,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [845250049] [2022-07-20 22:41:43,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [845250049] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:41:43,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:41:43,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:41:43,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373045123] [2022-07-20 22:41:43,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:41:43,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:41:43,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 22:41:43,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:41:43,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:41:43,222 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-20 22:41:43,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:41:43,929 INFO L93 Difference]: Finished difference Result 1486 states and 2233 transitions. [2022-07-20 22:41:43,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:41:43,930 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-20 22:41:43,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:41:43,933 INFO L225 Difference]: With dead ends: 1486 [2022-07-20 22:41:43,933 INFO L226 Difference]: Without dead ends: 871 [2022-07-20 22:41:43,935 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-20 22:41:43,935 INFO L413 NwaCegarLoop]: 380 mSDtfsCounter, 149 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.7s IncrementalHoareTripleChecker+Time [2022-07-20 22:41:43,936 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.7s Time] [2022-07-20 22:41:43,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2022-07-20 22:41:43,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 871. [2022-07-20 22:41:43,953 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-20 22:41:43,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1301 transitions. [2022-07-20 22:41:43,955 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1301 transitions. Word has length 129 [2022-07-20 22:41:43,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:41:43,955 INFO L495 AbstractCegarLoop]: Abstraction has 871 states and 1301 transitions. [2022-07-20 22:41:43,955 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-20 22:41:43,956 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1301 transitions. [2022-07-20 22:41:43,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-07-20 22:41:43,958 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:41:43,958 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-20 22:41:43,987 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-20 22:41:44,180 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-20 22:41:44,181 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:41:44,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:41:44,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1815233301, now seen corresponding path program 1 times [2022-07-20 22:41:44,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:41:44,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [278262197] [2022-07-20 22:41:44,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:41:44,182 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:41:44,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:41:44,183 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-20 22:41:44,185 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-20 22:41:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:41:44,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 22:41:44,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:41:44,997 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-20 22:41:44,997 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 22:41:44,997 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 22:41:44,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [278262197] [2022-07-20 22:41:44,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [278262197] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:41:44,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:41:44,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 22:41:44,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315188644] [2022-07-20 22:41:44,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:41:44,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 22:41:44,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 22:41:44,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 22:41:44,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 22:41:44,999 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-20 22:41:45,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:41:45,956 INFO L93 Difference]: Finished difference Result 1732 states and 2597 transitions. [2022-07-20 22:41:45,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 22:41:45,956 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-20 22:41:45,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:41:45,961 INFO L225 Difference]: With dead ends: 1732 [2022-07-20 22:41:45,961 INFO L226 Difference]: Without dead ends: 995 [2022-07-20 22:41:45,963 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-20 22:41:45,964 INFO L413 NwaCegarLoop]: 384 mSDtfsCounter, 151 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.9s IncrementalHoareTripleChecker+Time [2022-07-20 22:41:45,965 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.9s Time] [2022-07-20 22:41:45,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2022-07-20 22:41:45,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 995. [2022-07-20 22:41:45,983 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-20 22:41:45,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1485 transitions. [2022-07-20 22:41:45,987 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1485 transitions. Word has length 160 [2022-07-20 22:41:45,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:41:45,988 INFO L495 AbstractCegarLoop]: Abstraction has 995 states and 1485 transitions. [2022-07-20 22:41:45,988 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-20 22:41:45,988 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1485 transitions. [2022-07-20 22:41:45,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-20 22:41:45,991 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:41:45,991 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-20 22:41:46,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-20 22:41:46,207 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-20 22:41:46,207 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:41:46,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:41:46,208 INFO L85 PathProgramCache]: Analyzing trace with hash -2092203957, now seen corresponding path program 1 times [2022-07-20 22:41:46,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:41:46,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1185777420] [2022-07-20 22:41:46,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:41:46,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:41:46,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:41:46,212 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-20 22:41:46,214 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-20 22:41:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:41:47,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 1052 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-20 22:41:47,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:41:47,736 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-20 22:41:47,748 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-20 22:41:48,349 INFO L356 Elim1Store]: treesize reduction 1496, result has 4.7 percent of original size [2022-07-20 22:41:48,351 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-20 22:41:48,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,445 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-20 22:41:48,635 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-20 22:41:48,635 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-20 22:41:48,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:41:48,667 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-20 22:41:48,691 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-20 22:41:48,697 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-20 22:41:48,724 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-20 22:41:48,725 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 22:41:48,725 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 22:41:48,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1185777420] [2022-07-20 22:41:48,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1185777420] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:41:48,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:41:48,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 22:41:48,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099974379] [2022-07-20 22:41:48,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:41:48,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 22:41:48,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 22:41:48,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 22:41:48,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:41:48,727 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-20 22:41:50,749 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-20 22:41:52,760 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-20 22:42:02,728 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 22:42:03,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:42:03,296 INFO L93 Difference]: Finished difference Result 1987 states and 2966 transitions. [2022-07-20 22:42:03,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 22:42:03,298 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-20 22:42:03,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:42:03,304 INFO L225 Difference]: With dead ends: 1987 [2022-07-20 22:42:03,304 INFO L226 Difference]: Without dead ends: 995 [2022-07-20 22:42:03,306 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-20 22:42:03,306 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 7 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.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, 166 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2022-07-20 22:42:03,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 671 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 2 Unknown, 0 Unchecked, 14.4s Time] [2022-07-20 22:42:03,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2022-07-20 22:42:03,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 995. [2022-07-20 22:42:03,323 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-20 22:42:03,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1484 transitions. [2022-07-20 22:42:03,327 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1484 transitions. Word has length 174 [2022-07-20 22:42:03,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:42:03,327 INFO L495 AbstractCegarLoop]: Abstraction has 995 states and 1484 transitions. [2022-07-20 22:42:03,327 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-20 22:42:03,327 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1484 transitions. [2022-07-20 22:42:03,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-20 22:42:03,330 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:42:03,330 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-20 22:42:03,369 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-20 22:42:03,546 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-20 22:42:03,547 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:42:03,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:42:03,547 INFO L85 PathProgramCache]: Analyzing trace with hash 834302729, now seen corresponding path program 1 times [2022-07-20 22:42:03,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:42:03,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2114443470] [2022-07-20 22:42:03,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:42:03,548 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:42:03,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:42:03,549 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-20 22:42:03,550 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-20 22:42:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:42:05,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 1070 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 22:42:05,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:42:05,406 INFO L356 Elim1Store]: treesize reduction 180, result has 14.3 percent of original size [2022-07-20 22:42:05,406 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-20 22:42:05,565 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-20 22:42:05,565 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-20 22:42:05,658 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-20 22:42:05,658 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-20 22:42:05,683 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-20 22:42:05,683 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 22:42:05,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 22:42:05,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2114443470] [2022-07-20 22:42:05,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2114443470] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:42:05,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:42:05,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:42:05,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774939337] [2022-07-20 22:42:05,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:42:05,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:42:05,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 22:42:05,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:42:05,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:42:05,686 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-20 22:42:07,706 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-20 22:42:08,752 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 22:42:14,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:42:14,598 INFO L93 Difference]: Finished difference Result 2352 states and 3512 transitions. [2022-07-20 22:42:14,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:42:14,601 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-20 22:42:14,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:42:14,606 INFO L225 Difference]: With dead ends: 2352 [2022-07-20 22:42:14,606 INFO L226 Difference]: Without dead ends: 1367 [2022-07-20 22:42:14,608 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-20 22:42:14,608 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 36 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s 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, 8.9s IncrementalHoareTripleChecker+Time [2022-07-20 22:42:14,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 590 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 139 Invalid, 1 Unknown, 41 Unchecked, 8.9s Time] [2022-07-20 22:42:14,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2022-07-20 22:42:14,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1202. [2022-07-20 22:42:14,635 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-20 22:42:14,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1835 transitions. [2022-07-20 22:42:14,639 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1835 transitions. Word has length 174 [2022-07-20 22:42:14,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:42:14,639 INFO L495 AbstractCegarLoop]: Abstraction has 1202 states and 1835 transitions. [2022-07-20 22:42:14,639 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-20 22:42:14,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1835 transitions. [2022-07-20 22:42:14,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-20 22:42:14,642 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:42:14,642 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-20 22:42:14,684 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-20 22:42:14,855 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-20 22:42:14,855 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:42:14,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:42:14,856 INFO L85 PathProgramCache]: Analyzing trace with hash 289430155, now seen corresponding path program 1 times [2022-07-20 22:42:14,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:42:14,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [445038431] [2022-07-20 22:42:14,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:42:14,857 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:42:14,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:42:14,859 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-20 22:42:14,861 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-20 22:42:16,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:42:16,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 1070 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 22:42:16,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:42:16,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:42:16,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:42:16,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:42:16,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:42:16,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:42:16,800 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:42:17,189 INFO L356 Elim1Store]: treesize reduction 1109, result has 5.5 percent of original size [2022-07-20 22:42:17,189 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-20 22:42:17,666 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-20 22:42:17,666 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-20 22:42:17,680 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-20 22:42:17,680 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 22:42:17,680 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 22:42:17,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [445038431] [2022-07-20 22:42:17,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [445038431] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:42:17,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:42:17,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:42:17,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609147702] [2022-07-20 22:42:17,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:42:17,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:42:17,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 22:42:17,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:42:17,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:42:17,683 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-20 22:42:19,706 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-20 22:42:21,661 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 22:42:22,854 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 22:42:25,145 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 22:42:28,671 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 22:42:32,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:42:32,963 INFO L93 Difference]: Finished difference Result 2902 states and 4439 transitions. [2022-07-20 22:42:32,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:42:32,970 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-20 22:42:32,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:42:32,976 INFO L225 Difference]: With dead ends: 2902 [2022-07-20 22:42:32,976 INFO L226 Difference]: Without dead ends: 1710 [2022-07-20 22:42:32,978 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-20 22:42:32,978 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 56 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.8s 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, 15.2s IncrementalHoareTripleChecker+Time [2022-07-20 22:42:32,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 617 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 221 Invalid, 1 Unknown, 0 Unchecked, 15.2s Time] [2022-07-20 22:42:32,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2022-07-20 22:42:33,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 1426. [2022-07-20 22:42:33,019 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-20 22:42:33,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 2235 transitions. [2022-07-20 22:42:33,022 INFO L78 Accepts]: Start accepts. Automaton has 1426 states and 2235 transitions. Word has length 174 [2022-07-20 22:42:33,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:42:33,022 INFO L495 AbstractCegarLoop]: Abstraction has 1426 states and 2235 transitions. [2022-07-20 22:42:33,023 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-20 22:42:33,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 2235 transitions. [2022-07-20 22:42:33,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-07-20 22:42:33,026 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:42:33,026 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-20 22:42:33,060 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-20 22:42:33,239 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-20 22:42:33,239 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:42:33,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:42:33,240 INFO L85 PathProgramCache]: Analyzing trace with hash -975340285, now seen corresponding path program 1 times [2022-07-20 22:42:33,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:42:33,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [625329611] [2022-07-20 22:42:33,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:42:33,241 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:42:33,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:42:33,242 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-20 22:42:33,243 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-20 22:42:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:42:34,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 1165 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 22:42:34,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:42:35,262 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-20 22:42:35,262 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-20 22:42:35,308 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-20 22:42:35,309 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-20 22:42:35,344 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-20 22:42:35,344 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 22:42:35,345 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 22:42:35,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [625329611] [2022-07-20 22:42:35,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [625329611] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:42:35,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:42:35,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:42:35,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38831465] [2022-07-20 22:42:35,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:42:35,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:42:35,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 22:42:35,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:42:35,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:42:35,347 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-20 22:42:37,378 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-20 22:42:39,150 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 22:42:43,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:42:43,177 INFO L93 Difference]: Finished difference Result 2930 states and 4569 transitions. [2022-07-20 22:42:43,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:42:43,180 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-20 22:42:43,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:42:43,185 INFO L225 Difference]: With dead ends: 2930 [2022-07-20 22:42:43,185 INFO L226 Difference]: Without dead ends: 1514 [2022-07-20 22:42:43,187 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-20 22:42:43,188 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 22 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s 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, 7.8s IncrementalHoareTripleChecker+Time [2022-07-20 22:42:43,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 565 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 118 Invalid, 1 Unknown, 22 Unchecked, 7.8s Time] [2022-07-20 22:42:43,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2022-07-20 22:42:43,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1426. [2022-07-20 22:42:43,222 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-20 22:42:43,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 2227 transitions. [2022-07-20 22:42:43,226 INFO L78 Accepts]: Start accepts. Automaton has 1426 states and 2227 transitions. Word has length 187 [2022-07-20 22:42:43,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:42:43,226 INFO L495 AbstractCegarLoop]: Abstraction has 1426 states and 2227 transitions. [2022-07-20 22:42:43,226 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-20 22:42:43,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 2227 transitions. [2022-07-20 22:42:43,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-07-20 22:42:43,230 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:42:43,230 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-20 22:42:43,275 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-20 22:42:43,447 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-20 22:42:43,447 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:42:43,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:42:43,448 INFO L85 PathProgramCache]: Analyzing trace with hash 988941552, now seen corresponding path program 1 times [2022-07-20 22:42:43,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:42:43,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1518194041] [2022-07-20 22:42:43,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:42:43,449 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:42:43,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:42:43,450 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-20 22:42:43,451 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-20 22:42:45,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:42:45,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 1200 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 22:42:45,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:42:45,786 INFO L356 Elim1Store]: treesize reduction 1101, result has 5.5 percent of original size [2022-07-20 22:42:45,786 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-20 22:42:45,821 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-20 22:42:45,822 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-20 22:42:45,838 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-20 22:42:45,839 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 22:42:45,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 22:42:45,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1518194041] [2022-07-20 22:42:45,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1518194041] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:42:45,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:42:45,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:42:45,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219568376] [2022-07-20 22:42:45,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:42:45,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:42:45,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 22:42:45,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:42:45,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:42:45,851 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-20 22:42:47,873 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 []