./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl/s3_srvr.blast.16.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl/s3_srvr.blast.16.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 0b79f6e49ac032444452c6675a01007f08f3b698920d88701561807a0669494d --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:42:02,629 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:42:02,630 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:42:02,669 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:42:02,670 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:42:02,672 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:42:02,674 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:42:02,679 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:42:02,681 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:42:02,687 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:42:02,688 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:42:02,689 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:42:02,690 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:42:02,691 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:42:02,693 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:42:02,694 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:42:02,698 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:42:02,698 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:42:02,700 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:42:02,703 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:42:02,706 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:42:02,708 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:42:02,709 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:42:02,710 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:42:02,712 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:42:02,716 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:42:02,717 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:42:02,717 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:42:02,719 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:42:02,719 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:42:02,720 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:42:02,720 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:42:02,722 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:42:02,722 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:42:02,723 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:42:02,724 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:42:02,724 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:42:02,724 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:42:02,725 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:42:02,725 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:42:02,726 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:42:02,728 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:42:02,729 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 11:42:02,765 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:42:02,766 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:42:02,766 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:42:02,766 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:42:02,767 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:42:02,767 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:42:02,768 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:42:02,768 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:42:02,768 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:42:02,769 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:42:02,769 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:42:02,770 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 11:42:02,770 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:42:02,770 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:42:02,770 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:42:02,770 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:42:02,771 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:42:02,771 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:42:02,771 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:42:02,772 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:42:02,773 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:42:02,773 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:42:02,773 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:42:02,773 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:42:02,773 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:42:02,774 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:42:02,774 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:42:02,774 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:42:02,774 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 11:42:02,774 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 11:42:02,775 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:42:02,775 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:42:02,775 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:42:02,775 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 -> 0b79f6e49ac032444452c6675a01007f08f3b698920d88701561807a0669494d [2022-07-13 11:42:03,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:42:03,026 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:42:03,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:42:03,029 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:42:03,031 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:42:03,032 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.16.i.cil-1.c [2022-07-13 11:42:03,092 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/417c2fd98/5afe6ee331d44114a65b028abc30bed0/FLAG4f634f5de [2022-07-13 11:42:03,652 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:42:03,653 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.16.i.cil-1.c [2022-07-13 11:42:03,678 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/417c2fd98/5afe6ee331d44114a65b028abc30bed0/FLAG4f634f5de [2022-07-13 11:42:04,123 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/417c2fd98/5afe6ee331d44114a65b028abc30bed0 [2022-07-13 11:42:04,125 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:42:04,127 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:42:04,128 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:42:04,128 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:42:04,132 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:42:04,133 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:42:04" (1/1) ... [2022-07-13 11:42:04,135 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ae96d72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:42:04, skipping insertion in model container [2022-07-13 11:42:04,135 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:42:04" (1/1) ... [2022-07-13 11:42:04,142 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:42:04,200 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:42:04,539 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.16.i.cil-1.c[77378,77391] [2022-07-13 11:42:04,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:42:04,571 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:42:04,733 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.16.i.cil-1.c[77378,77391] [2022-07-13 11:42:04,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:42:04,757 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:42:04,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:42:04 WrapperNode [2022-07-13 11:42:04,758 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:42:04,759 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:42:04,759 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:42:04,760 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:42:04,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:42:04" (1/1) ... [2022-07-13 11:42:04,798 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:42:04" (1/1) ... [2022-07-13 11:42:04,849 INFO L137 Inliner]: procedures = 31, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 809 [2022-07-13 11:42:04,850 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:42:04,851 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:42:04,851 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:42:04,851 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:42:04,858 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:42:04" (1/1) ... [2022-07-13 11:42:04,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:42:04" (1/1) ... [2022-07-13 11:42:04,880 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:42:04" (1/1) ... [2022-07-13 11:42:04,882 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:42:04" (1/1) ... [2022-07-13 11:42:04,931 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:42:04" (1/1) ... [2022-07-13 11:42:04,937 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:42:04" (1/1) ... [2022-07-13 11:42:04,939 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:42:04" (1/1) ... [2022-07-13 11:42:04,950 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:42:04,951 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:42:04,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:42:04,952 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:42:04,953 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:42:04" (1/1) ... [2022-07-13 11:42:04,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:42:04,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:42:04,993 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 11:42:05,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 11:42:05,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:42:05,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 11:42:05,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 11:42:05,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 11:42:05,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 11:42:05,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 11:42:05,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 11:42:05,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:42:05,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:42:05,162 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:42:05,164 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:42:05,178 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:42:07,605 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-13 11:42:07,605 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-13 11:42:07,605 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:42:07,612 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:42:07,612 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 11:42:07,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:42:07 BoogieIcfgContainer [2022-07-13 11:42:07,614 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:42:07,616 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:42:07,616 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:42:07,619 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:42:07,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:42:04" (1/3) ... [2022-07-13 11:42:07,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bfc6a65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:42:07, skipping insertion in model container [2022-07-13 11:42:07,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:42:04" (2/3) ... [2022-07-13 11:42:07,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bfc6a65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:42:07, skipping insertion in model container [2022-07-13 11:42:07,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:42:07" (3/3) ... [2022-07-13 11:42:07,622 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.16.i.cil-1.c [2022-07-13 11:42:07,634 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:42:07,634 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:42:07,684 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:42:07,690 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@48d97a9d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6401f171 [2022-07-13 11:42:07,690 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:42:07,695 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 156 states have (on average 1.7307692307692308) internal successors, (270), 157 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:07,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 11:42:07,704 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:07,704 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:42:07,705 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:07,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:07,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1590777092, now seen corresponding path program 1 times [2022-07-13 11:42:07,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:07,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101026963] [2022-07-13 11:42:07,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:07,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:08,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:42:08,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:08,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101026963] [2022-07-13 11:42:08,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101026963] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:08,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:08,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:08,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149443801] [2022-07-13 11:42:08,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:08,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:08,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:08,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:08,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:08,296 INFO L87 Difference]: Start difference. First operand has 158 states, 156 states have (on average 1.7307692307692308) internal successors, (270), 157 states have internal predecessors, (270), 0 states have call successors, (0), 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 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:09,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:09,230 INFO L93 Difference]: Finished difference Result 444 states and 762 transitions. [2022-07-13 11:42:09,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:09,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2022-07-13 11:42:09,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:09,246 INFO L225 Difference]: With dead ends: 444 [2022-07-13 11:42:09,248 INFO L226 Difference]: Without dead ends: 271 [2022-07-13 11:42:09,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:09,258 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 170 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:09,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 489 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-13 11:42:09,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-07-13 11:42:09,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 185. [2022-07-13 11:42:09,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.625) internal successors, (299), 184 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:09,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 299 transitions. [2022-07-13 11:42:09,331 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 299 transitions. Word has length 45 [2022-07-13 11:42:09,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:09,332 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 299 transitions. [2022-07-13 11:42:09,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:09,333 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 299 transitions. [2022-07-13 11:42:09,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-13 11:42:09,340 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:09,340 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:42:09,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 11:42:09,341 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:09,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:09,343 INFO L85 PathProgramCache]: Analyzing trace with hash -956498629, now seen corresponding path program 1 times [2022-07-13 11:42:09,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:09,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044990383] [2022-07-13 11:42:09,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:09,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:09,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:09,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:42:09,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:09,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044990383] [2022-07-13 11:42:09,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044990383] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:09,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:09,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:09,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354517328] [2022-07-13 11:42:09,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:09,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:09,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:09,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:09,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:09,489 INFO L87 Difference]: Start difference. First operand 185 states and 299 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:11,497 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-13 11:42:11,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:11,867 INFO L93 Difference]: Finished difference Result 388 states and 625 transitions. [2022-07-13 11:42:11,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:11,868 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-07-13 11:42:11,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:11,870 INFO L225 Difference]: With dead ends: 388 [2022-07-13 11:42:11,870 INFO L226 Difference]: Without dead ends: 213 [2022-07-13 11:42:11,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:11,872 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 22 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:11,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 517 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 150 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-07-13 11:42:11,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-07-13 11:42:11,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 196. [2022-07-13 11:42:11,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 195 states have (on average 1.6307692307692307) internal successors, (318), 195 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:11,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 318 transitions. [2022-07-13 11:42:11,888 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 318 transitions. Word has length 46 [2022-07-13 11:42:11,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:11,889 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 318 transitions. [2022-07-13 11:42:11,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:11,890 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 318 transitions. [2022-07-13 11:42:11,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-13 11:42:11,894 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:11,895 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:42:11,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 11:42:11,900 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:11,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:11,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1903034717, now seen corresponding path program 1 times [2022-07-13 11:42:11,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:11,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27337138] [2022-07-13 11:42:11,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:11,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:12,060 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:42:12,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:12,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27337138] [2022-07-13 11:42:12,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27337138] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:12,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:12,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:12,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179901808] [2022-07-13 11:42:12,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:12,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:12,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:12,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:12,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:12,063 INFO L87 Difference]: Start difference. First operand 196 states and 318 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:13,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:13,291 INFO L93 Difference]: Finished difference Result 535 states and 873 transitions. [2022-07-13 11:42:13,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:13,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-07-13 11:42:13,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:13,294 INFO L225 Difference]: With dead ends: 535 [2022-07-13 11:42:13,294 INFO L226 Difference]: Without dead ends: 360 [2022-07-13 11:42:13,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:13,296 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 159 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 694 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.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:13,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 694 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-13 11:42:13,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-07-13 11:42:13,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 228. [2022-07-13 11:42:13,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.6255506607929515) internal successors, (369), 227 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:13,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 369 transitions. [2022-07-13 11:42:13,307 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 369 transitions. Word has length 59 [2022-07-13 11:42:13,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:13,307 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 369 transitions. [2022-07-13 11:42:13,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:13,308 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 369 transitions. [2022-07-13 11:42:13,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-13 11:42:13,309 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:13,309 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:42:13,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 11:42:13,309 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:13,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:13,310 INFO L85 PathProgramCache]: Analyzing trace with hash 23257778, now seen corresponding path program 1 times [2022-07-13 11:42:13,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:13,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929990109] [2022-07-13 11:42:13,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:13,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:13,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:13,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:42:13,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:13,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929990109] [2022-07-13 11:42:13,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929990109] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:13,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:13,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:13,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653673972] [2022-07-13 11:42:13,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:13,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:13,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:13,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:13,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:13,461 INFO L87 Difference]: Start difference. First operand 228 states and 369 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:14,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:14,798 INFO L93 Difference]: Finished difference Result 543 states and 876 transitions. [2022-07-13 11:42:14,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:14,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2022-07-13 11:42:14,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:14,801 INFO L225 Difference]: With dead ends: 543 [2022-07-13 11:42:14,801 INFO L226 Difference]: Without dead ends: 336 [2022-07-13 11:42:14,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:14,802 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 164 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 382 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.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:14,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 382 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-13 11:42:14,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-07-13 11:42:14,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 228. [2022-07-13 11:42:14,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.6079295154185023) internal successors, (365), 227 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:14,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 365 transitions. [2022-07-13 11:42:14,811 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 365 transitions. Word has length 60 [2022-07-13 11:42:14,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:14,811 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 365 transitions. [2022-07-13 11:42:14,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:14,812 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 365 transitions. [2022-07-13 11:42:14,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-13 11:42:14,813 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:14,813 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:42:14,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 11:42:14,813 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:14,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:14,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1612277602, now seen corresponding path program 1 times [2022-07-13 11:42:14,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:14,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368225313] [2022-07-13 11:42:14,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:14,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:14,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:42:14,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:14,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368225313] [2022-07-13 11:42:14,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368225313] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:14,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:14,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:14,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836577838] [2022-07-13 11:42:14,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:14,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:14,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:14,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:14,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:14,949 INFO L87 Difference]: Start difference. First operand 228 states and 365 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:16,609 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:42:16,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:16,857 INFO L93 Difference]: Finished difference Result 451 states and 719 transitions. [2022-07-13 11:42:16,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:16,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2022-07-13 11:42:16,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:16,861 INFO L225 Difference]: With dead ends: 451 [2022-07-13 11:42:16,861 INFO L226 Difference]: Without dead ends: 244 [2022-07-13 11:42:16,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:16,862 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 26 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:16,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 521 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-13 11:42:16,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-07-13 11:42:16,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 228. [2022-07-13 11:42:16,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.60352422907489) internal successors, (364), 227 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:16,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 364 transitions. [2022-07-13 11:42:16,875 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 364 transitions. Word has length 60 [2022-07-13 11:42:16,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:16,875 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 364 transitions. [2022-07-13 11:42:16,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:16,877 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 364 transitions. [2022-07-13 11:42:16,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-13 11:42:16,878 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:16,878 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:42:16,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 11:42:16,879 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:16,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:16,880 INFO L85 PathProgramCache]: Analyzing trace with hash 2036873383, now seen corresponding path program 1 times [2022-07-13 11:42:16,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:16,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754880682] [2022-07-13 11:42:16,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:16,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:17,028 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:42:17,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:17,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754880682] [2022-07-13 11:42:17,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754880682] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:17,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:17,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:17,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310345437] [2022-07-13 11:42:17,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:17,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:17,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:17,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:17,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:17,030 INFO L87 Difference]: Start difference. First operand 228 states and 364 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:18,605 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:42:18,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:18,850 INFO L93 Difference]: Finished difference Result 450 states and 717 transitions. [2022-07-13 11:42:18,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:18,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2022-07-13 11:42:18,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:18,853 INFO L225 Difference]: With dead ends: 450 [2022-07-13 11:42:18,853 INFO L226 Difference]: Without dead ends: 243 [2022-07-13 11:42:18,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:18,854 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 19 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:18,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 523 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-13 11:42:18,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-07-13 11:42:18,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 228. [2022-07-13 11:42:18,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.5991189427312775) internal successors, (363), 227 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:18,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 363 transitions. [2022-07-13 11:42:18,860 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 363 transitions. Word has length 60 [2022-07-13 11:42:18,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:18,861 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 363 transitions. [2022-07-13 11:42:18,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:18,861 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 363 transitions. [2022-07-13 11:42:18,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-13 11:42:18,862 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:18,862 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:42:18,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 11:42:18,863 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:18,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:18,863 INFO L85 PathProgramCache]: Analyzing trace with hash 66586599, now seen corresponding path program 1 times [2022-07-13 11:42:18,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:18,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986298697] [2022-07-13 11:42:18,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:18,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:18,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:18,958 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:42:18,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:18,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986298697] [2022-07-13 11:42:18,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986298697] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:18,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:18,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:18,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148468767] [2022-07-13 11:42:18,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:18,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:18,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:18,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:18,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:18,961 INFO L87 Difference]: Start difference. First operand 228 states and 363 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:20,331 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-13 11:42:20,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:20,688 INFO L93 Difference]: Finished difference Result 543 states and 867 transitions. [2022-07-13 11:42:20,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:20,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2022-07-13 11:42:20,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:20,690 INFO L225 Difference]: With dead ends: 543 [2022-07-13 11:42:20,690 INFO L226 Difference]: Without dead ends: 336 [2022-07-13 11:42:20,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:20,691 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 157 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 382 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.7s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:20,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 382 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-13 11:42:20,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-07-13 11:42:20,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 229. [2022-07-13 11:42:20,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.587719298245614) internal successors, (362), 228 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:20,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 362 transitions. [2022-07-13 11:42:20,698 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 362 transitions. Word has length 60 [2022-07-13 11:42:20,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:20,698 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 362 transitions. [2022-07-13 11:42:20,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:20,699 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 362 transitions. [2022-07-13 11:42:20,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-13 11:42:20,699 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:20,700 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:42:20,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 11:42:20,700 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:20,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:20,701 INFO L85 PathProgramCache]: Analyzing trace with hash 415717658, now seen corresponding path program 1 times [2022-07-13 11:42:20,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:20,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846346266] [2022-07-13 11:42:20,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:20,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:20,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:20,782 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:42:20,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:20,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846346266] [2022-07-13 11:42:20,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846346266] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:20,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:20,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:20,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703093326] [2022-07-13 11:42:20,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:20,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:20,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:20,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:20,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:20,785 INFO L87 Difference]: Start difference. First operand 229 states and 362 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:21,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:21,472 INFO L93 Difference]: Finished difference Result 450 states and 713 transitions. [2022-07-13 11:42:21,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:21,472 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2022-07-13 11:42:21,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:21,474 INFO L225 Difference]: With dead ends: 450 [2022-07-13 11:42:21,474 INFO L226 Difference]: Without dead ends: 242 [2022-07-13 11:42:21,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:21,475 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 22 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:21,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 527 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 11:42:21,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-07-13 11:42:21,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 229. [2022-07-13 11:42:21,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.5833333333333333) internal successors, (361), 228 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:21,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 361 transitions. [2022-07-13 11:42:21,481 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 361 transitions. Word has length 61 [2022-07-13 11:42:21,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:21,481 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 361 transitions. [2022-07-13 11:42:21,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:21,481 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 361 transitions. [2022-07-13 11:42:21,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-13 11:42:21,482 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:21,482 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:42:21,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 11:42:21,482 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:21,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:21,482 INFO L85 PathProgramCache]: Analyzing trace with hash -588000903, now seen corresponding path program 1 times [2022-07-13 11:42:21,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:21,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593829400] [2022-07-13 11:42:21,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:21,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:21,588 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:42:21,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:21,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593829400] [2022-07-13 11:42:21,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593829400] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:21,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:21,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:21,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904585763] [2022-07-13 11:42:21,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:21,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:21,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:21,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:21,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:21,590 INFO L87 Difference]: Start difference. First operand 229 states and 361 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:22,608 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:42:22,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:22,809 INFO L93 Difference]: Finished difference Result 450 states and 712 transitions. [2022-07-13 11:42:22,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:22,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-07-13 11:42:22,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:22,811 INFO L225 Difference]: With dead ends: 450 [2022-07-13 11:42:22,812 INFO L226 Difference]: Without dead ends: 242 [2022-07-13 11:42:22,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:22,813 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 20 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 527 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.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:22,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 527 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-13 11:42:22,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-07-13 11:42:22,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 229. [2022-07-13 11:42:22,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.5789473684210527) internal successors, (360), 228 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:22,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 360 transitions. [2022-07-13 11:42:22,818 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 360 transitions. Word has length 62 [2022-07-13 11:42:22,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:22,819 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 360 transitions. [2022-07-13 11:42:22,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:22,819 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 360 transitions. [2022-07-13 11:42:22,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-13 11:42:22,820 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:22,820 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:42:22,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 11:42:22,821 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:22,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:22,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1085567403, now seen corresponding path program 1 times [2022-07-13 11:42:22,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:22,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825366787] [2022-07-13 11:42:22,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:22,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:22,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:22,912 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:42:22,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:22,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825366787] [2022-07-13 11:42:22,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825366787] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:22,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:22,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:22,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970544319] [2022-07-13 11:42:22,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:22,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:22,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:22,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:22,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:22,915 INFO L87 Difference]: Start difference. First operand 229 states and 360 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:23,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:23,840 INFO L93 Difference]: Finished difference Result 440 states and 698 transitions. [2022-07-13 11:42:23,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:23,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-07-13 11:42:23,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:23,842 INFO L225 Difference]: With dead ends: 440 [2022-07-13 11:42:23,842 INFO L226 Difference]: Without dead ends: 232 [2022-07-13 11:42:23,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:23,843 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 11 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 541 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.9s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:23,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 541 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-13 11:42:23,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-07-13 11:42:23,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 229. [2022-07-13 11:42:23,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.5745614035087718) internal successors, (359), 228 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:23,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 359 transitions. [2022-07-13 11:42:23,850 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 359 transitions. Word has length 63 [2022-07-13 11:42:23,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:23,850 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 359 transitions. [2022-07-13 11:42:23,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:23,851 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 359 transitions. [2022-07-13 11:42:23,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-13 11:42:23,851 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:23,852 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:42:23,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 11:42:23,852 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:23,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:23,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1421192685, now seen corresponding path program 1 times [2022-07-13 11:42:23,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:23,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452483555] [2022-07-13 11:42:23,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:23,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:23,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:23,957 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:42:23,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:23,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452483555] [2022-07-13 11:42:23,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452483555] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:23,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:23,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:23,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945847380] [2022-07-13 11:42:23,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:23,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:23,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:23,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:23,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:23,960 INFO L87 Difference]: Start difference. First operand 229 states and 359 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:24,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:24,502 INFO L93 Difference]: Finished difference Result 477 states and 753 transitions. [2022-07-13 11:42:24,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:24,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-07-13 11:42:24,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:24,504 INFO L225 Difference]: With dead ends: 477 [2022-07-13 11:42:24,504 INFO L226 Difference]: Without dead ends: 269 [2022-07-13 11:42:24,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:24,505 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 31 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:24,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 545 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 11:42:24,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-07-13 11:42:24,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 251. [2022-07-13 11:42:24,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 1.576) internal successors, (394), 250 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:24,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 394 transitions. [2022-07-13 11:42:24,512 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 394 transitions. Word has length 63 [2022-07-13 11:42:24,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:24,512 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 394 transitions. [2022-07-13 11:42:24,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:24,513 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 394 transitions. [2022-07-13 11:42:24,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-13 11:42:24,514 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:24,514 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:42:24,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 11:42:24,514 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:24,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:24,515 INFO L85 PathProgramCache]: Analyzing trace with hash 523971024, now seen corresponding path program 1 times [2022-07-13 11:42:24,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:24,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078094557] [2022-07-13 11:42:24,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:24,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:24,630 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:42:24,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:24,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078094557] [2022-07-13 11:42:24,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078094557] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:24,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:24,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:24,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169187285] [2022-07-13 11:42:24,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:24,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:24,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:24,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:24,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:24,633 INFO L87 Difference]: Start difference. First operand 251 states and 394 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:25,704 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:42:26,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:26,048 INFO L93 Difference]: Finished difference Result 588 states and 931 transitions. [2022-07-13 11:42:26,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:26,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-07-13 11:42:26,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:26,050 INFO L225 Difference]: With dead ends: 588 [2022-07-13 11:42:26,050 INFO L226 Difference]: Without dead ends: 358 [2022-07-13 11:42:26,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:26,051 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 162 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 382 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.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:26,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 382 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-13 11:42:26,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-07-13 11:42:26,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 251. [2022-07-13 11:42:26,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 1.56) internal successors, (390), 250 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:26,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 390 transitions. [2022-07-13 11:42:26,058 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 390 transitions. Word has length 77 [2022-07-13 11:42:26,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:26,058 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 390 transitions. [2022-07-13 11:42:26,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:26,058 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 390 transitions. [2022-07-13 11:42:26,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-13 11:42:26,059 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:26,059 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:42:26,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 11:42:26,060 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:26,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:26,060 INFO L85 PathProgramCache]: Analyzing trace with hash -121845287, now seen corresponding path program 1 times [2022-07-13 11:42:26,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:26,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895378593] [2022-07-13 11:42:26,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:26,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:26,166 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:42:26,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:26,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895378593] [2022-07-13 11:42:26,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895378593] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:26,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:26,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:26,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455596567] [2022-07-13 11:42:26,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:26,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:26,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:26,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:26,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:26,169 INFO L87 Difference]: Start difference. First operand 251 states and 390 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:26,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:26,711 INFO L93 Difference]: Finished difference Result 498 states and 778 transitions. [2022-07-13 11:42:26,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:26,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-07-13 11:42:26,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:26,713 INFO L225 Difference]: With dead ends: 498 [2022-07-13 11:42:26,713 INFO L226 Difference]: Without dead ends: 268 [2022-07-13 11:42:26,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:26,714 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 33 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:26,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 547 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 11:42:26,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-07-13 11:42:26,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 251. [2022-07-13 11:42:26,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 1.556) internal successors, (389), 250 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:26,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 389 transitions. [2022-07-13 11:42:26,720 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 389 transitions. Word has length 77 [2022-07-13 11:42:26,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:26,720 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 389 transitions. [2022-07-13 11:42:26,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:26,721 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 389 transitions. [2022-07-13 11:42:26,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-13 11:42:26,721 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:26,722 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:42:26,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 11:42:26,722 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:26,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:26,722 INFO L85 PathProgramCache]: Analyzing trace with hash -2080051672, now seen corresponding path program 1 times [2022-07-13 11:42:26,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:26,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577873761] [2022-07-13 11:42:26,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:26,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:26,815 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:42:26,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:26,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577873761] [2022-07-13 11:42:26,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577873761] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:26,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:26,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:26,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600158715] [2022-07-13 11:42:26,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:26,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:26,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:26,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:26,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:26,817 INFO L87 Difference]: Start difference. First operand 251 states and 389 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:27,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:27,907 INFO L93 Difference]: Finished difference Result 588 states and 921 transitions. [2022-07-13 11:42:27,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:27,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-07-13 11:42:27,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:27,909 INFO L225 Difference]: With dead ends: 588 [2022-07-13 11:42:27,909 INFO L226 Difference]: Without dead ends: 358 [2022-07-13 11:42:27,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:27,910 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 160 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 382 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-13 11:42:27,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 382 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-13 11:42:27,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-07-13 11:42:27,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 251. [2022-07-13 11:42:27,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 1.54) internal successors, (385), 250 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:27,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 385 transitions. [2022-07-13 11:42:27,917 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 385 transitions. Word has length 78 [2022-07-13 11:42:27,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:27,918 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 385 transitions. [2022-07-13 11:42:27,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:27,918 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 385 transitions. [2022-07-13 11:42:27,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-13 11:42:27,919 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:27,919 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:42:27,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 11:42:27,919 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:27,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:27,920 INFO L85 PathProgramCache]: Analyzing trace with hash -647438805, now seen corresponding path program 1 times [2022-07-13 11:42:27,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:27,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196012839] [2022-07-13 11:42:27,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:27,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:28,009 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:42:28,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:28,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196012839] [2022-07-13 11:42:28,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196012839] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:28,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:28,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:28,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209487582] [2022-07-13 11:42:28,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:28,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:28,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:28,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:28,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:28,012 INFO L87 Difference]: Start difference. First operand 251 states and 385 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:29,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:29,303 INFO L93 Difference]: Finished difference Result 588 states and 913 transitions. [2022-07-13 11:42:29,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:29,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2022-07-13 11:42:29,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:29,305 INFO L225 Difference]: With dead ends: 588 [2022-07-13 11:42:29,305 INFO L226 Difference]: Without dead ends: 358 [2022-07-13 11:42:29,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:29,306 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 158 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 382 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.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:29,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 382 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-13 11:42:29,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-07-13 11:42:29,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 251. [2022-07-13 11:42:29,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 1.524) internal successors, (381), 250 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:29,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 381 transitions. [2022-07-13 11:42:29,313 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 381 transitions. Word has length 79 [2022-07-13 11:42:29,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:29,313 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 381 transitions. [2022-07-13 11:42:29,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:29,314 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 381 transitions. [2022-07-13 11:42:29,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-13 11:42:29,315 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:29,315 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:42:29,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 11:42:29,315 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:29,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:29,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1366824931, now seen corresponding path program 1 times [2022-07-13 11:42:29,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:29,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878218246] [2022-07-13 11:42:29,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:29,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:29,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:29,404 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:42:29,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:29,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878218246] [2022-07-13 11:42:29,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878218246] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:29,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:29,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:29,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100201634] [2022-07-13 11:42:29,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:29,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:29,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:29,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:29,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:29,406 INFO L87 Difference]: Start difference. First operand 251 states and 381 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:30,676 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-13 11:42:30,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:30,969 INFO L93 Difference]: Finished difference Result 578 states and 892 transitions. [2022-07-13 11:42:30,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:30,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 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 80 [2022-07-13 11:42:30,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:30,971 INFO L225 Difference]: With dead ends: 578 [2022-07-13 11:42:30,971 INFO L226 Difference]: Without dead ends: 348 [2022-07-13 11:42:30,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:30,972 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 149 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:30,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 402 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-13 11:42:30,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-07-13 11:42:30,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 251. [2022-07-13 11:42:30,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 1.508) internal successors, (377), 250 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:30,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 377 transitions. [2022-07-13 11:42:30,979 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 377 transitions. Word has length 80 [2022-07-13 11:42:30,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:30,979 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 377 transitions. [2022-07-13 11:42:30,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:30,979 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 377 transitions. [2022-07-13 11:42:30,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-13 11:42:30,980 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:30,980 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, 1, 1] [2022-07-13 11:42:30,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 11:42:30,980 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:30,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:30,981 INFO L85 PathProgramCache]: Analyzing trace with hash -238422134, now seen corresponding path program 1 times [2022-07-13 11:42:30,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:30,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492171780] [2022-07-13 11:42:30,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:30,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:31,126 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 11:42:31,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:31,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492171780] [2022-07-13 11:42:31,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492171780] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:31,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:31,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:31,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534804626] [2022-07-13 11:42:31,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:31,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:31,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:31,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:31,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:31,129 INFO L87 Difference]: Start difference. First operand 251 states and 377 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:33,015 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-13 11:42:33,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:33,302 INFO L93 Difference]: Finished difference Result 578 states and 884 transitions. [2022-07-13 11:42:33,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:33,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 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 85 [2022-07-13 11:42:33,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:33,304 INFO L225 Difference]: With dead ends: 578 [2022-07-13 11:42:33,304 INFO L226 Difference]: Without dead ends: 348 [2022-07-13 11:42:33,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:33,305 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 123 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:33,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 424 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 11:42:33,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-07-13 11:42:33,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 274. [2022-07-13 11:42:33,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 273 states have (on average 1.5457875457875458) internal successors, (422), 273 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:33,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 422 transitions. [2022-07-13 11:42:33,313 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 422 transitions. Word has length 85 [2022-07-13 11:42:33,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:33,313 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 422 transitions. [2022-07-13 11:42:33,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:33,313 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 422 transitions. [2022-07-13 11:42:33,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-13 11:42:33,315 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:33,315 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:42:33,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 11:42:33,315 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:33,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:33,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1246725502, now seen corresponding path program 1 times [2022-07-13 11:42:33,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:33,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888510987] [2022-07-13 11:42:33,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:33,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:33,437 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 11:42:33,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:33,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888510987] [2022-07-13 11:42:33,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888510987] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:33,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:33,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:33,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288659532] [2022-07-13 11:42:33,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:33,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:33,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:33,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:33,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:33,439 INFO L87 Difference]: Start difference. First operand 274 states and 422 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:34,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:34,434 INFO L93 Difference]: Finished difference Result 616 states and 956 transitions. [2022-07-13 11:42:34,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:34,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 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 113 [2022-07-13 11:42:34,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:34,436 INFO L225 Difference]: With dead ends: 616 [2022-07-13 11:42:34,436 INFO L226 Difference]: Without dead ends: 363 [2022-07-13 11:42:34,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:34,437 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 88 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:34,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 523 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-13 11:42:34,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-07-13 11:42:34,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 308. [2022-07-13 11:42:34,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 1.5472312703583062) internal successors, (475), 307 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:34,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 475 transitions. [2022-07-13 11:42:34,445 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 475 transitions. Word has length 113 [2022-07-13 11:42:34,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:34,445 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 475 transitions. [2022-07-13 11:42:34,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:34,445 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 475 transitions. [2022-07-13 11:42:34,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-13 11:42:34,446 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:34,447 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:42:34,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-13 11:42:34,447 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:34,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:34,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1139784004, now seen corresponding path program 1 times [2022-07-13 11:42:34,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:34,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686099707] [2022-07-13 11:42:34,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:34,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:34,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:34,604 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 11:42:34,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:34,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686099707] [2022-07-13 11:42:34,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686099707] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:34,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:34,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:34,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657867172] [2022-07-13 11:42:34,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:34,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:34,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:34,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:34,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:34,607 INFO L87 Difference]: Start difference. First operand 308 states and 475 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:35,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:35,286 INFO L93 Difference]: Finished difference Result 745 states and 1162 transitions. [2022-07-13 11:42:35,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:35,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 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 113 [2022-07-13 11:42:35,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:35,289 INFO L225 Difference]: With dead ends: 745 [2022-07-13 11:42:35,289 INFO L226 Difference]: Without dead ends: 458 [2022-07-13 11:42:35,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:35,290 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 129 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:35,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 412 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 11:42:35,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2022-07-13 11:42:35,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 338. [2022-07-13 11:42:35,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 337 states have (on average 1.5548961424332344) internal successors, (524), 337 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:35,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 524 transitions. [2022-07-13 11:42:35,301 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 524 transitions. Word has length 113 [2022-07-13 11:42:35,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:35,301 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 524 transitions. [2022-07-13 11:42:35,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:35,301 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 524 transitions. [2022-07-13 11:42:35,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-13 11:42:35,303 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:35,303 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:42:35,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 11:42:35,303 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:35,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:35,304 INFO L85 PathProgramCache]: Analyzing trace with hash -674265657, now seen corresponding path program 1 times [2022-07-13 11:42:35,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:35,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154118381] [2022-07-13 11:42:35,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:35,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:35,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:35,426 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 11:42:35,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:35,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154118381] [2022-07-13 11:42:35,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154118381] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:35,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:35,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:35,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115853471] [2022-07-13 11:42:35,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:35,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:35,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:35,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:35,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:35,429 INFO L87 Difference]: Start difference. First operand 338 states and 524 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:36,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:36,518 INFO L93 Difference]: Finished difference Result 769 states and 1197 transitions. [2022-07-13 11:42:36,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:36,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 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 119 [2022-07-13 11:42:36,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:36,521 INFO L225 Difference]: With dead ends: 769 [2022-07-13 11:42:36,521 INFO L226 Difference]: Without dead ends: 452 [2022-07-13 11:42:36,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:36,522 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 125 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:36,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 400 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-13 11:42:36,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2022-07-13 11:42:36,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 375. [2022-07-13 11:42:36,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 374 states have (on average 1.5588235294117647) internal successors, (583), 374 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:36,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 583 transitions. [2022-07-13 11:42:36,531 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 583 transitions. Word has length 119 [2022-07-13 11:42:36,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:36,531 INFO L495 AbstractCegarLoop]: Abstraction has 375 states and 583 transitions. [2022-07-13 11:42:36,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:36,532 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 583 transitions. [2022-07-13 11:42:36,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-13 11:42:36,533 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:36,533 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:42:36,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-13 11:42:36,534 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:36,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:36,534 INFO L85 PathProgramCache]: Analyzing trace with hash 622163786, now seen corresponding path program 1 times [2022-07-13 11:42:36,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:36,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327976635] [2022-07-13 11:42:36,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:36,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:36,650 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 11:42:36,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:36,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327976635] [2022-07-13 11:42:36,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327976635] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:36,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:36,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:36,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850030781] [2022-07-13 11:42:36,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:36,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:36,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:36,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:36,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:36,653 INFO L87 Difference]: Start difference. First operand 375 states and 583 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:37,748 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:42:38,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:38,019 INFO L93 Difference]: Finished difference Result 815 states and 1272 transitions. [2022-07-13 11:42:38,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:38,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 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 120 [2022-07-13 11:42:38,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:38,022 INFO L225 Difference]: With dead ends: 815 [2022-07-13 11:42:38,022 INFO L226 Difference]: Without dead ends: 461 [2022-07-13 11:42:38,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:38,023 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 77 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:38,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 525 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-13 11:42:38,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2022-07-13 11:42:38,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 415. [2022-07-13 11:42:38,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 414 states have (on average 1.5603864734299517) internal successors, (646), 414 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:38,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 646 transitions. [2022-07-13 11:42:38,032 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 646 transitions. Word has length 120 [2022-07-13 11:42:38,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:38,032 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 646 transitions. [2022-07-13 11:42:38,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:38,032 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 646 transitions. [2022-07-13 11:42:38,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-13 11:42:38,033 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:38,034 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:42:38,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-13 11:42:38,034 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:38,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:38,035 INFO L85 PathProgramCache]: Analyzing trace with hash 649229388, now seen corresponding path program 1 times [2022-07-13 11:42:38,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:38,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605598848] [2022-07-13 11:42:38,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:38,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:38,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:38,137 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-13 11:42:38,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:38,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605598848] [2022-07-13 11:42:38,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605598848] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:38,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:38,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:38,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652459475] [2022-07-13 11:42:38,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:38,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:38,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:38,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:38,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:38,141 INFO L87 Difference]: Start difference. First operand 415 states and 646 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:38,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:38,823 INFO L93 Difference]: Finished difference Result 846 states and 1321 transitions. [2022-07-13 11:42:38,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:38,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 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 120 [2022-07-13 11:42:38,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:38,826 INFO L225 Difference]: With dead ends: 846 [2022-07-13 11:42:38,826 INFO L226 Difference]: Without dead ends: 452 [2022-07-13 11:42:38,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:38,827 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 28 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:38,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 625 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 11:42:38,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2022-07-13 11:42:38,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 439. [2022-07-13 11:42:38,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 438 states have (on average 1.5547945205479452) internal successors, (681), 438 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:38,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 681 transitions. [2022-07-13 11:42:38,838 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 681 transitions. Word has length 120 [2022-07-13 11:42:38,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:38,839 INFO L495 AbstractCegarLoop]: Abstraction has 439 states and 681 transitions. [2022-07-13 11:42:38,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:38,839 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 681 transitions. [2022-07-13 11:42:38,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-13 11:42:38,840 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:38,840 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, 1, 1, 1, 1] [2022-07-13 11:42:38,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-13 11:42:38,841 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:38,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:38,841 INFO L85 PathProgramCache]: Analyzing trace with hash -370439172, now seen corresponding path program 1 times [2022-07-13 11:42:38,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:38,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232094592] [2022-07-13 11:42:38,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:38,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:38,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:38,953 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 11:42:38,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:38,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232094592] [2022-07-13 11:42:38,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232094592] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:38,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:38,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:38,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962007122] [2022-07-13 11:42:38,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:38,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:38,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:38,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:38,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:38,956 INFO L87 Difference]: Start difference. First operand 439 states and 681 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:39,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:39,774 INFO L93 Difference]: Finished difference Result 895 states and 1391 transitions. [2022-07-13 11:42:39,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:39,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 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 127 [2022-07-13 11:42:39,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:39,780 INFO L225 Difference]: With dead ends: 895 [2022-07-13 11:42:39,780 INFO L226 Difference]: Without dead ends: 477 [2022-07-13 11:42:39,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:39,782 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 61 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:39,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 531 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 11:42:39,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2022-07-13 11:42:39,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 442. [2022-07-13 11:42:39,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 441 states have (on average 1.5510204081632653) internal successors, (684), 441 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:39,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 684 transitions. [2022-07-13 11:42:39,792 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 684 transitions. Word has length 127 [2022-07-13 11:42:39,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:39,792 INFO L495 AbstractCegarLoop]: Abstraction has 442 states and 684 transitions. [2022-07-13 11:42:39,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:39,792 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 684 transitions. [2022-07-13 11:42:39,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-13 11:42:39,795 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:39,795 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 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] [2022-07-13 11:42:39,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-13 11:42:39,795 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:39,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:39,796 INFO L85 PathProgramCache]: Analyzing trace with hash -143031650, now seen corresponding path program 1 times [2022-07-13 11:42:39,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:39,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090629406] [2022-07-13 11:42:39,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:39,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:39,898 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-13 11:42:39,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:39,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090629406] [2022-07-13 11:42:39,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090629406] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:39,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:39,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:39,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571932676] [2022-07-13 11:42:39,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:39,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:39,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:39,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:39,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:39,901 INFO L87 Difference]: Start difference. First operand 442 states and 684 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:40,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:40,700 INFO L93 Difference]: Finished difference Result 897 states and 1392 transitions. [2022-07-13 11:42:40,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:40,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 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 134 [2022-07-13 11:42:40,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:40,701 INFO L225 Difference]: With dead ends: 897 [2022-07-13 11:42:40,701 INFO L226 Difference]: Without dead ends: 476 [2022-07-13 11:42:40,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:40,703 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 83 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:40,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 533 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 11:42:40,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-07-13 11:42:40,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 442. [2022-07-13 11:42:40,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 441 states have (on average 1.5487528344671202) internal successors, (683), 441 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:40,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 683 transitions. [2022-07-13 11:42:40,712 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 683 transitions. Word has length 134 [2022-07-13 11:42:40,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:40,713 INFO L495 AbstractCegarLoop]: Abstraction has 442 states and 683 transitions. [2022-07-13 11:42:40,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:40,713 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 683 transitions. [2022-07-13 11:42:40,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-13 11:42:40,714 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:40,714 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 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] [2022-07-13 11:42:40,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-13 11:42:40,715 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:40,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:40,715 INFO L85 PathProgramCache]: Analyzing trace with hash -2083613664, now seen corresponding path program 1 times [2022-07-13 11:42:40,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:40,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292540315] [2022-07-13 11:42:40,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:40,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:40,840 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-13 11:42:40,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:40,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292540315] [2022-07-13 11:42:40,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292540315] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:40,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:40,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:40,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611563367] [2022-07-13 11:42:40,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:40,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:40,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:40,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:40,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:40,843 INFO L87 Difference]: Start difference. First operand 442 states and 683 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:42,596 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:42:42,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:42,772 INFO L93 Difference]: Finished difference Result 875 states and 1358 transitions. [2022-07-13 11:42:42,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:42,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 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 134 [2022-07-13 11:42:42,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:42,774 INFO L225 Difference]: With dead ends: 875 [2022-07-13 11:42:42,774 INFO L226 Difference]: Without dead ends: 454 [2022-07-13 11:42:42,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:42,775 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 33 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:42,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 625 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-13 11:42:42,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2022-07-13 11:42:42,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 442. [2022-07-13 11:42:42,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 441 states have (on average 1.5464852607709751) internal successors, (682), 441 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:42,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 682 transitions. [2022-07-13 11:42:42,785 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 682 transitions. Word has length 134 [2022-07-13 11:42:42,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:42,785 INFO L495 AbstractCegarLoop]: Abstraction has 442 states and 682 transitions. [2022-07-13 11:42:42,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:42,785 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 682 transitions. [2022-07-13 11:42:42,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-13 11:42:42,787 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:42,787 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:42:42,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-13 11:42:42,787 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:42,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:42,788 INFO L85 PathProgramCache]: Analyzing trace with hash -500982677, now seen corresponding path program 1 times [2022-07-13 11:42:42,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:42,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945106886] [2022-07-13 11:42:42,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:42,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:42,896 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-13 11:42:42,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:42,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945106886] [2022-07-13 11:42:42,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945106886] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:42,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:42,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:42,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100851896] [2022-07-13 11:42:42,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:42,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:42,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:42,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:42,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:42,899 INFO L87 Difference]: Start difference. First operand 442 states and 682 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:43,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:43,911 INFO L93 Difference]: Finished difference Result 977 states and 1512 transitions. [2022-07-13 11:42:43,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:43,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 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 140 [2022-07-13 11:42:43,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:43,913 INFO L225 Difference]: With dead ends: 977 [2022-07-13 11:42:43,913 INFO L226 Difference]: Without dead ends: 556 [2022-07-13 11:42:43,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:43,915 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 132 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:43,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 424 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-13 11:42:43,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2022-07-13 11:42:43,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 472. [2022-07-13 11:42:43,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 1.5371549893842889) internal successors, (724), 471 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:43,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 724 transitions. [2022-07-13 11:42:43,925 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 724 transitions. Word has length 140 [2022-07-13 11:42:43,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:43,925 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 724 transitions. [2022-07-13 11:42:43,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:43,926 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 724 transitions. [2022-07-13 11:42:43,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-13 11:42:43,927 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:43,927 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:42:43,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-13 11:42:43,928 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:43,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:43,928 INFO L85 PathProgramCache]: Analyzing trace with hash -2119848563, now seen corresponding path program 1 times [2022-07-13 11:42:43,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:43,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950213565] [2022-07-13 11:42:43,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:43,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:44,041 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-13 11:42:44,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:44,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950213565] [2022-07-13 11:42:44,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950213565] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:44,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:44,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:44,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735133636] [2022-07-13 11:42:44,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:44,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:44,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:44,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:44,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:44,044 INFO L87 Difference]: Start difference. First operand 472 states and 724 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:44,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:44,600 INFO L93 Difference]: Finished difference Result 997 states and 1532 transitions. [2022-07-13 11:42:44,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:44,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 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 141 [2022-07-13 11:42:44,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:44,603 INFO L225 Difference]: With dead ends: 997 [2022-07-13 11:42:44,603 INFO L226 Difference]: Without dead ends: 546 [2022-07-13 11:42:44,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:44,604 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 131 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:44,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 400 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 11:42:44,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2022-07-13 11:42:44,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 472. [2022-07-13 11:42:44,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 1.5244161358811041) internal successors, (718), 471 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:44,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 718 transitions. [2022-07-13 11:42:44,615 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 718 transitions. Word has length 141 [2022-07-13 11:42:44,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:44,615 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 718 transitions. [2022-07-13 11:42:44,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:44,615 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 718 transitions. [2022-07-13 11:42:44,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-13 11:42:44,616 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:44,617 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, 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] [2022-07-13 11:42:44,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-13 11:42:44,617 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:44,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:44,618 INFO L85 PathProgramCache]: Analyzing trace with hash 190412283, now seen corresponding path program 1 times [2022-07-13 11:42:44,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:44,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091261671] [2022-07-13 11:42:44,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:44,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:44,726 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-13 11:42:44,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:44,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091261671] [2022-07-13 11:42:44,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091261671] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:44,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:44,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:44,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743549464] [2022-07-13 11:42:44,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:44,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:44,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:44,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:44,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:44,729 INFO L87 Difference]: Start difference. First operand 472 states and 718 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:45,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:45,240 INFO L93 Difference]: Finished difference Result 955 states and 1458 transitions. [2022-07-13 11:42:45,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:45,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 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 142 [2022-07-13 11:42:45,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:45,242 INFO L225 Difference]: With dead ends: 955 [2022-07-13 11:42:45,242 INFO L226 Difference]: Without dead ends: 504 [2022-07-13 11:42:45,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:45,244 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 73 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:45,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 551 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 11:42:45,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2022-07-13 11:42:45,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 472. [2022-07-13 11:42:45,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 1.5222929936305734) internal successors, (717), 471 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:45,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 717 transitions. [2022-07-13 11:42:45,254 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 717 transitions. Word has length 142 [2022-07-13 11:42:45,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:45,254 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 717 transitions. [2022-07-13 11:42:45,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:45,254 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 717 transitions. [2022-07-13 11:42:45,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-13 11:42:45,255 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:45,256 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, 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] [2022-07-13 11:42:45,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-13 11:42:45,256 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:45,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:45,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1221453181, now seen corresponding path program 1 times [2022-07-13 11:42:45,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:45,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10269969] [2022-07-13 11:42:45,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:45,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:45,368 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-13 11:42:45,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:45,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10269969] [2022-07-13 11:42:45,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10269969] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:45,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:45,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:42:45,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556312118] [2022-07-13 11:42:45,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:45,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:42:45,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:45,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:42:45,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:42:45,370 INFO L87 Difference]: Start difference. First operand 472 states and 717 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:45,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:45,436 INFO L93 Difference]: Finished difference Result 1369 states and 2095 transitions. [2022-07-13 11:42:45,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:42:45,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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 142 [2022-07-13 11:42:45,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:45,439 INFO L225 Difference]: With dead ends: 1369 [2022-07-13 11:42:45,439 INFO L226 Difference]: Without dead ends: 918 [2022-07-13 11:42:45,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:42:45,444 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 147 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:45,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 438 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:42:45,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2022-07-13 11:42:45,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 916. [2022-07-13 11:42:45,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 915 states have (on average 1.512568306010929) internal successors, (1384), 915 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:45,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1384 transitions. [2022-07-13 11:42:45,463 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1384 transitions. Word has length 142 [2022-07-13 11:42:45,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:45,464 INFO L495 AbstractCegarLoop]: Abstraction has 916 states and 1384 transitions. [2022-07-13 11:42:45,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:45,464 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1384 transitions. [2022-07-13 11:42:45,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-13 11:42:45,466 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:45,466 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, 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] [2022-07-13 11:42:45,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-13 11:42:45,467 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:45,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:45,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1645099903, now seen corresponding path program 1 times [2022-07-13 11:42:45,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:45,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141057298] [2022-07-13 11:42:45,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:45,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:45,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:45,588 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-07-13 11:42:45,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:45,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141057298] [2022-07-13 11:42:45,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141057298] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:45,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:45,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:45,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085614850] [2022-07-13 11:42:45,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:45,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:45,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:45,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:45,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:45,590 INFO L87 Difference]: Start difference. First operand 916 states and 1384 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:46,624 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:42:46,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:46,828 INFO L93 Difference]: Finished difference Result 1892 states and 2861 transitions. [2022-07-13 11:42:46,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:46,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 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 142 [2022-07-13 11:42:46,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:46,831 INFO L225 Difference]: With dead ends: 1892 [2022-07-13 11:42:46,832 INFO L226 Difference]: Without dead ends: 997 [2022-07-13 11:42:46,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:46,833 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 31 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:46,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 625 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-13 11:42:46,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2022-07-13 11:42:46,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 968. [2022-07-13 11:42:46,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 967 states have (on average 1.5118924508790073) internal successors, (1462), 967 states have internal predecessors, (1462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:46,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1462 transitions. [2022-07-13 11:42:46,852 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1462 transitions. Word has length 142 [2022-07-13 11:42:46,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:46,861 INFO L495 AbstractCegarLoop]: Abstraction has 968 states and 1462 transitions. [2022-07-13 11:42:46,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:46,862 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1462 transitions. [2022-07-13 11:42:46,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-13 11:42:46,864 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:46,864 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:42:46,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-13 11:42:46,864 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:46,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:46,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1018768782, now seen corresponding path program 1 times [2022-07-13 11:42:46,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:46,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347657075] [2022-07-13 11:42:46,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:46,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:46,968 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-13 11:42:46,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:46,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347657075] [2022-07-13 11:42:46,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347657075] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:46,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:46,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:46,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3996910] [2022-07-13 11:42:46,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:46,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:46,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:46,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:46,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:46,971 INFO L87 Difference]: Start difference. First operand 968 states and 1462 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:48,045 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:42:48,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:48,316 INFO L93 Difference]: Finished difference Result 2138 states and 3221 transitions. [2022-07-13 11:42:48,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:48,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 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 144 [2022-07-13 11:42:48,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:48,319 INFO L225 Difference]: With dead ends: 2138 [2022-07-13 11:42:48,319 INFO L226 Difference]: Without dead ends: 1191 [2022-07-13 11:42:48,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:48,320 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 133 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:48,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 424 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-13 11:42:48,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2022-07-13 11:42:48,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1024. [2022-07-13 11:42:48,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1023 states have (on average 1.501466275659824) internal successors, (1536), 1023 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:48,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1536 transitions. [2022-07-13 11:42:48,341 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1536 transitions. Word has length 144 [2022-07-13 11:42:48,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:48,342 INFO L495 AbstractCegarLoop]: Abstraction has 1024 states and 1536 transitions. [2022-07-13 11:42:48,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:48,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1536 transitions. [2022-07-13 11:42:48,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-13 11:42:48,344 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:48,344 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:42:48,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-13 11:42:48,345 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:48,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:48,345 INFO L85 PathProgramCache]: Analyzing trace with hash -271637232, now seen corresponding path program 1 times [2022-07-13 11:42:48,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:48,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914992603] [2022-07-13 11:42:48,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:48,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:48,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:48,466 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-13 11:42:48,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:48,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914992603] [2022-07-13 11:42:48,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914992603] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:48,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:48,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:48,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592602627] [2022-07-13 11:42:48,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:48,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:48,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:48,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:48,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:48,469 INFO L87 Difference]: Start difference. First operand 1024 states and 1536 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:49,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:49,130 INFO L93 Difference]: Finished difference Result 2074 states and 3108 transitions. [2022-07-13 11:42:49,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:49,131 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 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 145 [2022-07-13 11:42:49,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:49,133 INFO L225 Difference]: With dead ends: 2074 [2022-07-13 11:42:49,133 INFO L226 Difference]: Without dead ends: 1071 [2022-07-13 11:42:49,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:49,135 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 57 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:49,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 569 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 11:42:49,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2022-07-13 11:42:49,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1024. [2022-07-13 11:42:49,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1023 states have (on average 1.4995112414467253) internal successors, (1534), 1023 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:49,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1534 transitions. [2022-07-13 11:42:49,155 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1534 transitions. Word has length 145 [2022-07-13 11:42:49,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:49,156 INFO L495 AbstractCegarLoop]: Abstraction has 1024 states and 1534 transitions. [2022-07-13 11:42:49,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:49,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1534 transitions. [2022-07-13 11:42:49,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-07-13 11:42:49,158 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:49,158 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, 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] [2022-07-13 11:42:49,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-13 11:42:49,159 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:49,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:49,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1688759630, now seen corresponding path program 1 times [2022-07-13 11:42:49,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:49,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309076671] [2022-07-13 11:42:49,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:49,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:49,280 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-13 11:42:49,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:49,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309076671] [2022-07-13 11:42:49,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309076671] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:49,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:49,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:49,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454300572] [2022-07-13 11:42:49,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:49,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:49,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:49,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:49,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:49,283 INFO L87 Difference]: Start difference. First operand 1024 states and 1534 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:49,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:49,949 INFO L93 Difference]: Finished difference Result 2170 states and 3241 transitions. [2022-07-13 11:42:49,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:49,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 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 148 [2022-07-13 11:42:49,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:49,953 INFO L225 Difference]: With dead ends: 2170 [2022-07-13 11:42:49,953 INFO L226 Difference]: Without dead ends: 1167 [2022-07-13 11:42:49,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:49,954 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 135 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:49,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 404 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 11:42:49,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2022-07-13 11:42:49,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1024. [2022-07-13 11:42:49,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1023 states have (on average 1.4838709677419355) internal successors, (1518), 1023 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:49,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1518 transitions. [2022-07-13 11:42:49,975 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1518 transitions. Word has length 148 [2022-07-13 11:42:49,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:49,976 INFO L495 AbstractCegarLoop]: Abstraction has 1024 states and 1518 transitions. [2022-07-13 11:42:49,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:49,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1518 transitions. [2022-07-13 11:42:49,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-07-13 11:42:49,978 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:49,978 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, 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] [2022-07-13 11:42:49,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-13 11:42:49,979 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:49,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:49,979 INFO L85 PathProgramCache]: Analyzing trace with hash 267139220, now seen corresponding path program 1 times [2022-07-13 11:42:49,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:49,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776877779] [2022-07-13 11:42:49,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:49,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:50,103 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-13 11:42:50,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:50,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776877779] [2022-07-13 11:42:50,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776877779] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:50,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:50,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:50,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438886772] [2022-07-13 11:42:50,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:50,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:50,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:50,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:50,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:50,106 INFO L87 Difference]: Start difference. First operand 1024 states and 1518 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:51,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:51,195 INFO L93 Difference]: Finished difference Result 2170 states and 3209 transitions. [2022-07-13 11:42:51,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:51,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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 149 [2022-07-13 11:42:51,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:51,198 INFO L225 Difference]: With dead ends: 2170 [2022-07-13 11:42:51,198 INFO L226 Difference]: Without dead ends: 1167 [2022-07-13 11:42:51,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:51,199 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 134 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:51,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 400 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-13 11:42:51,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2022-07-13 11:42:51,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1024. [2022-07-13 11:42:51,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1023 states have (on average 1.4682306940371457) internal successors, (1502), 1023 states have internal predecessors, (1502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:51,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1502 transitions. [2022-07-13 11:42:51,224 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1502 transitions. Word has length 149 [2022-07-13 11:42:51,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:51,225 INFO L495 AbstractCegarLoop]: Abstraction has 1024 states and 1502 transitions. [2022-07-13 11:42:51,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:51,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1502 transitions. [2022-07-13 11:42:51,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-13 11:42:51,227 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:51,227 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:42:51,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-13 11:42:51,228 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:51,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:51,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1679866725, now seen corresponding path program 1 times [2022-07-13 11:42:51,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:51,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343501806] [2022-07-13 11:42:51,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:51,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:51,379 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-13 11:42:51,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:51,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343501806] [2022-07-13 11:42:51,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343501806] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:51,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:51,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:51,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819286187] [2022-07-13 11:42:51,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:51,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:51,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:51,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:51,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:51,382 INFO L87 Difference]: Start difference. First operand 1024 states and 1502 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:51,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:51,943 INFO L93 Difference]: Finished difference Result 2250 states and 3295 transitions. [2022-07-13 11:42:51,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:51,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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 152 [2022-07-13 11:42:51,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:51,946 INFO L225 Difference]: With dead ends: 2250 [2022-07-13 11:42:51,946 INFO L226 Difference]: Without dead ends: 1247 [2022-07-13 11:42:51,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:51,948 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 125 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:51,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 400 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 11:42:51,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2022-07-13 11:42:51,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 1094. [2022-07-13 11:42:51,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1094 states, 1093 states have (on average 1.4620311070448306) internal successors, (1598), 1093 states have internal predecessors, (1598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:51,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1598 transitions. [2022-07-13 11:42:51,971 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1598 transitions. Word has length 152 [2022-07-13 11:42:51,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:51,971 INFO L495 AbstractCegarLoop]: Abstraction has 1094 states and 1598 transitions. [2022-07-13 11:42:51,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:51,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1598 transitions. [2022-07-13 11:42:51,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-13 11:42:51,973 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:51,974 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:42:51,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-13 11:42:51,974 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:51,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:51,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1338024491, now seen corresponding path program 1 times [2022-07-13 11:42:51,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:51,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811567180] [2022-07-13 11:42:51,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:51,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:52,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:52,097 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-13 11:42:52,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:52,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811567180] [2022-07-13 11:42:52,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811567180] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:52,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:52,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:52,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311594152] [2022-07-13 11:42:52,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:52,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:52,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:52,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:52,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:52,102 INFO L87 Difference]: Start difference. First operand 1094 states and 1598 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:52,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:52,586 INFO L93 Difference]: Finished difference Result 2390 states and 3487 transitions. [2022-07-13 11:42:52,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:52,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 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 152 [2022-07-13 11:42:52,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:52,589 INFO L225 Difference]: With dead ends: 2390 [2022-07-13 11:42:52,589 INFO L226 Difference]: Without dead ends: 1317 [2022-07-13 11:42:52,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:52,591 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 127 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:52,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 410 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 11:42:52,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2022-07-13 11:42:52,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1160. [2022-07-13 11:42:52,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1160 states, 1159 states have (on average 1.454702329594478) internal successors, (1686), 1159 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:52,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1686 transitions. [2022-07-13 11:42:52,614 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1686 transitions. Word has length 152 [2022-07-13 11:42:52,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:52,615 INFO L495 AbstractCegarLoop]: Abstraction has 1160 states and 1686 transitions. [2022-07-13 11:42:52,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:52,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1686 transitions. [2022-07-13 11:42:52,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-13 11:42:52,617 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:52,617 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:42:52,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-13 11:42:52,617 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:52,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:52,618 INFO L85 PathProgramCache]: Analyzing trace with hash 523078130, now seen corresponding path program 1 times [2022-07-13 11:42:52,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:52,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193552598] [2022-07-13 11:42:52,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:52,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:52,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:52,730 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-13 11:42:52,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:52,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193552598] [2022-07-13 11:42:52,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193552598] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:52,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:52,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:52,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444515465] [2022-07-13 11:42:52,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:52,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:52,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:52,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:52,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:52,733 INFO L87 Difference]: Start difference. First operand 1160 states and 1686 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:53,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:53,268 INFO L93 Difference]: Finished difference Result 2330 states and 3386 transitions. [2022-07-13 11:42:53,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:53,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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 153 [2022-07-13 11:42:53,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:53,272 INFO L225 Difference]: With dead ends: 2330 [2022-07-13 11:42:53,272 INFO L226 Difference]: Without dead ends: 1191 [2022-07-13 11:42:53,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:53,273 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 39 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:53,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 579 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 11:42:53,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2022-07-13 11:42:53,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1160. [2022-07-13 11:42:53,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1160 states, 1159 states have (on average 1.45297670405522) internal successors, (1684), 1159 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:53,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1684 transitions. [2022-07-13 11:42:53,310 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1684 transitions. Word has length 153 [2022-07-13 11:42:53,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:53,310 INFO L495 AbstractCegarLoop]: Abstraction has 1160 states and 1684 transitions. [2022-07-13 11:42:53,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:53,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1684 transitions. [2022-07-13 11:42:53,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-13 11:42:53,312 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:53,312 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:42:53,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-13 11:42:53,313 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:53,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:53,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1944185570, now seen corresponding path program 1 times [2022-07-13 11:42:53,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:53,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494212407] [2022-07-13 11:42:53,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:53,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:53,420 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-13 11:42:53,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:53,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494212407] [2022-07-13 11:42:53,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494212407] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:53,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:53,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:53,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829799865] [2022-07-13 11:42:53,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:53,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:53,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:53,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:53,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:53,424 INFO L87 Difference]: Start difference. First operand 1160 states and 1684 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:54,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:54,086 INFO L93 Difference]: Finished difference Result 2324 states and 3375 transitions. [2022-07-13 11:42:54,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:54,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 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 153 [2022-07-13 11:42:54,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:54,089 INFO L225 Difference]: With dead ends: 2324 [2022-07-13 11:42:54,089 INFO L226 Difference]: Without dead ends: 1185 [2022-07-13 11:42:54,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:54,090 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 33 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:54,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 581 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 11:42:54,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2022-07-13 11:42:54,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1160. [2022-07-13 11:42:54,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1160 states, 1159 states have (on average 1.451251078515962) internal successors, (1682), 1159 states have internal predecessors, (1682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:54,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1682 transitions. [2022-07-13 11:42:54,111 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1682 transitions. Word has length 153 [2022-07-13 11:42:54,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:54,111 INFO L495 AbstractCegarLoop]: Abstraction has 1160 states and 1682 transitions. [2022-07-13 11:42:54,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:54,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1682 transitions. [2022-07-13 11:42:54,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-13 11:42:54,113 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:54,113 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2022-07-13 11:42:54,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-07-13 11:42:54,114 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:54,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:54,114 INFO L85 PathProgramCache]: Analyzing trace with hash -2133855853, now seen corresponding path program 1 times [2022-07-13 11:42:54,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:54,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234286304] [2022-07-13 11:42:54,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:54,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:54,244 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-13 11:42:54,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:54,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234286304] [2022-07-13 11:42:54,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234286304] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:54,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:54,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:54,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028915666] [2022-07-13 11:42:54,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:54,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:54,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:54,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:54,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:54,246 INFO L87 Difference]: Start difference. First operand 1160 states and 1682 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:54,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:54,669 INFO L93 Difference]: Finished difference Result 2458 states and 3563 transitions. [2022-07-13 11:42:54,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:54,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 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 156 [2022-07-13 11:42:54,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:54,674 INFO L225 Difference]: With dead ends: 2458 [2022-07-13 11:42:54,674 INFO L226 Difference]: Without dead ends: 1319 [2022-07-13 11:42:54,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:54,676 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 68 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:54,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 597 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 11:42:54,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2022-07-13 11:42:54,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1236. [2022-07-13 11:42:54,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1236 states, 1235 states have (on average 1.4493927125506072) internal successors, (1790), 1235 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:54,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1790 transitions. [2022-07-13 11:42:54,695 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1790 transitions. Word has length 156 [2022-07-13 11:42:54,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:54,695 INFO L495 AbstractCegarLoop]: Abstraction has 1236 states and 1790 transitions. [2022-07-13 11:42:54,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:54,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1790 transitions. [2022-07-13 11:42:54,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-13 11:42:54,697 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:54,697 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:42:54,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-07-13 11:42:54,698 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:54,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:54,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1852047201, now seen corresponding path program 1 times [2022-07-13 11:42:54,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:54,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030194458] [2022-07-13 11:42:54,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:54,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:54,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:54,791 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-13 11:42:54,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:54,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030194458] [2022-07-13 11:42:54,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030194458] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:54,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:54,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:42:54,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326688711] [2022-07-13 11:42:54,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:54,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:42:54,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:54,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:42:54,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:42:54,793 INFO L87 Difference]: Start difference. First operand 1236 states and 1790 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:54,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:54,839 INFO L93 Difference]: Finished difference Result 2478 states and 3592 transitions. [2022-07-13 11:42:54,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:42:54,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 161 [2022-07-13 11:42:54,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:54,843 INFO L225 Difference]: With dead ends: 2478 [2022-07-13 11:42:54,844 INFO L226 Difference]: Without dead ends: 1263 [2022-07-13 11:42:54,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:42:54,845 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 15 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:54,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 426 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:42:54,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2022-07-13 11:42:54,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1263. [2022-07-13 11:42:54,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1263 states, 1262 states have (on average 1.4461172741679873) internal successors, (1825), 1262 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:54,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 1825 transitions. [2022-07-13 11:42:54,868 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 1825 transitions. Word has length 161 [2022-07-13 11:42:54,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:54,868 INFO L495 AbstractCegarLoop]: Abstraction has 1263 states and 1825 transitions. [2022-07-13 11:42:54,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:54,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1825 transitions. [2022-07-13 11:42:54,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-13 11:42:54,871 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:54,871 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:42:54,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-07-13 11:42:54,871 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:54,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:54,871 INFO L85 PathProgramCache]: Analyzing trace with hash -2032309729, now seen corresponding path program 1 times [2022-07-13 11:42:54,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:54,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62724039] [2022-07-13 11:42:54,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:54,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:54,977 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-07-13 11:42:54,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:54,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62724039] [2022-07-13 11:42:54,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62724039] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:54,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:54,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:42:54,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56348889] [2022-07-13 11:42:54,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:54,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:42:54,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:54,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:42:54,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:42:54,981 INFO L87 Difference]: Start difference. First operand 1263 states and 1825 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:55,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:55,026 INFO L93 Difference]: Finished difference Result 2507 states and 3628 transitions. [2022-07-13 11:42:55,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:42:55,026 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 161 [2022-07-13 11:42:55,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:55,030 INFO L225 Difference]: With dead ends: 2507 [2022-07-13 11:42:55,030 INFO L226 Difference]: Without dead ends: 1265 [2022-07-13 11:42:55,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:42:55,032 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 4 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:55,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 405 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:42:55,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2022-07-13 11:42:55,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1265. [2022-07-13 11:42:55,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1264 states have (on average 1.4454113924050633) internal successors, (1827), 1264 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:55,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1827 transitions. [2022-07-13 11:42:55,052 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1827 transitions. Word has length 161 [2022-07-13 11:42:55,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:55,053 INFO L495 AbstractCegarLoop]: Abstraction has 1265 states and 1827 transitions. [2022-07-13 11:42:55,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:55,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1827 transitions. [2022-07-13 11:42:55,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-13 11:42:55,054 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:55,054 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:42:55,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-07-13 11:42:55,055 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:55,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:55,056 INFO L85 PathProgramCache]: Analyzing trace with hash 813807070, now seen corresponding path program 1 times [2022-07-13 11:42:55,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:55,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156705343] [2022-07-13 11:42:55,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:55,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:55,202 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-13 11:42:55,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:55,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156705343] [2022-07-13 11:42:55,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156705343] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:55,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:55,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:55,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355391550] [2022-07-13 11:42:55,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:55,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:55,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:55,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:55,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:55,205 INFO L87 Difference]: Start difference. First operand 1265 states and 1827 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:56,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:56,011 INFO L93 Difference]: Finished difference Result 2651 states and 3826 transitions. [2022-07-13 11:42:56,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:56,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 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 163 [2022-07-13 11:42:56,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:56,014 INFO L225 Difference]: With dead ends: 2651 [2022-07-13 11:42:56,014 INFO L226 Difference]: Without dead ends: 1409 [2022-07-13 11:42:56,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:56,016 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 121 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:56,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 400 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 11:42:56,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2022-07-13 11:42:56,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1189. [2022-07-13 11:42:56,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1189 states, 1188 states have (on average 1.4436026936026936) internal successors, (1715), 1188 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:56,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1189 states to 1189 states and 1715 transitions. [2022-07-13 11:42:56,036 INFO L78 Accepts]: Start accepts. Automaton has 1189 states and 1715 transitions. Word has length 163 [2022-07-13 11:42:56,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:56,036 INFO L495 AbstractCegarLoop]: Abstraction has 1189 states and 1715 transitions. [2022-07-13 11:42:56,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:56,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 1715 transitions. [2022-07-13 11:42:56,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-13 11:42:56,038 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:56,038 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2022-07-13 11:42:56,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-07-13 11:42:56,038 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:56,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:56,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1991742780, now seen corresponding path program 1 times [2022-07-13 11:42:56,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:56,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246727999] [2022-07-13 11:42:56,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:56,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:56,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:56,160 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-13 11:42:56,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:56,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246727999] [2022-07-13 11:42:56,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246727999] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:56,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:56,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:56,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233443954] [2022-07-13 11:42:56,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:56,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:56,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:56,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:56,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:56,164 INFO L87 Difference]: Start difference. First operand 1189 states and 1715 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:56,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:56,822 INFO L93 Difference]: Finished difference Result 2515 states and 3626 transitions. [2022-07-13 11:42:56,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:56,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 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 165 [2022-07-13 11:42:56,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:56,825 INFO L225 Difference]: With dead ends: 2515 [2022-07-13 11:42:56,825 INFO L226 Difference]: Without dead ends: 1349 [2022-07-13 11:42:56,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:56,826 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 62 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:56,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 599 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 11:42:56,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2022-07-13 11:42:56,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1275. [2022-07-13 11:42:56,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1275 states, 1274 states have (on average 1.4419152276295133) internal successors, (1837), 1274 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:56,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1837 transitions. [2022-07-13 11:42:56,850 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1837 transitions. Word has length 165 [2022-07-13 11:42:56,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:56,850 INFO L495 AbstractCegarLoop]: Abstraction has 1275 states and 1837 transitions. [2022-07-13 11:42:56,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:56,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1837 transitions. [2022-07-13 11:42:56,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-13 11:42:56,853 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:56,853 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2022-07-13 11:42:56,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-07-13 11:42:56,853 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:56,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:56,854 INFO L85 PathProgramCache]: Analyzing trace with hash -204178227, now seen corresponding path program 1 times [2022-07-13 11:42:56,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:56,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759133714] [2022-07-13 11:42:56,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:56,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:56,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:56,974 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-13 11:42:56,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:56,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759133714] [2022-07-13 11:42:56,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759133714] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:56,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:56,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:42:56,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531437498] [2022-07-13 11:42:56,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:56,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:56,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:56,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:56,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:56,976 INFO L87 Difference]: Start difference. First operand 1275 states and 1837 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:58,258 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:42:58,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:58,478 INFO L93 Difference]: Finished difference Result 2591 states and 3733 transitions. [2022-07-13 11:42:58,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:58,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 166 [2022-07-13 11:42:58,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:58,481 INFO L225 Difference]: With dead ends: 2591 [2022-07-13 11:42:58,481 INFO L226 Difference]: Without dead ends: 1335 [2022-07-13 11:42:58,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:58,482 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 54 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:58,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 601 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-13 11:42:58,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2022-07-13 11:42:58,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1273. [2022-07-13 11:42:58,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1273 states, 1272 states have (on average 1.4410377358490567) internal successors, (1833), 1272 states have internal predecessors, (1833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:58,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 1833 transitions. [2022-07-13 11:42:58,501 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 1833 transitions. Word has length 166 [2022-07-13 11:42:58,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:58,501 INFO L495 AbstractCegarLoop]: Abstraction has 1273 states and 1833 transitions. [2022-07-13 11:42:58,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:58,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1833 transitions. [2022-07-13 11:42:58,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-07-13 11:42:58,503 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:58,503 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, 1, 1, 1, 1, 1, 1] [2022-07-13 11:42:58,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-07-13 11:42:58,503 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:58,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:58,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1438223023, now seen corresponding path program 1 times [2022-07-13 11:42:58,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:58,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224675358] [2022-07-13 11:42:58,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:58,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:58,866 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2022-07-13 11:42:58,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:58,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224675358] [2022-07-13 11:42:58,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224675358] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:58,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:58,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:42:58,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921070269] [2022-07-13 11:42:58,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:58,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:42:58,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:58,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:42:58,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:58,869 INFO L87 Difference]: Start difference. First operand 1273 states and 1833 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:59,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:59,786 INFO L93 Difference]: Finished difference Result 2543 states and 3662 transitions. [2022-07-13 11:42:59,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:42:59,787 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 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 172 [2022-07-13 11:42:59,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:59,789 INFO L225 Difference]: With dead ends: 2543 [2022-07-13 11:42:59,789 INFO L226 Difference]: Without dead ends: 1273 [2022-07-13 11:42:59,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:42:59,793 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 7 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:59,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 735 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-13 11:42:59,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2022-07-13 11:42:59,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 1273. [2022-07-13 11:42:59,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1273 states, 1272 states have (on average 1.440251572327044) internal successors, (1832), 1272 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:59,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 1832 transitions. [2022-07-13 11:42:59,825 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 1832 transitions. Word has length 172 [2022-07-13 11:42:59,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:59,825 INFO L495 AbstractCegarLoop]: Abstraction has 1273 states and 1832 transitions. [2022-07-13 11:42:59,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:59,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1832 transitions. [2022-07-13 11:42:59,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-07-13 11:42:59,827 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:59,827 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, 1, 1, 1, 1, 1, 1] [2022-07-13 11:42:59,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-07-13 11:42:59,828 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:59,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:59,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1353645967, now seen corresponding path program 1 times [2022-07-13 11:42:59,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:59,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327238392] [2022-07-13 11:42:59,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:59,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:43:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:43:00,540 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 146 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-13 11:43:00,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:43:00,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327238392] [2022-07-13 11:43:00,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327238392] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:43:00,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927045322] [2022-07-13 11:43:00,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:43:00,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:43:00,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:43:00,543 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:43:00,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 11:43:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:43:01,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 1086 conjuncts, 190 conjunts are in the unsatisfiable core [2022-07-13 11:43:01,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:43:01,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:43:01,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:43:01,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:43:01,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:43:01,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:43:02,123 INFO L356 Elim1Store]: treesize reduction 1040, result has 8.0 percent of original size [2022-07-13 11:43:02,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 10 case distinctions, treesize of input 10489949 treesize of output 1501290 [2022-07-13 11:43:02,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:43:02,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:43:02,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:43:08,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:43:08,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:43:08,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:43:08,411 INFO L244 Elim1Store]: Index analysis took 400 ms [2022-07-13 11:43:59,803 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-13 11:43:59,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-13 11:44:00,004 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,SelfDestructingSolverStorable45 [2022-07-13 11:44:00,005 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 216927 column 7: canceled at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:184) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:164) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:152) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:764) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:725) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:643) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:335) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 216927 column 7: canceled at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.push(UndoableWrapperScript.java:54) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.pushContext(SimplifyDDA.java:736) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:389) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:648) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:198) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:182) ... 54 more [2022-07-13 11:44:00,011 INFO L158 Benchmark]: Toolchain (without parser) took 115883.64ms. Allocated memory was 94.4MB in the beginning and 11.2GB in the end (delta: 11.1GB). Free memory was 59.1MB in the beginning and 7.3GB in the end (delta: -7.3GB). Peak memory consumption was 5.2GB. Max. memory is 16.1GB. [2022-07-13 11:44:00,011 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 94.4MB. Free memory was 48.2MB in the beginning and 48.2MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 11:44:00,011 INFO L158 Benchmark]: CACSL2BoogieTranslator took 630.22ms. Allocated memory is still 94.4MB. Free memory was 59.0MB in the beginning and 49.6MB in the end (delta: 9.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 11:44:00,011 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.73ms. Allocated memory is still 94.4MB. Free memory was 49.6MB in the beginning and 44.6MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 11:44:00,011 INFO L158 Benchmark]: Boogie Preprocessor took 99.61ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 44.6MB in the beginning and 85.2MB in the end (delta: -40.5MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2022-07-13 11:44:00,011 INFO L158 Benchmark]: RCFGBuilder took 2663.03ms. Allocated memory is still 113.2MB. Free memory was 85.2MB in the beginning and 47.0MB in the end (delta: 38.2MB). Peak memory consumption was 46.5MB. Max. memory is 16.1GB. [2022-07-13 11:44:00,011 INFO L158 Benchmark]: TraceAbstraction took 112394.18ms. Allocated memory was 113.2MB in the beginning and 11.2GB in the end (delta: 11.1GB). Free memory was 46.3MB in the beginning and 7.3GB in the end (delta: -7.3GB). Peak memory consumption was 5.1GB. Max. memory is 16.1GB. [2022-07-13 11:44:00,012 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 94.4MB. Free memory was 48.2MB in the beginning and 48.2MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 630.22ms. Allocated memory is still 94.4MB. Free memory was 59.0MB in the beginning and 49.6MB in the end (delta: 9.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.73ms. Allocated memory is still 94.4MB. Free memory was 49.6MB in the beginning and 44.6MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.61ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 44.6MB in the beginning and 85.2MB in the end (delta: -40.5MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * RCFGBuilder took 2663.03ms. Allocated memory is still 113.2MB. Free memory was 85.2MB in the beginning and 47.0MB in the end (delta: 38.2MB). Peak memory consumption was 46.5MB. Max. memory is 16.1GB. * TraceAbstraction took 112394.18ms. Allocated memory was 113.2MB in the beginning and 11.2GB in the end (delta: 11.1GB). Free memory was 46.3MB in the beginning and 7.3GB in the end (delta: -7.3GB). Peak memory consumption was 5.1GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 216927 column 7: canceled de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 216927 column 7: canceled: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:184) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-13 11:44:00,223 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-07-13 11:44:00,243 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 137 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.16.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 0b79f6e49ac032444452c6675a01007f08f3b698920d88701561807a0669494d --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:44:02,107 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:44:02,108 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:44:02,160 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:44:02,160 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:44:02,161 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:44:02,165 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:44:02,167 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:44:02,169 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:44:02,173 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:44:02,174 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:44:02,176 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:44:02,176 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:44:02,178 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:44:02,180 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:44:02,185 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:44:02,186 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:44:02,188 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:44:02,189 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:44:02,193 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:44:02,195 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:44:02,195 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:44:02,197 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:44:02,198 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:44:02,200 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:44:02,204 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:44:02,204 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:44:02,205 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:44:02,205 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:44:02,206 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:44:02,207 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:44:02,207 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:44:02,208 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:44:02,209 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:44:02,210 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:44:02,211 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:44:02,211 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:44:02,212 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:44:02,212 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:44:02,212 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:44:02,213 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:44:02,214 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:44:02,219 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-13 11:44:02,252 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:44:02,252 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:44:02,253 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:44:02,253 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:44:02,253 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:44:02,254 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:44:02,254 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:44:02,254 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:44:02,255 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:44:02,255 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:44:02,256 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:44:02,256 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:44:02,256 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:44:02,256 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:44:02,256 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:44:02,257 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:44:02,257 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 11:44:02,257 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 11:44:02,257 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 11:44:02,257 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:44:02,257 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:44:02,258 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:44:02,258 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:44:02,258 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:44:02,258 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:44:02,258 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:44:02,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:44:02,259 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:44:02,259 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:44:02,259 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:44:02,259 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 11:44:02,260 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 11:44:02,260 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:44:02,260 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:44:02,260 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:44:02,260 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 11:44:02,261 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 -> 0b79f6e49ac032444452c6675a01007f08f3b698920d88701561807a0669494d [2022-07-13 11:44:02,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:44:02,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:44:02,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:44:02,579 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:44:02,580 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:44:02,581 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.16.i.cil-1.c [2022-07-13 11:44:02,639 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00cfb30de/34f7052151a744b39b91eb7bb248ff34/FLAG03b3318b5 [2022-07-13 11:44:03,177 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:44:03,177 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.16.i.cil-1.c [2022-07-13 11:44:03,194 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00cfb30de/34f7052151a744b39b91eb7bb248ff34/FLAG03b3318b5 [2022-07-13 11:44:03,462 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00cfb30de/34f7052151a744b39b91eb7bb248ff34 [2022-07-13 11:44:03,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:44:03,465 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:44:03,467 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:44:03,467 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:44:03,470 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:44:03,470 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:44:03" (1/1) ... [2022-07-13 11:44:03,472 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7505b820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:44:03, skipping insertion in model container [2022-07-13 11:44:03,472 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:44:03" (1/1) ... [2022-07-13 11:44:03,485 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:44:03,553 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:44:03,951 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.16.i.cil-1.c[77378,77391] [2022-07-13 11:44:03,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:44:03,997 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-13 11:44:04,014 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:44:04,143 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.16.i.cil-1.c[77378,77391] [2022-07-13 11:44:04,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:44:04,150 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:44:04,213 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.16.i.cil-1.c[77378,77391] [2022-07-13 11:44:04,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:44:04,229 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:44:04,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:44:04 WrapperNode [2022-07-13 11:44:04,230 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:44:04,231 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:44:04,231 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:44:04,231 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:44:04,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:44:04" (1/1) ... [2022-07-13 11:44:04,265 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:44:04" (1/1) ... [2022-07-13 11:44:04,321 INFO L137 Inliner]: procedures = 35, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 779 [2022-07-13 11:44:04,322 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:44:04,323 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:44:04,323 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:44:04,323 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:44:04,330 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:44:04" (1/1) ... [2022-07-13 11:44:04,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:44:04" (1/1) ... [2022-07-13 11:44:04,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:44:04" (1/1) ... [2022-07-13 11:44:04,339 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:44:04" (1/1) ... [2022-07-13 11:44:04,368 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:44:04" (1/1) ... [2022-07-13 11:44:04,375 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:44:04" (1/1) ... [2022-07-13 11:44:04,378 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:44:04" (1/1) ... [2022-07-13 11:44:04,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:44:04,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:44:04,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:44:04,383 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:44:04,384 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:44:04" (1/1) ... [2022-07-13 11:44:04,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:44:04,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:44:04,413 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 11:44:04,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 11:44:04,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:44:04,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 11:44:04,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 11:44:04,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-13 11:44:04,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 11:44:04,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 11:44:04,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:44:04,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:44:04,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-13 11:44:04,641 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:44:04,643 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:44:04,676 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:44:13,041 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-13 11:44:13,042 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-13 11:44:13,042 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:44:13,052 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:44:13,052 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 11:44:13,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:44:13 BoogieIcfgContainer [2022-07-13 11:44:13,056 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:44:13,057 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:44:13,058 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:44:13,060 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:44:13,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:44:03" (1/3) ... [2022-07-13 11:44:13,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f106615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:44:13, skipping insertion in model container [2022-07-13 11:44:13,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:44:04" (2/3) ... [2022-07-13 11:44:13,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f106615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:44:13, skipping insertion in model container [2022-07-13 11:44:13,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:44:13" (3/3) ... [2022-07-13 11:44:13,068 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.16.i.cil-1.c [2022-07-13 11:44:13,080 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:44:13,081 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:44:13,144 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:44:13,153 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@2081483e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@35d2e59a [2022-07-13 11:44:13,171 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:44:13,176 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 156 states have (on average 1.7307692307692308) internal successors, (270), 157 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:44:13,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 11:44:13,188 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:44:13,189 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:44:13,189 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:44:13,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:44:13,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1590777092, now seen corresponding path program 1 times [2022-07-13 11:44:13,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:44:13,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [650540253] [2022-07-13 11:44:13,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:44:13,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:44:13,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:44:13,215 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:44:13,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-13 11:44:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:44:14,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-13 11:44:14,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:44:14,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 11:44:14,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 11:44:14,864 INFO L356 Elim1Store]: treesize reduction 1496, result has 4.7 percent of original size [2022-07-13 11:44:14,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 78 treesize of output 85 [2022-07-13 11:44:14,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:14,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:14,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:14,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:14,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:14,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:14,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:14,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:14,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:14,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:14,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:14,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:14,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:14,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:14,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:14,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:14,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:14,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:14,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:14,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:14,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:14,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:14,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:14,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:14,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:14,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:14,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:14,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:14,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:14,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:14,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:14,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:14,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:14,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:14,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:14,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:14,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 36 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 85 [2022-07-13 11:44:15,151 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-13 11:44:15,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 49 [2022-07-13 11:44:15,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:15,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:15,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:15,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:15,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:15,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:15,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:15,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:15,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:15,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:15,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 49 [2022-07-13 11:44:15,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-13 11:44:15,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-13 11:44:15,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:44:15,261 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:44:15,261 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:44:15,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [650540253] [2022-07-13 11:44:15,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [650540253] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:44:15,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:44:15,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:44:15,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330007406] [2022-07-13 11:44:15,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:44:15,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:44:15,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:44:15,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:44:15,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:44:15,301 INFO L87 Difference]: Start difference. First operand has 158 states, 156 states have (on average 1.7307692307692308) internal successors, (270), 157 states have internal predecessors, (270), 0 states have call successors, (0), 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 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:44:17,334 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:44:19,346 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:44:22,525 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:44:26,477 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:44:30,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:44:30,528 INFO L93 Difference]: Finished difference Result 317 states and 539 transitions. [2022-07-13 11:44:30,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:44:30,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2022-07-13 11:44:30,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:44:30,545 INFO L225 Difference]: With dead ends: 317 [2022-07-13 11:44:30,546 INFO L226 Difference]: Without dead ends: 145 [2022-07-13 11:44:30,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:44:30,559 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 10 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:44:30,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 889 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 176 Invalid, 2 Unknown, 0 Unchecked, 15.1s Time] [2022-07-13 11:44:30,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-13 11:44:30,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2022-07-13 11:44:30,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.5625) internal successors, (225), 144 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:44:30,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 225 transitions. [2022-07-13 11:44:30,600 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 225 transitions. Word has length 45 [2022-07-13 11:44:30,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:44:30,601 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 225 transitions. [2022-07-13 11:44:30,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:44:30,601 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 225 transitions. [2022-07-13 11:44:30,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 11:44:30,603 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:44:30,603 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:44:30,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-13 11:44:30,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:44:30,804 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:44:30,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:44:30,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1806796926, now seen corresponding path program 1 times [2022-07-13 11:44:30,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:44:30,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1063780399] [2022-07-13 11:44:30,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:44:30,806 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:44:30,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:44:30,807 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:44:30,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-13 11:44:31,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:44:31,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 11:44:31,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:44:31,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:31,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:31,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:31,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:31,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:44:31,596 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:44:31,910 INFO L356 Elim1Store]: treesize reduction 1124, result has 5.4 percent of original size [2022-07-13 11:44:31,910 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 72 treesize of output 74 [2022-07-13 11:44:32,224 INFO L356 Elim1Store]: treesize reduction 825, result has 7.2 percent of original size [2022-07-13 11:44:32,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 13 case distinctions, treesize of input 66 treesize of output 86 [2022-07-13 11:44:32,496 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 11:44:32,496 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 71 treesize of output 23 [2022-07-13 11:44:32,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:44:32,515 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:44:32,515 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:44:32,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1063780399] [2022-07-13 11:44:32,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1063780399] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:44:32,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:44:32,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:44:32,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285985980] [2022-07-13 11:44:32,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:44:32,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:44:32,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:44:32,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:44:32,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:44:32,518 INFO L87 Difference]: Start difference. First operand 145 states and 225 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:44:34,537 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:44:40,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:44:40,641 INFO L93 Difference]: Finished difference Result 308 states and 478 transitions. [2022-07-13 11:44:40,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:44:40,642 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2022-07-13 11:44:40,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:44:40,644 INFO L225 Difference]: With dead ends: 308 [2022-07-13 11:44:40,644 INFO L226 Difference]: Without dead ends: 173 [2022-07-13 11:44:40,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:44:40,645 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 22 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:44:40,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 515 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 149 Invalid, 1 Unknown, 0 Unchecked, 8.1s Time] [2022-07-13 11:44:40,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-07-13 11:44:40,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 156. [2022-07-13 11:44:40,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.5741935483870968) internal successors, (244), 155 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:44:40,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 244 transitions. [2022-07-13 11:44:40,656 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 244 transitions. Word has length 45 [2022-07-13 11:44:40,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:44:40,656 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 244 transitions. [2022-07-13 11:44:40,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:44:40,657 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 244 transitions. [2022-07-13 11:44:40,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-13 11:44:40,658 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:44:40,658 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:44:40,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-13 11:44:40,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:44:40,864 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:44:40,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:44:40,864 INFO L85 PathProgramCache]: Analyzing trace with hash 774668882, now seen corresponding path program 1 times [2022-07-13 11:44:40,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:44:40,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [17160694] [2022-07-13 11:44:40,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:44:40,866 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:44:40,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:44:40,867 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:44:40,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-13 11:44:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:44:41,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 11:44:41,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:44:42,046 INFO L356 Elim1Store]: treesize reduction 1104, result has 5.5 percent of original size [2022-07-13 11:44:42,046 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 69 treesize of output 73 [2022-07-13 11:44:42,164 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-13 11:44:42,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 49 [2022-07-13 11:44:42,223 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 11:44:42,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-13 11:44:42,257 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:44:42,259 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:44:42,259 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:44:42,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [17160694] [2022-07-13 11:44:42,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [17160694] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:44:42,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:44:42,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:44:42,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247611256] [2022-07-13 11:44:42,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:44:42,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:44:42,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:44:42,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:44:42,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:44:42,266 INFO L87 Difference]: Start difference. First operand 156 states and 244 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:44:44,286 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:44:47,607 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:44:48,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:44:48,690 INFO L93 Difference]: Finished difference Result 302 states and 470 transitions. [2022-07-13 11:44:48,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:44:48,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-07-13 11:44:48,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:44:48,694 INFO L225 Difference]: With dead ends: 302 [2022-07-13 11:44:48,694 INFO L226 Difference]: Without dead ends: 167 [2022-07-13 11:44:48,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:44:48,696 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 17 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:44:48,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 544 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 111 Invalid, 1 Unknown, 20 Unchecked, 6.4s Time] [2022-07-13 11:44:48,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-13 11:44:48,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 156. [2022-07-13 11:44:48,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.5677419354838709) internal successors, (243), 155 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:44:48,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 243 transitions. [2022-07-13 11:44:48,708 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 243 transitions. Word has length 58 [2022-07-13 11:44:48,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:44:48,709 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 243 transitions. [2022-07-13 11:44:48,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:44:48,709 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 243 transitions. [2022-07-13 11:44:48,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-13 11:44:48,711 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:44:48,711 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:44:48,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-13 11:44:48,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:44:48,932 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:44:48,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:44:48,932 INFO L85 PathProgramCache]: Analyzing trace with hash -713896793, now seen corresponding path program 1 times [2022-07-13 11:44:48,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:44:48,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [379638894] [2022-07-13 11:44:48,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:44:48,933 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:44:48,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:44:48,935 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:44:48,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-13 11:44:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:44:49,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 11:44:49,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:44:50,267 INFO L356 Elim1Store]: treesize reduction 1105, result has 5.5 percent of original size [2022-07-13 11:44:50,267 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 69 treesize of output 73 [2022-07-13 11:44:50,395 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-13 11:44:50,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 49 [2022-07-13 11:44:50,429 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 11:44:50,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-13 11:44:50,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:44:50,451 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:44:50,451 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:44:50,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [379638894] [2022-07-13 11:44:50,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [379638894] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:44:50,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:44:50,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:44:50,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960188841] [2022-07-13 11:44:50,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:44:50,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:44:50,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:44:50,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:44:50,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:44:50,453 INFO L87 Difference]: Start difference. First operand 156 states and 243 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:44:52,473 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:44:54,179 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:44:54,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:44:54,345 INFO L93 Difference]: Finished difference Result 303 states and 473 transitions. [2022-07-13 11:44:54,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:44:54,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-07-13 11:44:54,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:44:54,347 INFO L225 Difference]: With dead ends: 303 [2022-07-13 11:44:54,347 INFO L226 Difference]: Without dead ends: 168 [2022-07-13 11:44:54,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:44:54,349 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 18 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-13 11:44:54,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 542 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 87 Invalid, 1 Unknown, 15 Unchecked, 3.9s Time] [2022-07-13 11:44:54,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-13 11:44:54,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2022-07-13 11:44:54,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.5508982035928143) internal successors, (259), 167 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:44:54,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 259 transitions. [2022-07-13 11:44:54,360 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 259 transitions. Word has length 59 [2022-07-13 11:44:54,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:44:54,361 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 259 transitions. [2022-07-13 11:44:54,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:44:54,361 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 259 transitions. [2022-07-13 11:44:54,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-13 11:44:54,362 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:44:54,363 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:44:54,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-13 11:44:54,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:44:54,580 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:44:54,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:44:54,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1173006651, now seen corresponding path program 1 times [2022-07-13 11:44:54,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:44:54,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1328591543] [2022-07-13 11:44:54,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:44:54,581 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:44:54,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:44:54,582 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:44:54,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-13 11:44:55,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:44:55,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 11:44:55,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:44:55,863 INFO L356 Elim1Store]: treesize reduction 1105, result has 5.5 percent of original size [2022-07-13 11:44:55,863 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 69 treesize of output 73 [2022-07-13 11:44:55,990 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-13 11:44:55,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 49 [2022-07-13 11:44:56,026 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 11:44:56,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-13 11:44:56,048 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:44:56,049 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:44:56,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:44:56,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1328591543] [2022-07-13 11:44:56,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1328591543] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:44:56,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:44:56,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:44:56,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748321760] [2022-07-13 11:44:56,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:44:56,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:44:56,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:44:56,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:44:56,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:44:56,051 INFO L87 Difference]: Start difference. First operand 168 states and 259 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:44:58,067 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:44:59,917 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:45:00,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:45:00,078 INFO L93 Difference]: Finished difference Result 316 states and 490 transitions. [2022-07-13 11:45:00,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:45:00,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-07-13 11:45:00,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:45:00,081 INFO L225 Difference]: With dead ends: 316 [2022-07-13 11:45:00,081 INFO L226 Difference]: Without dead ends: 169 [2022-07-13 11:45:00,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:45:00,082 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 18 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:45:00,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 566 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 88 Invalid, 1 Unknown, 16 Unchecked, 4.0s Time] [2022-07-13 11:45:00,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-07-13 11:45:00,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2022-07-13 11:45:00,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.5416666666666667) internal successors, (259), 168 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:45:00,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 259 transitions. [2022-07-13 11:45:00,091 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 259 transitions. Word has length 59 [2022-07-13 11:45:00,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:45:00,091 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 259 transitions. [2022-07-13 11:45:00,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:45:00,092 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 259 transitions. [2022-07-13 11:45:00,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-13 11:45:00,093 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:45:00,093 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:45:00,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-13 11:45:00,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:45:00,303 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:45:00,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:45:00,304 INFO L85 PathProgramCache]: Analyzing trace with hash 320889874, now seen corresponding path program 1 times [2022-07-13 11:45:00,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:45:00,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1507293811] [2022-07-13 11:45:00,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:45:00,305 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:45:00,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:45:00,306 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:45:00,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-13 11:45:01,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:45:01,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 11:45:01,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:45:01,573 INFO L356 Elim1Store]: treesize reduction 1104, result has 5.5 percent of original size [2022-07-13 11:45:01,574 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 69 treesize of output 73 [2022-07-13 11:45:01,720 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-13 11:45:01,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 49 [2022-07-13 11:45:01,765 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 11:45:01,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-13 11:45:01,786 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:45:01,786 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:45:01,786 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:45:01,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1507293811] [2022-07-13 11:45:01,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1507293811] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:45:01,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:45:01,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:45:01,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756224483] [2022-07-13 11:45:01,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:45:01,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:45:01,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:45:01,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:45:01,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:45:01,789 INFO L87 Difference]: Start difference. First operand 169 states and 259 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:45:03,804 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:45:08,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:45:08,535 INFO L93 Difference]: Finished difference Result 329 states and 504 transitions. [2022-07-13 11:45:08,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:45:08,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-07-13 11:45:08,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:45:08,537 INFO L225 Difference]: With dead ends: 329 [2022-07-13 11:45:08,537 INFO L226 Difference]: Without dead ends: 181 [2022-07-13 11:45:08,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:45:08,539 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 16 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-07-13 11:45:08,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 525 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 114 Invalid, 1 Unknown, 23 Unchecked, 6.7s Time] [2022-07-13 11:45:08,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-07-13 11:45:08,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 169. [2022-07-13 11:45:08,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.5357142857142858) internal successors, (258), 168 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:45:08,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 258 transitions. [2022-07-13 11:45:08,545 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 258 transitions. Word has length 59 [2022-07-13 11:45:08,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:45:08,545 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 258 transitions. [2022-07-13 11:45:08,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:45:08,546 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 258 transitions. [2022-07-13 11:45:08,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-13 11:45:08,547 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:45:08,547 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:45:08,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-13 11:45:08,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:45:08,760 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:45:08,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:45:08,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1682330414, now seen corresponding path program 1 times [2022-07-13 11:45:08,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:45:08,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1893788969] [2022-07-13 11:45:08,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:45:08,762 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:45:08,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:45:08,763 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:45:08,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-13 11:45:09,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:45:09,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 11:45:09,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:45:10,058 INFO L356 Elim1Store]: treesize reduction 1104, result has 5.5 percent of original size [2022-07-13 11:45:10,058 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 69 treesize of output 73 [2022-07-13 11:45:10,182 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-13 11:45:10,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 49 [2022-07-13 11:45:10,222 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 11:45:10,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-13 11:45:10,244 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:45:10,244 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:45:10,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:45:10,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1893788969] [2022-07-13 11:45:10,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1893788969] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:45:10,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:45:10,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:45:10,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993954237] [2022-07-13 11:45:10,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:45:10,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:45:10,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:45:10,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:45:10,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:45:10,247 INFO L87 Difference]: Start difference. First operand 169 states and 258 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:45:12,268 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:45:16,277 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:45:16,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:45:16,670 INFO L93 Difference]: Finished difference Result 327 states and 501 transitions. [2022-07-13 11:45:16,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:45:16,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-07-13 11:45:16,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:45:16,672 INFO L225 Difference]: With dead ends: 327 [2022-07-13 11:45:16,672 INFO L226 Difference]: Without dead ends: 179 [2022-07-13 11:45:16,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:45:16,673 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 15 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:45:16,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 531 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 111 Invalid, 1 Unknown, 20 Unchecked, 6.4s Time] [2022-07-13 11:45:16,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-07-13 11:45:16,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 169. [2022-07-13 11:45:16,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.5297619047619047) internal successors, (257), 168 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:45:16,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 257 transitions. [2022-07-13 11:45:16,686 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 257 transitions. Word has length 59 [2022-07-13 11:45:16,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:45:16,686 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 257 transitions. [2022-07-13 11:45:16,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:45:16,686 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 257 transitions. [2022-07-13 11:45:16,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-13 11:45:16,687 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:45:16,688 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:45:16,711 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-13 11:45:16,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:45:16,905 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:45:16,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:45:16,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1666972293, now seen corresponding path program 1 times [2022-07-13 11:45:16,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:45:16,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [902120335] [2022-07-13 11:45:16,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:45:16,906 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:45:16,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:45:16,907 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:45:16,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-13 11:45:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:45:17,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 11:45:17,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:45:18,195 INFO L356 Elim1Store]: treesize reduction 1105, result has 5.5 percent of original size [2022-07-13 11:45:18,196 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 69 treesize of output 73 [2022-07-13 11:45:18,315 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-13 11:45:18,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 49 [2022-07-13 11:45:18,353 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 11:45:18,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-13 11:45:18,374 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:45:18,374 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:45:18,374 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:45:18,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [902120335] [2022-07-13 11:45:18,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [902120335] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:45:18,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:45:18,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:45:18,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246942981] [2022-07-13 11:45:18,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:45:18,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:45:18,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:45:18,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:45:18,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:45:18,376 INFO L87 Difference]: Start difference. First operand 169 states and 257 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:45:20,397 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:45:21,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:45:21,989 INFO L93 Difference]: Finished difference Result 318 states and 489 transitions. [2022-07-13 11:45:21,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:45:21,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2022-07-13 11:45:21,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:45:21,992 INFO L225 Difference]: With dead ends: 318 [2022-07-13 11:45:21,992 INFO L226 Difference]: Without dead ends: 170 [2022-07-13 11:45:21,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:45:21,993 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 18 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-13 11:45:21,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 538 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 89 Invalid, 1 Unknown, 17 Unchecked, 3.6s Time] [2022-07-13 11:45:21,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-07-13 11:45:21,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2022-07-13 11:45:21,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.5207100591715976) internal successors, (257), 169 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:45:21,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 257 transitions. [2022-07-13 11:45:21,997 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 257 transitions. Word has length 60 [2022-07-13 11:45:21,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:45:21,997 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 257 transitions. [2022-07-13 11:45:21,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:45:21,998 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 257 transitions. [2022-07-13 11:45:21,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-13 11:45:21,998 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:45:21,998 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:45:22,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-13 11:45:22,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:45:22,199 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:45:22,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:45:22,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1752756352, now seen corresponding path program 1 times [2022-07-13 11:45:22,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:45:22,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1962162017] [2022-07-13 11:45:22,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:45:22,200 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:45:22,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:45:22,201 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:45:22,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-13 11:45:23,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:45:23,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 710 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 11:45:23,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:45:23,508 INFO L356 Elim1Store]: treesize reduction 1105, result has 5.5 percent of original size [2022-07-13 11:45:23,509 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 69 treesize of output 73 [2022-07-13 11:45:23,652 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-13 11:45:23,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 49 [2022-07-13 11:45:23,681 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 11:45:23,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-13 11:45:23,700 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:45:23,700 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:45:23,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:45:23,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1962162017] [2022-07-13 11:45:23,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1962162017] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:45:23,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:45:23,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:45:23,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853010019] [2022-07-13 11:45:23,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:45:23,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:45:23,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:45:23,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:45:23,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:45:23,702 INFO L87 Difference]: Start difference. First operand 170 states and 257 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:45:25,721 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:45:27,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:45:27,128 INFO L93 Difference]: Finished difference Result 320 states and 490 transitions. [2022-07-13 11:45:27,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:45:27,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2022-07-13 11:45:27,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:45:27,130 INFO L225 Difference]: With dead ends: 320 [2022-07-13 11:45:27,130 INFO L226 Difference]: Without dead ends: 171 [2022-07-13 11:45:27,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:45:27,131 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 18 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:45:27,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 536 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 90 Invalid, 1 Unknown, 18 Unchecked, 3.4s Time] [2022-07-13 11:45:27,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-13 11:45:27,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2022-07-13 11:45:27,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.511764705882353) internal successors, (257), 170 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:45:27,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 257 transitions. [2022-07-13 11:45:27,135 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 257 transitions. Word has length 61 [2022-07-13 11:45:27,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:45:27,136 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 257 transitions. [2022-07-13 11:45:27,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:45:27,136 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 257 transitions. [2022-07-13 11:45:27,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-13 11:45:27,136 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:45:27,137 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:45:27,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-13 11:45:27,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:45:27,337 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:45:27,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:45:27,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1654924640, now seen corresponding path program 1 times [2022-07-13 11:45:27,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:45:27,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1687048326] [2022-07-13 11:45:27,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:45:27,339 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:45:27,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:45:27,340 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:45:27,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-13 11:45:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:45:28,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 11:45:28,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:45:28,643 INFO L356 Elim1Store]: treesize reduction 1105, result has 5.5 percent of original size [2022-07-13 11:45:28,644 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 69 treesize of output 73 [2022-07-13 11:45:28,759 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-13 11:45:28,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 49 [2022-07-13 11:45:28,812 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 11:45:28,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-13 11:45:28,831 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:45:28,831 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:45:28,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:45:28,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1687048326] [2022-07-13 11:45:28,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1687048326] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:45:28,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:45:28,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:45:28,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079858859] [2022-07-13 11:45:28,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:45:28,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:45:28,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:45:28,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:45:28,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:45:28,833 INFO L87 Difference]: Start difference. First operand 171 states and 257 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:45:30,853 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:45:32,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:45:32,135 INFO L93 Difference]: Finished difference Result 322 states and 491 transitions. [2022-07-13 11:45:32,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:45:32,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-07-13 11:45:32,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:45:32,138 INFO L225 Difference]: With dead ends: 322 [2022-07-13 11:45:32,138 INFO L226 Difference]: Without dead ends: 172 [2022-07-13 11:45:32,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:45:32,139 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 18 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:45:32,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 542 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 91 Invalid, 1 Unknown, 19 Unchecked, 3.3s Time] [2022-07-13 11:45:32,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-07-13 11:45:32,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2022-07-13 11:45:32,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.5029239766081872) internal successors, (257), 171 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:45:32,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 257 transitions. [2022-07-13 11:45:32,143 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 257 transitions. Word has length 62 [2022-07-13 11:45:32,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:45:32,143 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 257 transitions. [2022-07-13 11:45:32,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:45:32,143 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 257 transitions. [2022-07-13 11:45:32,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-13 11:45:32,144 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:45:32,144 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:45:32,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-13 11:45:32,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:45:32,345 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:45:32,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:45:32,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1043051208, now seen corresponding path program 1 times [2022-07-13 11:45:32,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:45:32,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1731973] [2022-07-13 11:45:32,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:45:32,346 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:45:32,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:45:32,347 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:45:32,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-13 11:45:33,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:45:33,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 11:45:33,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:45:33,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:45:33,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:45:33,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:45:33,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:45:33,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:45:33,410 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:45:33,742 INFO L356 Elim1Store]: treesize reduction 1109, result has 5.5 percent of original size [2022-07-13 11:45:33,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 52 treesize of output 73 [2022-07-13 11:45:34,043 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 11:45:34,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 22 [2022-07-13 11:45:34,060 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:45:34,060 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:45:34,060 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:45:34,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1731973] [2022-07-13 11:45:34,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1731973] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:45:34,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:45:34,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:45:34,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911631776] [2022-07-13 11:45:34,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:45:34,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:45:34,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:45:34,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:45:34,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:45:34,062 INFO L87 Difference]: Start difference. First operand 172 states and 257 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:45:36,076 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:45:38,351 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:45:41,291 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:45:43,433 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:45:43,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:45:43,883 INFO L93 Difference]: Finished difference Result 355 states and 537 transitions. [2022-07-13 11:45:43,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:45:43,884 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-07-13 11:45:43,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:45:43,885 INFO L225 Difference]: With dead ends: 355 [2022-07-13 11:45:43,885 INFO L226 Difference]: Without dead ends: 204 [2022-07-13 11:45:43,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:45:43,886 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 22 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2022-07-13 11:45:43,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 553 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 150 Invalid, 1 Unknown, 0 Unchecked, 9.8s Time] [2022-07-13 11:45:43,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-07-13 11:45:43,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 194. [2022-07-13 11:45:43,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.5025906735751295) internal successors, (290), 193 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:45:43,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 290 transitions. [2022-07-13 11:45:43,891 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 290 transitions. Word has length 62 [2022-07-13 11:45:43,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:45:43,891 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 290 transitions. [2022-07-13 11:45:43,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:45:43,891 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 290 transitions. [2022-07-13 11:45:43,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-13 11:45:43,892 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:45:43,892 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2022-07-13 11:45:43,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-13 11:45:44,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:45:44,093 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:45:44,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:45:44,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1596121160, now seen corresponding path program 1 times [2022-07-13 11:45:44,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:45:44,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [630246441] [2022-07-13 11:45:44,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:45:44,094 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:45:44,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:45:44,095 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:45:44,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-13 11:45:45,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:45:45,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 11:45:45,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:45:45,553 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-13 11:45:45,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-13 11:45:45,613 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 11:45:45,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-13 11:45:45,630 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:45:45,631 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:45:45,631 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:45:45,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [630246441] [2022-07-13 11:45:45,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [630246441] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:45:45,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:45:45,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:45:45,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084612403] [2022-07-13 11:45:45,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:45:45,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:45:45,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:45:45,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:45:45,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:45:45,632 INFO L87 Difference]: Start difference. First operand 194 states and 290 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:45:47,654 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:45:52,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:45:52,352 INFO L93 Difference]: Finished difference Result 367 states and 556 transitions. [2022-07-13 11:45:52,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:45:52,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 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 75 [2022-07-13 11:45:52,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:45:52,358 INFO L225 Difference]: With dead ends: 367 [2022-07-13 11:45:52,358 INFO L226 Difference]: Without dead ends: 194 [2022-07-13 11:45:52,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:45:52,359 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 10 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-07-13 11:45:52,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 569 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 1 Unknown, 16 Unchecked, 6.7s Time] [2022-07-13 11:45:52,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-07-13 11:45:52,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2022-07-13 11:45:52,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.4974093264248705) internal successors, (289), 193 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:45:52,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 289 transitions. [2022-07-13 11:45:52,364 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 289 transitions. Word has length 75 [2022-07-13 11:45:52,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:45:52,365 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 289 transitions. [2022-07-13 11:45:52,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:45:52,365 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 289 transitions. [2022-07-13 11:45:52,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-13 11:45:52,366 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:45:52,366 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:45:52,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-13 11:45:52,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:45:52,567 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:45:52,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:45:52,568 INFO L85 PathProgramCache]: Analyzing trace with hash 16106716, now seen corresponding path program 1 times [2022-07-13 11:45:52,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:45:52,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [590699217] [2022-07-13 11:45:52,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:45:52,569 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:45:52,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:45:52,570 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:45:52,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-13 11:45:53,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:45:53,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 11:45:53,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:45:53,866 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-13 11:45:53,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 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-13 11:45:53,914 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 11:45:53,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-13 11:45:53,928 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:45:53,929 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:45:53,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:45:53,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [590699217] [2022-07-13 11:45:53,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [590699217] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:45:53,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:45:53,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:45:53,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755844904] [2022-07-13 11:45:53,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:45:53,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:45:53,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:45:53,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:45:53,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:45:53,930 INFO L87 Difference]: Start difference. First operand 194 states and 289 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:45:55,947 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:46:00,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:46:00,514 INFO L93 Difference]: Finished difference Result 369 states and 556 transitions. [2022-07-13 11:46:00,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:46:00,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2022-07-13 11:46:00,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:46:00,517 INFO L225 Difference]: With dead ends: 369 [2022-07-13 11:46:00,517 INFO L226 Difference]: Without dead ends: 196 [2022-07-13 11:46:00,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:46:00,518 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 11 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-07-13 11:46:00,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 561 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 1 Unknown, 18 Unchecked, 6.5s Time] [2022-07-13 11:46:00,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-07-13 11:46:00,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2022-07-13 11:46:00,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.4922279792746114) internal successors, (288), 193 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:46:00,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 288 transitions. [2022-07-13 11:46:00,523 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 288 transitions. Word has length 76 [2022-07-13 11:46:00,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:46:00,523 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 288 transitions. [2022-07-13 11:46:00,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:46:00,523 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 288 transitions. [2022-07-13 11:46:00,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-13 11:46:00,524 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:46:00,524 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:46:00,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-13 11:46:00,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:46:00,725 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:46:00,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:46:00,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1987113572, now seen corresponding path program 1 times [2022-07-13 11:46:00,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:46:00,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [913375604] [2022-07-13 11:46:00,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:46:00,726 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:46:00,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:46:00,727 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:46:00,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-13 11:46:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:46:01,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 11:46:01,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:46:02,135 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-13 11:46:02,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-13 11:46:02,179 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-13 11:46:02,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-13 11:46:02,196 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:46:02,197 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:46:02,197 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:46:02,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [913375604] [2022-07-13 11:46:02,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [913375604] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:46:02,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:46:02,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:46:02,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264245328] [2022-07-13 11:46:02,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:46:02,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:46:02,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:46:02,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:46:02,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:46:02,199 INFO L87 Difference]: Start difference. First operand 194 states and 288 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:46:04,219 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 []