./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl/s3_clnt.blast.03.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_clnt.blast.03.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 1c5ecbc156ef402fa8ca002c27ace1df37fef4394f3f2e7d74e739b1fb38fbd5 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:34:34,687 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:34:34,707 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:34:34,734 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:34:34,735 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:34:34,736 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:34:34,736 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:34:34,737 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:34:34,738 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:34:34,739 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:34:34,740 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:34:34,740 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:34:34,741 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:34:34,741 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:34:34,742 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:34:34,743 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:34:34,743 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:34:34,744 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:34:34,745 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:34:34,746 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:34:34,747 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:34:34,748 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:34:34,748 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:34:34,749 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:34:34,750 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:34:34,752 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:34:34,752 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:34:34,768 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:34:34,769 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:34:34,769 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:34:34,770 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:34:34,770 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:34:34,772 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:34:34,773 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:34:34,773 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:34:34,774 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:34:34,774 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:34:34,774 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:34:34,775 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:34:34,775 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:34:34,776 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:34:34,779 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:34:34,779 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:34:34,805 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:34:34,807 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:34:34,807 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:34:34,808 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:34:34,808 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:34:34,808 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:34:34,809 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:34:34,809 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:34:34,809 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:34:34,810 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:34:34,810 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:34:34,810 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 11:34:34,810 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:34:34,810 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:34:34,811 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:34:34,811 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:34:34,811 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:34:34,811 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:34:34,811 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:34:34,812 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:34:34,812 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:34:34,813 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:34:34,813 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:34:34,813 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:34:34,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:34:34,813 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:34:34,814 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:34:34,814 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:34:34,814 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 11:34:34,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 11:34:34,814 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:34:34,814 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:34:34,815 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:34:34,815 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 -> 1c5ecbc156ef402fa8ca002c27ace1df37fef4394f3f2e7d74e739b1fb38fbd5 [2022-07-13 11:34:35,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:34:35,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:34:35,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:34:35,026 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:34:35,026 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:34:35,027 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_clnt.blast.03.i.cil-1.c [2022-07-13 11:34:35,107 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff2e6b9ce/acc74a11da764b8fac7ff9112b9c82df/FLAGa72f4db22 [2022-07-13 11:34:35,573 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:34:35,573 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_clnt.blast.03.i.cil-1.c [2022-07-13 11:34:35,592 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff2e6b9ce/acc74a11da764b8fac7ff9112b9c82df/FLAGa72f4db22 [2022-07-13 11:34:36,067 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff2e6b9ce/acc74a11da764b8fac7ff9112b9c82df [2022-07-13 11:34:36,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:34:36,072 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:34:36,073 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:34:36,073 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:34:36,076 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:34:36,076 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:34:36" (1/1) ... [2022-07-13 11:34:36,078 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@94d2193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:34:36, skipping insertion in model container [2022-07-13 11:34:36,078 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:34:36" (1/1) ... [2022-07-13 11:34:36,083 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:34:36,116 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:34:36,420 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_clnt.blast.03.i.cil-1.c[65397,65410] [2022-07-13 11:34:36,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:34:36,434 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:34:36,506 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_clnt.blast.03.i.cil-1.c[65397,65410] [2022-07-13 11:34:36,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:34:36,525 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:34:36,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:34:36 WrapperNode [2022-07-13 11:34:36,526 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:34:36,527 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:34:36,527 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:34:36,527 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:34:36,531 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:34:36" (1/1) ... [2022-07-13 11:34:36,563 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:34:36" (1/1) ... [2022-07-13 11:34:36,596 INFO L137 Inliner]: procedures = 31, calls = 217, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 718 [2022-07-13 11:34:36,596 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:34:36,597 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:34:36,597 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:34:36,597 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:34:36,603 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:34:36" (1/1) ... [2022-07-13 11:34:36,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:34:36" (1/1) ... [2022-07-13 11:34:36,609 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:34:36" (1/1) ... [2022-07-13 11:34:36,613 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:34:36" (1/1) ... [2022-07-13 11:34:36,642 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:34:36" (1/1) ... [2022-07-13 11:34:36,649 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:34:36" (1/1) ... [2022-07-13 11:34:36,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:34:36" (1/1) ... [2022-07-13 11:34:36,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:34:36,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:34:36,670 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:34:36,670 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:34:36,671 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:34:36" (1/1) ... [2022-07-13 11:34:36,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:34:36,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:34:36,694 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:34:36,700 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:34:36,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:34:36,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 11:34:36,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 11:34:36,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 11:34:36,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 11:34:36,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 11:34:36,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 11:34:36,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:34:36,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:34:36,863 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:34:36,864 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:34:36,893 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:34:39,458 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-07-13 11:34:39,459 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-07-13 11:34:39,459 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:34:39,464 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:34:39,464 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 11:34:39,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:34:39 BoogieIcfgContainer [2022-07-13 11:34:39,466 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:34:39,467 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:34:39,467 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:34:39,469 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:34:39,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:34:36" (1/3) ... [2022-07-13 11:34:39,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a02d27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:34:39, skipping insertion in model container [2022-07-13 11:34:39,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:34:36" (2/3) ... [2022-07-13 11:34:39,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a02d27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:34:39, skipping insertion in model container [2022-07-13 11:34:39,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:34:39" (3/3) ... [2022-07-13 11:34:39,471 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.03.i.cil-1.c [2022-07-13 11:34:39,480 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:34:39,481 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:34:39,513 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:34:39,517 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@789af1d4, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4dcb7335 [2022-07-13 11:34:39,518 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:34:39,522 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 127 states have (on average 1.7086614173228347) internal successors, (217), 128 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:34:39,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-13 11:34:39,528 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:34:39,528 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] [2022-07-13 11:34:39,528 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:34:39,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:34:39,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2022-07-13 11:34:39,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:34:39,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850857698] [2022-07-13 11:34:39,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:34:39,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:34:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:39,981 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:34:39,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:34:39,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850857698] [2022-07-13 11:34:39,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850857698] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:34:39,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:34:39,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:34:39,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907556987] [2022-07-13 11:34:39,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:34:39,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:34:39,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:34:40,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:34:40,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:34:40,014 INFO L87 Difference]: Start difference. First operand has 129 states, 127 states have (on average 1.7086614173228347) internal successors, (217), 128 states have internal predecessors, (217), 0 states have call successors, (0), 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 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:34:42,033 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:42,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:34:42,260 INFO L93 Difference]: Finished difference Result 255 states and 430 transitions. [2022-07-13 11:34:42,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:34:42,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-07-13 11:34:42,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:34:42,268 INFO L225 Difference]: With dead ends: 255 [2022-07-13 11:34:42,268 INFO L226 Difference]: Without dead ends: 116 [2022-07-13 11:34:42,270 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:34:42,272 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 7 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:34:42,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 530 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 11:34:42,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-13 11:34:42,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2022-07-13 11:34:42,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.5087719298245614) internal successors, (172), 114 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:34:42,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2022-07-13 11:34:42,317 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 24 [2022-07-13 11:34:42,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:34:42,317 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2022-07-13 11:34:42,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:34:42,318 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2022-07-13 11:34:42,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-13 11:34:42,319 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:34:42,319 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] [2022-07-13 11:34:42,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 11:34:42,320 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:34:42,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:34:42,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1001988123, now seen corresponding path program 1 times [2022-07-13 11:34:42,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:34:42,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868790815] [2022-07-13 11:34:42,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:34:42,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:34:42,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:42,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 11:34:42,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:34:42,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868790815] [2022-07-13 11:34:42,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868790815] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:34:42,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:34:42,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:34:42,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798522861] [2022-07-13 11:34:42,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:34:42,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:34:42,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:34:42,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:34:42,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:34:42,540 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:34:42,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:34:42,608 INFO L93 Difference]: Finished difference Result 321 states and 484 transitions. [2022-07-13 11:34:42,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:34:42,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-13 11:34:42,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:34:42,611 INFO L225 Difference]: With dead ends: 321 [2022-07-13 11:34:42,611 INFO L226 Difference]: Without dead ends: 216 [2022-07-13 11:34:42,612 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:34:42,612 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 124 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:34:42,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 310 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:34:42,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-13 11:34:42,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2022-07-13 11:34:42,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.4883720930232558) internal successors, (320), 215 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:34:42,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 320 transitions. [2022-07-13 11:34:42,629 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 320 transitions. Word has length 38 [2022-07-13 11:34:42,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:34:42,629 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 320 transitions. [2022-07-13 11:34:42,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:34:42,630 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 320 transitions. [2022-07-13 11:34:42,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-13 11:34:42,631 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:34:42,631 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 11:34:42,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 11:34:42,632 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:34:42,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:34:42,632 INFO L85 PathProgramCache]: Analyzing trace with hash -596933037, now seen corresponding path program 1 times [2022-07-13 11:34:42,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:34:42,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591317167] [2022-07-13 11:34:42,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:34:42,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:34:42,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:42,828 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 11:34:42,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:34:42,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591317167] [2022-07-13 11:34:42,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591317167] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:34:42,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:34:42,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:34:42,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220493523] [2022-07-13 11:34:42,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:34:42,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:34:42,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:34:42,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:34:42,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:34:42,832 INFO L87 Difference]: Start difference. First operand 216 states and 320 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:34:44,851 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:44,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:34:44,894 INFO L93 Difference]: Finished difference Result 420 states and 629 transitions. [2022-07-13 11:34:44,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:34:44,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-07-13 11:34:44,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:34:44,898 INFO L225 Difference]: With dead ends: 420 [2022-07-13 11:34:44,898 INFO L226 Difference]: Without dead ends: 315 [2022-07-13 11:34:44,898 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:34:44,899 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 123 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:34:44,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 461 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-13 11:34:44,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-07-13 11:34:44,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2022-07-13 11:34:44,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 314 states have (on average 1.484076433121019) internal successors, (466), 314 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:34:44,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 466 transitions. [2022-07-13 11:34:44,915 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 466 transitions. Word has length 53 [2022-07-13 11:34:44,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:34:44,915 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 466 transitions. [2022-07-13 11:34:44,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:34:44,916 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 466 transitions. [2022-07-13 11:34:44,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-13 11:34:44,917 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:34:44,918 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 11:34:44,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 11:34:44,918 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:34:44,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:34:44,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1173568974, now seen corresponding path program 1 times [2022-07-13 11:34:44,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:34:44,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855459391] [2022-07-13 11:34:44,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:34:44,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:34:45,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:45,112 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-13 11:34:45,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:34:45,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855459391] [2022-07-13 11:34:45,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855459391] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:34:45,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:34:45,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:34:45,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744422047] [2022-07-13 11:34:45,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:34:45,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:34:45,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:34:45,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:34:45,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:34:45,117 INFO L87 Difference]: Start difference. First operand 315 states and 466 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:34:47,127 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:34:47,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:34:47,441 INFO L93 Difference]: Finished difference Result 891 states and 1325 transitions. [2022-07-13 11:34:47,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:34:47,442 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 71 [2022-07-13 11:34:47,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:34:47,445 INFO L225 Difference]: With dead ends: 891 [2022-07-13 11:34:47,445 INFO L226 Difference]: Without dead ends: 586 [2022-07-13 11:34:47,447 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:34:47,448 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 107 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:34:47,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 265 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 210 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-13 11:34:47,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2022-07-13 11:34:47,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 387. [2022-07-13 11:34:47,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 386 states have (on average 1.5336787564766838) internal successors, (592), 386 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:34:47,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 592 transitions. [2022-07-13 11:34:47,467 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 592 transitions. Word has length 71 [2022-07-13 11:34:47,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:34:47,467 INFO L495 AbstractCegarLoop]: Abstraction has 387 states and 592 transitions. [2022-07-13 11:34:47,467 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:34:47,467 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 592 transitions. [2022-07-13 11:34:47,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-13 11:34:47,470 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:34:47,470 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 11:34:47,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 11:34:47,470 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:34:47,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:34:47,471 INFO L85 PathProgramCache]: Analyzing trace with hash -2025585655, now seen corresponding path program 1 times [2022-07-13 11:34:47,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:34:47,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631057710] [2022-07-13 11:34:47,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:34:47,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:34:47,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:47,635 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-13 11:34:47,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:34:47,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631057710] [2022-07-13 11:34:47,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631057710] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:34:47,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:34:47,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:34:47,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850391337] [2022-07-13 11:34:47,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:34:47,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:34:47,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:34:47,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:34:47,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:34:47,638 INFO L87 Difference]: Start difference. First operand 387 states and 592 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:34:49,651 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:51,664 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:52,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:34:52,030 INFO L93 Difference]: Finished difference Result 942 states and 1439 transitions. [2022-07-13 11:34:52,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:34:52,031 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 72 [2022-07-13 11:34:52,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:34:52,034 INFO L225 Difference]: With dead ends: 942 [2022-07-13 11:34:52,034 INFO L226 Difference]: Without dead ends: 565 [2022-07-13 11:34:52,035 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:34:52,036 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 91 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:34:52,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 550 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 234 Invalid, 2 Unknown, 0 Unchecked, 4.4s Time] [2022-07-13 11:34:52,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2022-07-13 11:34:52,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 439. [2022-07-13 11:34:52,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 438 states have (on average 1.552511415525114) internal successors, (680), 438 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:34:52,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 680 transitions. [2022-07-13 11:34:52,050 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 680 transitions. Word has length 72 [2022-07-13 11:34:52,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:34:52,051 INFO L495 AbstractCegarLoop]: Abstraction has 439 states and 680 transitions. [2022-07-13 11:34:52,051 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:34:52,051 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 680 transitions. [2022-07-13 11:34:52,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-13 11:34:52,054 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:34:52,054 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 11:34:52,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 11:34:52,055 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:34:52,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:34:52,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1885037045, now seen corresponding path program 1 times [2022-07-13 11:34:52,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:34:52,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350104698] [2022-07-13 11:34:52,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:34:52,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:34:52,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:52,210 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-13 11:34:52,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:34:52,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350104698] [2022-07-13 11:34:52,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350104698] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:34:52,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:34:52,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:34:52,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604318893] [2022-07-13 11:34:52,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:34:52,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:34:52,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:34:52,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:34:52,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:34:52,212 INFO L87 Difference]: Start difference. First operand 439 states and 680 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:34:54,221 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:54,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:34:54,488 INFO L93 Difference]: Finished difference Result 1139 states and 1753 transitions. [2022-07-13 11:34:54,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:34:54,488 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 72 [2022-07-13 11:34:54,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:34:54,493 INFO L225 Difference]: With dead ends: 1139 [2022-07-13 11:34:54,493 INFO L226 Difference]: Without dead ends: 710 [2022-07-13 11:34:54,494 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:34:54,496 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 107 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:34:54,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 264 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 11:34:54,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2022-07-13 11:34:54,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 462. [2022-07-13 11:34:54,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 461 states have (on average 1.5704989154013016) internal successors, (724), 461 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:34:54,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 724 transitions. [2022-07-13 11:34:54,507 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 724 transitions. Word has length 72 [2022-07-13 11:34:54,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:34:54,508 INFO L495 AbstractCegarLoop]: Abstraction has 462 states and 724 transitions. [2022-07-13 11:34:54,508 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:34:54,508 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 724 transitions. [2022-07-13 11:34:54,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-13 11:34:54,510 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:34:54,510 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:34:54,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 11:34:54,510 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:34:54,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:34:54,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1523957901, now seen corresponding path program 1 times [2022-07-13 11:34:54,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:34:54,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955842423] [2022-07-13 11:34:54,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:34:54,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:34:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:54,673 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-13 11:34:54,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:34:54,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955842423] [2022-07-13 11:34:54,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955842423] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:34:54,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:34:54,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:34:54,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208477697] [2022-07-13 11:34:54,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:34:54,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:34:54,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:34:54,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:34:54,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:34:54,680 INFO L87 Difference]: Start difference. First operand 462 states and 724 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:34:56,697 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:58,709 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:58,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:34:58,979 INFO L93 Difference]: Finished difference Result 1092 states and 1701 transitions. [2022-07-13 11:34:58,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:34:58,980 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 92 [2022-07-13 11:34:58,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:34:58,982 INFO L225 Difference]: With dead ends: 1092 [2022-07-13 11:34:58,982 INFO L226 Difference]: Without dead ends: 640 [2022-07-13 11:34:58,982 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:34:58,983 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 93 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:34:58,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 550 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 234 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-07-13 11:34:58,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2022-07-13 11:34:58,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 508. [2022-07-13 11:34:58,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 507 states have (on average 1.581854043392505) internal successors, (802), 507 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:34:58,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 802 transitions. [2022-07-13 11:34:58,993 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 802 transitions. Word has length 92 [2022-07-13 11:34:58,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:34:58,993 INFO L495 AbstractCegarLoop]: Abstraction has 508 states and 802 transitions. [2022-07-13 11:34:58,993 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:34:58,994 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 802 transitions. [2022-07-13 11:34:58,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-13 11:34:58,997 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:34:58,997 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:34:58,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 11:34:58,997 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:34:58,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:34:58,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1877523057, now seen corresponding path program 1 times [2022-07-13 11:34:58,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:34:58,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414919810] [2022-07-13 11:34:58,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:34:58,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:34:59,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:59,170 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-13 11:34:59,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:34:59,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414919810] [2022-07-13 11:34:59,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414919810] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:34:59,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:34:59,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:34:59,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528564909] [2022-07-13 11:34:59,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:34:59,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:34:59,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:34:59,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:34:59,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:34:59,174 INFO L87 Difference]: Start difference. First operand 508 states and 802 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:35:01,181 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:35:03,198 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:35:03,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:35:03,418 INFO L93 Difference]: Finished difference Result 1092 states and 1718 transitions. [2022-07-13 11:35:03,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:35:03,418 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 92 [2022-07-13 11:35:03,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:35:03,420 INFO L225 Difference]: With dead ends: 1092 [2022-07-13 11:35:03,420 INFO L226 Difference]: Without dead ends: 594 [2022-07-13 11:35:03,421 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:35:03,421 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 40 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:35:03,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 494 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 146 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-13 11:35:03,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2022-07-13 11:35:03,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 548. [2022-07-13 11:35:03,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 1.5904936014625228) internal successors, (870), 547 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:35:03,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 870 transitions. [2022-07-13 11:35:03,431 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 870 transitions. Word has length 92 [2022-07-13 11:35:03,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:35:03,431 INFO L495 AbstractCegarLoop]: Abstraction has 548 states and 870 transitions. [2022-07-13 11:35:03,431 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:35:03,432 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 870 transitions. [2022-07-13 11:35:03,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-13 11:35:03,434 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:35:03,434 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:35:03,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 11:35:03,434 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:35:03,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:35:03,435 INFO L85 PathProgramCache]: Analyzing trace with hash 377535094, now seen corresponding path program 1 times [2022-07-13 11:35:03,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:35:03,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103770416] [2022-07-13 11:35:03,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:35:03,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:35:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:35:03,585 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-13 11:35:03,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:35:03,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103770416] [2022-07-13 11:35:03,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103770416] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:35:03,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:35:03,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:35:03,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355288679] [2022-07-13 11:35:03,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:35:03,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:35:03,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:35:03,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:35:03,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:35:03,589 INFO L87 Difference]: Start difference. First operand 548 states and 870 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:35:05,597 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:35:05,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:35:05,871 INFO L93 Difference]: Finished difference Result 1282 states and 1998 transitions. [2022-07-13 11:35:05,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:35:05,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2022-07-13 11:35:05,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:35:05,874 INFO L225 Difference]: With dead ends: 1282 [2022-07-13 11:35:05,874 INFO L226 Difference]: Without dead ends: 744 [2022-07-13 11:35:05,875 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:35:05,876 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 108 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:35:05,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 264 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-13 11:35:05,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2022-07-13 11:35:05,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 548. [2022-07-13 11:35:05,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 1.5795246800731262) internal successors, (864), 547 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:35:05,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 864 transitions. [2022-07-13 11:35:05,890 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 864 transitions. Word has length 93 [2022-07-13 11:35:05,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:35:05,891 INFO L495 AbstractCegarLoop]: Abstraction has 548 states and 864 transitions. [2022-07-13 11:35:05,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:35:05,891 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 864 transitions. [2022-07-13 11:35:05,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-13 11:35:05,892 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:35:05,892 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:35:05,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 11:35:05,893 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:35:05,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:35:05,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1171686517, now seen corresponding path program 2 times [2022-07-13 11:35:05,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:35:05,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865622720] [2022-07-13 11:35:05,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:35:05,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:35:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:35:06,061 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-13 11:35:06,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:35:06,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865622720] [2022-07-13 11:35:06,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865622720] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:35:06,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:35:06,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:35:06,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405286719] [2022-07-13 11:35:06,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:35:06,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:35:06,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:35:06,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:35:06,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:35:06,064 INFO L87 Difference]: Start difference. First operand 548 states and 864 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:35:08,071 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:35:10,087 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:35:10,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:35:10,348 INFO L93 Difference]: Finished difference Result 1279 states and 1983 transitions. [2022-07-13 11:35:10,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:35:10,349 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 106 [2022-07-13 11:35:10,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:35:10,351 INFO L225 Difference]: With dead ends: 1279 [2022-07-13 11:35:10,351 INFO L226 Difference]: Without dead ends: 741 [2022-07-13 11:35:10,351 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:35:10,352 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 111 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 40 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:35:10,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 282 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 203 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-07-13 11:35:10,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2022-07-13 11:35:10,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 548. [2022-07-13 11:35:10,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 1.5612431444241317) internal successors, (854), 547 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:35:10,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 854 transitions. [2022-07-13 11:35:10,364 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 854 transitions. Word has length 106 [2022-07-13 11:35:10,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:35:10,364 INFO L495 AbstractCegarLoop]: Abstraction has 548 states and 854 transitions. [2022-07-13 11:35:10,364 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:35:10,364 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 854 transitions. [2022-07-13 11:35:10,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-13 11:35:10,365 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:35:10,366 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 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] [2022-07-13 11:35:10,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 11:35:10,366 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:35:10,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:35:10,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1788158099, now seen corresponding path program 1 times [2022-07-13 11:35:10,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:35:10,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967455657] [2022-07-13 11:35:10,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:35:10,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:35:10,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:35:10,527 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-13 11:35:10,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:35:10,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967455657] [2022-07-13 11:35:10,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967455657] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:35:10,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:35:10,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:35:10,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602408220] [2022-07-13 11:35:10,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:35:10,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:35:10,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:35:10,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:35:10,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:35:10,531 INFO L87 Difference]: Start difference. First operand 548 states and 854 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:35:12,538 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:35:14,559 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:35:14,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:35:14,819 INFO L93 Difference]: Finished difference Result 1210 states and 1870 transitions. [2022-07-13 11:35:14,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:35:14,820 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 106 [2022-07-13 11:35:14,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:35:14,822 INFO L225 Difference]: With dead ends: 1210 [2022-07-13 11:35:14,822 INFO L226 Difference]: Without dead ends: 672 [2022-07-13 11:35:14,823 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:35:14,823 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 97 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:35:14,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 538 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 228 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-07-13 11:35:14,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2022-07-13 11:35:14,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 548. [2022-07-13 11:35:14,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 1.5575868372943327) internal successors, (852), 547 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:35:14,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 852 transitions. [2022-07-13 11:35:14,833 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 852 transitions. Word has length 106 [2022-07-13 11:35:14,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:35:14,834 INFO L495 AbstractCegarLoop]: Abstraction has 548 states and 852 transitions. [2022-07-13 11:35:14,834 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:35:14,834 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 852 transitions. [2022-07-13 11:35:14,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-13 11:35:14,835 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:35:14,835 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 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] [2022-07-13 11:35:14,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 11:35:14,836 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:35:14,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:35:14,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1946109419, now seen corresponding path program 1 times [2022-07-13 11:35:14,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:35:14,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510139378] [2022-07-13 11:35:14,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:35:14,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:35:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:35:15,069 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-13 11:35:15,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:35:15,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510139378] [2022-07-13 11:35:15,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510139378] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:35:15,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:35:15,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:35:15,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353790308] [2022-07-13 11:35:15,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:35:15,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:35:15,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:35:15,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:35:15,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:35:15,071 INFO L87 Difference]: Start difference. First operand 548 states and 852 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:35:17,078 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:35:19,096 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:35:19,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:35:19,281 INFO L93 Difference]: Finished difference Result 1130 states and 1746 transitions. [2022-07-13 11:35:19,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:35:19,285 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 106 [2022-07-13 11:35:19,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:35:19,287 INFO L225 Difference]: With dead ends: 1130 [2022-07-13 11:35:19,287 INFO L226 Difference]: Without dead ends: 592 [2022-07-13 11:35:19,287 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:35:19,288 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 46 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:35:19,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 492 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-13 11:35:19,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2022-07-13 11:35:19,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 548. [2022-07-13 11:35:19,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 1.5539305301645339) internal successors, (850), 547 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:35:19,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 850 transitions. [2022-07-13 11:35:19,298 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 850 transitions. Word has length 106 [2022-07-13 11:35:19,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:35:19,298 INFO L495 AbstractCegarLoop]: Abstraction has 548 states and 850 transitions. [2022-07-13 11:35:19,298 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:35:19,298 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 850 transitions. [2022-07-13 11:35:19,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-13 11:35:19,299 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:35:19,299 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 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] [2022-07-13 11:35:19,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 11:35:19,300 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:35:19,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:35:19,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1275446372, now seen corresponding path program 1 times [2022-07-13 11:35:19,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:35:19,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495707981] [2022-07-13 11:35:19,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:35:19,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:35:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:35:19,474 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-13 11:35:19,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:35:19,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495707981] [2022-07-13 11:35:19,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495707981] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:35:19,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:35:19,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:35:19,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102069894] [2022-07-13 11:35:19,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:35:19,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:35:19,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:35:19,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:35:19,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:35:19,478 INFO L87 Difference]: Start difference. First operand 548 states and 850 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:35:21,487 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:35:21,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:35:21,754 INFO L93 Difference]: Finished difference Result 1280 states and 1956 transitions. [2022-07-13 11:35:21,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:35:21,755 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 107 [2022-07-13 11:35:21,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:35:21,757 INFO L225 Difference]: With dead ends: 1280 [2022-07-13 11:35:21,757 INFO L226 Difference]: Without dead ends: 742 [2022-07-13 11:35:21,759 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:35:21,760 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 117 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 40 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:35:21,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 286 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 210 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 11:35:21,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2022-07-13 11:35:21,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 548. [2022-07-13 11:35:21,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 1.5356489945155394) internal successors, (840), 547 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:35:21,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 840 transitions. [2022-07-13 11:35:21,814 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 840 transitions. Word has length 107 [2022-07-13 11:35:21,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:35:21,814 INFO L495 AbstractCegarLoop]: Abstraction has 548 states and 840 transitions. [2022-07-13 11:35:21,814 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:35:21,815 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 840 transitions. [2022-07-13 11:35:21,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-13 11:35:21,816 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:35:21,816 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2022-07-13 11:35:21,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 11:35:21,816 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:35:21,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:35:21,817 INFO L85 PathProgramCache]: Analyzing trace with hash 889473249, now seen corresponding path program 1 times [2022-07-13 11:35:21,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:35:21,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298923130] [2022-07-13 11:35:21,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:35:21,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:35:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:35:21,955 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-13 11:35:21,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:35:21,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298923130] [2022-07-13 11:35:21,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298923130] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:35:21,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:35:21,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:35:21,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661194009] [2022-07-13 11:35:21,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:35:21,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:35:21,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:35:21,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:35:21,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:35:21,957 INFO L87 Difference]: Start difference. First operand 548 states and 840 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:35:23,964 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:35:24,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:35:24,204 INFO L93 Difference]: Finished difference Result 1164 states and 1763 transitions. [2022-07-13 11:35:24,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:35:24,205 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 107 [2022-07-13 11:35:24,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:35:24,207 INFO L225 Difference]: With dead ends: 1164 [2022-07-13 11:35:24,207 INFO L226 Difference]: Without dead ends: 817 [2022-07-13 11:35:24,208 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:35:24,208 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 113 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 29 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:35:24,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 492 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 214 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 11:35:24,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2022-07-13 11:35:24,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 596. [2022-07-13 11:35:24,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 595 states have (on average 1.5210084033613445) internal successors, (905), 595 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:35:24,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 905 transitions. [2022-07-13 11:35:24,220 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 905 transitions. Word has length 107 [2022-07-13 11:35:24,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:35:24,221 INFO L495 AbstractCegarLoop]: Abstraction has 596 states and 905 transitions. [2022-07-13 11:35:24,221 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:35:24,221 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 905 transitions. [2022-07-13 11:35:24,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-13 11:35:24,222 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:35:24,222 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:35:24,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 11:35:24,223 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:35:24,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:35:24,223 INFO L85 PathProgramCache]: Analyzing trace with hash -2005302672, now seen corresponding path program 1 times [2022-07-13 11:35:24,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:35:24,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659907444] [2022-07-13 11:35:24,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:35:24,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:35:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:35:24,398 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-13 11:35:24,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:35:24,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659907444] [2022-07-13 11:35:24,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659907444] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:35:24,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:35:24,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:35:24,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478918196] [2022-07-13 11:35:24,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:35:24,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:35:24,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:35:24,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:35:24,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:35:24,400 INFO L87 Difference]: Start difference. First operand 596 states and 905 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:35:26,408 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:35:26,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:35:26,671 INFO L93 Difference]: Finished difference Result 1457 states and 2189 transitions. [2022-07-13 11:35:26,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:35:26,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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 107 [2022-07-13 11:35:26,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:35:26,674 INFO L225 Difference]: With dead ends: 1457 [2022-07-13 11:35:26,674 INFO L226 Difference]: Without dead ends: 871 [2022-07-13 11:35:26,674 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:35:26,675 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 93 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 37 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:35:26,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 266 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 214 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 11:35:26,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2022-07-13 11:35:26,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 710. [2022-07-13 11:35:26,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 709 states have (on average 1.538787023977433) internal successors, (1091), 709 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:35:26,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 1091 transitions. [2022-07-13 11:35:26,703 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 1091 transitions. Word has length 107 [2022-07-13 11:35:26,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:35:26,704 INFO L495 AbstractCegarLoop]: Abstraction has 710 states and 1091 transitions. [2022-07-13 11:35:26,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:35:26,704 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 1091 transitions. [2022-07-13 11:35:26,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-13 11:35:26,705 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:35:26,705 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2022-07-13 11:35:26,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 11:35:26,706 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:35:26,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:35:26,706 INFO L85 PathProgramCache]: Analyzing trace with hash -386918792, now seen corresponding path program 1 times [2022-07-13 11:35:26,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:35:26,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815071769] [2022-07-13 11:35:26,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:35:26,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:35:26,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:35:26,839 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-13 11:35:26,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:35:26,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815071769] [2022-07-13 11:35:26,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815071769] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:35:26,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:35:26,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:35:26,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294809155] [2022-07-13 11:35:26,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:35:26,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:35:26,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:35:26,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:35:26,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:35:26,842 INFO L87 Difference]: Start difference. First operand 710 states and 1091 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:35:28,856 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:35:30,871 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:35:31,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:35:31,148 INFO L93 Difference]: Finished difference Result 1534 states and 2342 transitions. [2022-07-13 11:35:31,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:35:31,149 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 108 [2022-07-13 11:35:31,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:35:31,151 INFO L225 Difference]: With dead ends: 1534 [2022-07-13 11:35:31,151 INFO L226 Difference]: Without dead ends: 834 [2022-07-13 11:35:31,152 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:35:31,152 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 91 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:35:31,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 530 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 228 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-07-13 11:35:31,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2022-07-13 11:35:31,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 710. [2022-07-13 11:35:31,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 709 states have (on average 1.535966149506347) internal successors, (1089), 709 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:35:31,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 1089 transitions. [2022-07-13 11:35:31,164 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 1089 transitions. Word has length 108 [2022-07-13 11:35:31,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:35:31,164 INFO L495 AbstractCegarLoop]: Abstraction has 710 states and 1089 transitions. [2022-07-13 11:35:31,165 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:35:31,165 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 1089 transitions. [2022-07-13 11:35:31,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-13 11:35:31,166 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:35:31,166 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:35:31,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 11:35:31,166 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:35:31,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:35:31,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1089441208, now seen corresponding path program 1 times [2022-07-13 11:35:31,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:35:31,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512227980] [2022-07-13 11:35:31,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:35:31,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:35:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:35:31,299 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-13 11:35:31,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:35:31,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512227980] [2022-07-13 11:35:31,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512227980] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:35:31,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:35:31,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:35:31,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078044534] [2022-07-13 11:35:31,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:35:31,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:35:31,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:35:31,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:35:31,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:35:31,301 INFO L87 Difference]: Start difference. First operand 710 states and 1089 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:35:33,308 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:35:35,327 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:35:35,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:35:35,578 INFO L93 Difference]: Finished difference Result 1283 states and 1956 transitions. [2022-07-13 11:35:35,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:35:35,579 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 108 [2022-07-13 11:35:35,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:35:35,581 INFO L225 Difference]: With dead ends: 1283 [2022-07-13 11:35:35,581 INFO L226 Difference]: Without dead ends: 828 [2022-07-13 11:35:35,582 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:35:35,582 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 85 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:35:35,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 524 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 223 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-07-13 11:35:35,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2022-07-13 11:35:35,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 710. [2022-07-13 11:35:35,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 709 states have (on average 1.533145275035261) internal successors, (1087), 709 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:35:35,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 1087 transitions. [2022-07-13 11:35:35,595 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 1087 transitions. Word has length 108 [2022-07-13 11:35:35,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:35:35,595 INFO L495 AbstractCegarLoop]: Abstraction has 710 states and 1087 transitions. [2022-07-13 11:35:35,596 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:35:35,596 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 1087 transitions. [2022-07-13 11:35:35,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-13 11:35:35,597 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:35:35,597 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:35:35,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 11:35:35,597 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:35:35,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:35:35,598 INFO L85 PathProgramCache]: Analyzing trace with hash 546201863, now seen corresponding path program 1 times [2022-07-13 11:35:35,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:35:35,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557315221] [2022-07-13 11:35:35,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:35:35,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:35:35,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:35:35,741 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-13 11:35:35,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:35:35,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557315221] [2022-07-13 11:35:35,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557315221] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:35:35,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:35:35,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:35:35,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388691006] [2022-07-13 11:35:35,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:35:35,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:35:35,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:35:35,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:35:35,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:35:35,743 INFO L87 Difference]: Start difference. First operand 710 states and 1087 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 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:35:37,750 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:35:37,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:35:37,985 INFO L93 Difference]: Finished difference Result 1604 states and 2430 transitions. [2022-07-13 11:35:37,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:35:37,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 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 108 [2022-07-13 11:35:37,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:35:37,989 INFO L225 Difference]: With dead ends: 1604 [2022-07-13 11:35:37,989 INFO L226 Difference]: Without dead ends: 904 [2022-07-13 11:35:37,990 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:35:37,990 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 92 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:35:37,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 268 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 11:35:37,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2022-07-13 11:35:38,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 746. [2022-07-13 11:35:38,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 745 states have (on average 1.5516778523489934) internal successors, (1156), 745 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:35:38,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1156 transitions. [2022-07-13 11:35:38,013 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1156 transitions. Word has length 108 [2022-07-13 11:35:38,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:35:38,013 INFO L495 AbstractCegarLoop]: Abstraction has 746 states and 1156 transitions. [2022-07-13 11:35:38,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 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:35:38,013 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1156 transitions. [2022-07-13 11:35:38,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-13 11:35:38,014 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:35:38,015 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:35:38,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-13 11:35:38,015 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:35:38,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:35:38,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1432649300, now seen corresponding path program 1 times [2022-07-13 11:35:38,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:35:38,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877751884] [2022-07-13 11:35:38,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:35:38,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:35:38,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:35:38,152 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-13 11:35:38,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:35:38,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877751884] [2022-07-13 11:35:38,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877751884] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:35:38,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:35:38,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:35:38,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386927314] [2022-07-13 11:35:38,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:35:38,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:35:38,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:35:38,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:35:38,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:35:38,155 INFO L87 Difference]: Start difference. First operand 746 states and 1156 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 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:35:40,162 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:35:42,183 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:35:42,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:35:42,470 INFO L93 Difference]: Finished difference Result 1596 states and 2459 transitions. [2022-07-13 11:35:42,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:35:42,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 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 108 [2022-07-13 11:35:42,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:35:42,473 INFO L225 Difference]: With dead ends: 1596 [2022-07-13 11:35:42,473 INFO L226 Difference]: Without dead ends: 860 [2022-07-13 11:35:42,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:35:42,475 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 61 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:35:42,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 518 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 220 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-07-13 11:35:42,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2022-07-13 11:35:42,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 778. [2022-07-13 11:35:42,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 777 states have (on average 1.5546975546975548) internal successors, (1208), 777 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:35:42,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1208 transitions. [2022-07-13 11:35:42,493 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1208 transitions. Word has length 108 [2022-07-13 11:35:42,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:35:42,493 INFO L495 AbstractCegarLoop]: Abstraction has 778 states and 1208 transitions. [2022-07-13 11:35:42,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 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:35:42,493 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1208 transitions. [2022-07-13 11:35:42,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-13 11:35:42,494 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:35:42,495 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2022-07-13 11:35:42,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 11:35:42,495 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:35:42,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:35:42,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1574655866, now seen corresponding path program 1 times [2022-07-13 11:35:42,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:35:42,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107550641] [2022-07-13 11:35:42,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:35:42,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:35:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:35:42,746 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-13 11:35:42,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:35:42,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107550641] [2022-07-13 11:35:42,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107550641] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:35:42,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:35:42,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:35:42,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074763740] [2022-07-13 11:35:42,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:35:42,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:35:42,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:35:42,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:35:42,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:35:42,749 INFO L87 Difference]: Start difference. First operand 778 states and 1208 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:35:44,767 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:35:45,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:35:45,014 INFO L93 Difference]: Finished difference Result 1704 states and 2600 transitions. [2022-07-13 11:35:45,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:35:45,014 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 108 [2022-07-13 11:35:45,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:35:45,017 INFO L225 Difference]: With dead ends: 1704 [2022-07-13 11:35:45,017 INFO L226 Difference]: Without dead ends: 936 [2022-07-13 11:35:45,018 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:35:45,018 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 114 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:35:45,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 264 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 11:35:45,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2022-07-13 11:35:45,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 778. [2022-07-13 11:35:45,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 777 states have (on average 1.5366795366795367) internal successors, (1194), 777 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:35:45,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1194 transitions. [2022-07-13 11:35:45,051 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1194 transitions. Word has length 108 [2022-07-13 11:35:45,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:35:45,051 INFO L495 AbstractCegarLoop]: Abstraction has 778 states and 1194 transitions. [2022-07-13 11:35:45,051 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:35:45,051 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1194 transitions. [2022-07-13 11:35:45,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-13 11:35:45,052 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:35:45,053 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:35:45,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-13 11:35:45,053 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:35:45,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:35:45,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1243951430, now seen corresponding path program 1 times [2022-07-13 11:35:45,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:35:45,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087206338] [2022-07-13 11:35:45,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:35:45,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:35:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:35:45,204 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-13 11:35:45,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:35:45,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087206338] [2022-07-13 11:35:45,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087206338] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:35:45,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:35:45,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:35:45,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266421119] [2022-07-13 11:35:45,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:35:45,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:35:45,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:35:45,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:35:45,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:35:45,207 INFO L87 Difference]: Start difference. First operand 778 states and 1194 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:35:47,215 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:35:47,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:35:47,455 INFO L93 Difference]: Finished difference Result 1486 states and 2256 transitions. [2022-07-13 11:35:47,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:35:47,455 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 108 [2022-07-13 11:35:47,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:35:47,458 INFO L225 Difference]: With dead ends: 1486 [2022-07-13 11:35:47,458 INFO L226 Difference]: Without dead ends: 991 [2022-07-13 11:35:47,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:35:47,459 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 107 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 28 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:35:47,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 474 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 11:35:47,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2022-07-13 11:35:47,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 781. [2022-07-13 11:35:47,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 780 states have (on average 1.5243589743589743) internal successors, (1189), 780 states have internal predecessors, (1189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:35:47,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1189 transitions. [2022-07-13 11:35:47,474 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1189 transitions. Word has length 108 [2022-07-13 11:35:47,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:35:47,474 INFO L495 AbstractCegarLoop]: Abstraction has 781 states and 1189 transitions. [2022-07-13 11:35:47,474 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:35:47,474 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1189 transitions. [2022-07-13 11:35:47,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-13 11:35:47,476 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:35:47,476 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 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] [2022-07-13 11:35:47,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-13 11:35:47,476 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:35:47,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:35:47,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1536349215, now seen corresponding path program 1 times [2022-07-13 11:35:47,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:35:47,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051939543] [2022-07-13 11:35:47,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:35:47,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:35:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:35:47,605 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-13 11:35:47,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:35:47,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051939543] [2022-07-13 11:35:47,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051939543] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:35:47,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:35:47,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:35:47,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254738975] [2022-07-13 11:35:47,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:35:47,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:35:47,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:35:47,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:35:47,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:35:47,607 INFO L87 Difference]: Start difference. First operand 781 states and 1189 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:35:49,614 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:35:49,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:35:49,900 INFO L93 Difference]: Finished difference Result 1710 states and 2562 transitions. [2022-07-13 11:35:49,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:35:49,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2022-07-13 11:35:49,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:35:49,902 INFO L225 Difference]: With dead ends: 1710 [2022-07-13 11:35:49,902 INFO L226 Difference]: Without dead ends: 939 [2022-07-13 11:35:49,903 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:35:49,904 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 112 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:35:49,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 268 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-13 11:35:49,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2022-07-13 11:35:49,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 781. [2022-07-13 11:35:49,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 780 states have (on average 1.5038461538461538) internal successors, (1173), 780 states have internal predecessors, (1173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:35:49,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1173 transitions. [2022-07-13 11:35:49,921 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1173 transitions. Word has length 109 [2022-07-13 11:35:49,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:35:49,921 INFO L495 AbstractCegarLoop]: Abstraction has 781 states and 1173 transitions. [2022-07-13 11:35:49,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:35:49,921 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1173 transitions. [2022-07-13 11:35:49,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-13 11:35:49,923 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:35:49,923 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:35:49,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-13 11:35:49,923 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:35:49,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:35:49,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1835668675, now seen corresponding path program 1 times [2022-07-13 11:35:49,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:35:49,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463764149] [2022-07-13 11:35:49,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:35:49,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:35:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:35:50,085 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-13 11:35:50,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:35:50,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463764149] [2022-07-13 11:35:50,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463764149] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:35:50,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:35:50,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:35:50,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615159799] [2022-07-13 11:35:50,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:35:50,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:35:50,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:35:50,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:35:50,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:35:50,089 INFO L87 Difference]: Start difference. First operand 781 states and 1173 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:35:52,097 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:35:52,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:35:52,342 INFO L93 Difference]: Finished difference Result 1710 states and 2530 transitions. [2022-07-13 11:35:52,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:35:52,343 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 109 [2022-07-13 11:35:52,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:35:52,345 INFO L225 Difference]: With dead ends: 1710 [2022-07-13 11:35:52,345 INFO L226 Difference]: Without dead ends: 939 [2022-07-13 11:35:52,346 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:35:52,346 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 87 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:35:52,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 264 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 11:35:52,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2022-07-13 11:35:52,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 787. [2022-07-13 11:35:52,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 1.5038167938931297) internal successors, (1182), 786 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:35:52,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1182 transitions. [2022-07-13 11:35:52,395 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1182 transitions. Word has length 109 [2022-07-13 11:35:52,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:35:52,395 INFO L495 AbstractCegarLoop]: Abstraction has 787 states and 1182 transitions. [2022-07-13 11:35:52,395 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:35:52,395 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1182 transitions. [2022-07-13 11:35:52,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-13 11:35:52,401 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:35:52,402 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:35:52,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-13 11:35:52,402 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:35:52,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:35:52,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1487102300, now seen corresponding path program 1 times [2022-07-13 11:35:52,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:35:52,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931125847] [2022-07-13 11:35:52,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:35:52,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:35:52,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:35:52,546 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-13 11:35:52,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:35:52,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931125847] [2022-07-13 11:35:52,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931125847] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:35:52,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:35:52,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:35:52,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137396453] [2022-07-13 11:35:52,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:35:52,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:35:52,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:35:52,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:35:52,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:35:52,548 INFO L87 Difference]: Start difference. First operand 787 states and 1182 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:35:54,554 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:35:54,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:35:54,780 INFO L93 Difference]: Finished difference Result 1716 states and 2536 transitions. [2022-07-13 11:35:54,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:35:54,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 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 110 [2022-07-13 11:35:54,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:35:54,783 INFO L225 Difference]: With dead ends: 1716 [2022-07-13 11:35:54,783 INFO L226 Difference]: Without dead ends: 939 [2022-07-13 11:35:54,784 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:35:54,784 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 105 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:35:54,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 270 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 211 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 11:35:54,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2022-07-13 11:35:54,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 787. [2022-07-13 11:35:54,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 1.4898218829516539) internal successors, (1171), 786 states have internal predecessors, (1171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:35:54,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1171 transitions. [2022-07-13 11:35:54,801 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1171 transitions. Word has length 110 [2022-07-13 11:35:54,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:35:54,802 INFO L495 AbstractCegarLoop]: Abstraction has 787 states and 1171 transitions. [2022-07-13 11:35:54,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:35:54,802 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1171 transitions. [2022-07-13 11:35:54,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-13 11:35:54,803 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:35:54,803 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:35:54,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-13 11:35:54,804 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:35:54,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:35:54,804 INFO L85 PathProgramCache]: Analyzing trace with hash -540911783, now seen corresponding path program 1 times [2022-07-13 11:35:54,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:35:54,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199126565] [2022-07-13 11:35:54,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:35:54,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:35:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:35:54,938 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-13 11:35:54,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:35:54,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199126565] [2022-07-13 11:35:54,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199126565] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:35:54,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:35:54,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:35:54,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353248885] [2022-07-13 11:35:54,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:35:54,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:35:54,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:35:54,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:35:54,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:35:54,941 INFO L87 Difference]: Start difference. First operand 787 states and 1171 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:35:56,949 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:35:57,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:35:57,199 INFO L93 Difference]: Finished difference Result 1707 states and 2502 transitions. [2022-07-13 11:35:57,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:35:57,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 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 110 [2022-07-13 11:35:57,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:35:57,202 INFO L225 Difference]: With dead ends: 1707 [2022-07-13 11:35:57,202 INFO L226 Difference]: Without dead ends: 927 [2022-07-13 11:35:57,203 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:35:57,203 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 83 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 40 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:35:57,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 270 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 203 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 11:35:57,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2022-07-13 11:35:57,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 793. [2022-07-13 11:35:57,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 792 states have (on average 1.4898989898989898) internal successors, (1180), 792 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:35:57,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1180 transitions. [2022-07-13 11:35:57,224 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1180 transitions. Word has length 110 [2022-07-13 11:35:57,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:35:57,224 INFO L495 AbstractCegarLoop]: Abstraction has 793 states and 1180 transitions. [2022-07-13 11:35:57,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:35:57,225 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1180 transitions. [2022-07-13 11:35:57,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-13 11:35:57,226 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:35:57,226 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:35:57,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-13 11:35:57,226 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:35:57,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:35:57,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1069705694, now seen corresponding path program 1 times [2022-07-13 11:35:57,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:35:57,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794291845] [2022-07-13 11:35:57,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:35:57,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:35:57,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:35:57,363 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-13 11:35:57,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:35:57,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794291845] [2022-07-13 11:35:57,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794291845] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:35:57,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:35:57,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:35:57,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065146569] [2022-07-13 11:35:57,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:35:57,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:35:57,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:35:57,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:35:57,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:35:57,365 INFO L87 Difference]: Start difference. First operand 793 states and 1180 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:35:59,371 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:35:59,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:35:59,418 INFO L93 Difference]: Finished difference Result 1577 states and 2354 transitions. [2022-07-13 11:35:59,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:35:59,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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 110 [2022-07-13 11:35:59,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:35:59,421 INFO L225 Difference]: With dead ends: 1577 [2022-07-13 11:35:59,421 INFO L226 Difference]: Without dead ends: 1074 [2022-07-13 11:35:59,422 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:35:59,422 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 124 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:35:59,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 468 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-07-13 11:35:59,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2022-07-13 11:35:59,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 1074. [2022-07-13 11:35:59,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1074 states, 1073 states have (on average 1.4874184529356944) internal successors, (1596), 1073 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:35:59,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 1596 transitions. [2022-07-13 11:35:59,442 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 1596 transitions. Word has length 110 [2022-07-13 11:35:59,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:35:59,442 INFO L495 AbstractCegarLoop]: Abstraction has 1074 states and 1596 transitions. [2022-07-13 11:35:59,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:35:59,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1596 transitions. [2022-07-13 11:35:59,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-13 11:35:59,444 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:35:59,444 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:35:59,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-13 11:35:59,444 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:35:59,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:35:59,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1254631592, now seen corresponding path program 1 times [2022-07-13 11:35:59,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:35:59,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285332280] [2022-07-13 11:35:59,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:35:59,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:36:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 11:36:00,023 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 11:36:00,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 11:36:00,347 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 11:36:00,347 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 11:36:00,348 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 11:36:00,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-13 11:36:00,354 INFO L356 BasicCegarLoop]: Path program histogram: [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] [2022-07-13 11:36:00,356 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 11:36:00,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 11:36:00 BoogieIcfgContainer [2022-07-13 11:36:00,455 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 11:36:00,456 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 11:36:00,456 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 11:36:00,456 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 11:36:00,456 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:34:39" (3/4) ... [2022-07-13 11:36:00,458 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-13 11:36:00,458 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 11:36:00,459 INFO L158 Benchmark]: Toolchain (without parser) took 84387.03ms. Allocated memory was 90.2MB in the beginning and 281.0MB in the end (delta: 190.8MB). Free memory was 55.6MB in the beginning and 149.7MB in the end (delta: -94.1MB). Peak memory consumption was 97.3MB. Max. memory is 16.1GB. [2022-07-13 11:36:00,460 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 90.2MB. Free memory was 46.5MB in the beginning and 46.5MB in the end (delta: 47.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 11:36:00,461 INFO L158 Benchmark]: CACSL2BoogieTranslator took 452.99ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 55.6MB in the beginning and 66.1MB in the end (delta: -10.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 11:36:00,461 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.69ms. Allocated memory is still 109.1MB. Free memory was 66.1MB in the beginning and 61.3MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-13 11:36:00,462 INFO L158 Benchmark]: Boogie Preprocessor took 71.91ms. Allocated memory is still 109.1MB. Free memory was 61.3MB in the beginning and 55.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-13 11:36:00,465 INFO L158 Benchmark]: RCFGBuilder took 2796.36ms. Allocated memory is still 109.1MB. Free memory was 55.0MB in the beginning and 51.2MB in the end (delta: 3.8MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2022-07-13 11:36:00,465 INFO L158 Benchmark]: TraceAbstraction took 80988.63ms. Allocated memory was 109.1MB in the beginning and 281.0MB in the end (delta: 172.0MB). Free memory was 50.7MB in the beginning and 150.7MB in the end (delta: -100.1MB). Peak memory consumption was 168.4MB. Max. memory is 16.1GB. [2022-07-13 11:36:00,466 INFO L158 Benchmark]: Witness Printer took 2.71ms. Allocated memory is still 281.0MB. Free memory was 150.7MB in the beginning and 149.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 11:36:00,468 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.17ms. Allocated memory is still 90.2MB. Free memory was 46.5MB in the beginning and 46.5MB in the end (delta: 47.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 452.99ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 55.6MB in the beginning and 66.1MB in the end (delta: -10.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.69ms. Allocated memory is still 109.1MB. Free memory was 66.1MB in the beginning and 61.3MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.91ms. Allocated memory is still 109.1MB. Free memory was 61.3MB in the beginning and 55.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 2796.36ms. Allocated memory is still 109.1MB. Free memory was 55.0MB in the beginning and 51.2MB in the end (delta: 3.8MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. * TraceAbstraction took 80988.63ms. Allocated memory was 109.1MB in the beginning and 281.0MB in the end (delta: 172.0MB). Free memory was 50.7MB in the beginning and 150.7MB in the end (delta: -100.1MB). Peak memory consumption was 168.4MB. Max. memory is 16.1GB. * Witness Printer took 2.71ms. Allocated memory is still 281.0MB. Free memory was 150.7MB in the beginning and 149.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1665]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1360. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={4:0}] [L1077] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1081] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1082] s->ctx = malloc(sizeof(SSL_CTX)) [L1083] s->session = malloc(sizeof(SSL_SESSION)) [L1084] s->state = 12292 [L1085] s->version = __VERIFIER_nondet_int() [L1087] s->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1088] EXPR s->ctx [L1088] (s->ctx)->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1089] s->init_buf = (BUF_MEM *)__VERIFIER_nondet_ulong() [L1090] s->bbio = (BIO *) __VERIFIER_nondet_ulong() [L1091] s->wbio = (BIO *) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->flags = __VERIFIER_nondet_long() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.cert_req = __VERIFIER_nondet_int() [L1094] EXPR s->s3 [L1094] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1096] EXPR s->s3 [L1096] (s->s3)->tmp.next_state = __VERIFIER_nondet_int() [L1098] CALL ssl3_connect(s) [L1104] BUF_MEM *buf ; [L1105] unsigned long tmp ; [L1106] unsigned long l ; [L1107] long num1 ; [L1108] void (*cb)() ; [L1109] int ret ; [L1110] int new_state ; [L1111] int state ; [L1112] int skip ; [L1113] int tmp___1 = __VERIFIER_nondet_int() ; [L1114] int tmp___2 = __VERIFIER_nondet_int() ; [L1115] int tmp___3 = __VERIFIER_nondet_int() ; [L1116] int tmp___4 = __VERIFIER_nondet_int() ; [L1117] int tmp___5 = __VERIFIER_nondet_int() ; [L1118] int tmp___6 = __VERIFIER_nondet_int() ; [L1119] int tmp___7 = __VERIFIER_nondet_int() ; [L1120] int tmp___8 = __VERIFIER_nondet_int() ; [L1121] long tmp___9 = __VERIFIER_nondet_long() ; [L1122] int blastFlag ; [L1125] blastFlag = 0 [L1126] s->hit=__VERIFIER_nondet_int () [L1127] s->state = 12292 [L1128] tmp = __VERIFIER_nondet_int() [L1129] cb = (void (*)())((void *)0) [L1130] ret = -1 [L1131] skip = 0 [L1132] EXPR s->info_callback VAL [={0:0}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->info_callback={0:-2147483648}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1133] EXPR s->info_callback [L1133] cb = s->info_callback [L1141] EXPR s->in_handshake [L1141] s->in_handshake += 1 [L1142] COND FALSE !(tmp___1 & 12288) VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=12292, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND TRUE s->state == 12292 [L1258] s->new_session = 1 [L1259] s->state = 4096 [L1260] EXPR s->ctx [L1260] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1260] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1265] s->server = 0 VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1266] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1271] EXPR s->version VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->version=-6, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1271] COND FALSE !((s->version & 65280) != 768) [L1277] s->type = 4096 [L1278] EXPR s->init_buf VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->init_buf={0:1}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1278] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1296] COND FALSE !(! tmp___4) VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1302] COND FALSE !(! tmp___5) [L1308] s->state = 4368 [L1309] EXPR s->ctx [L1309] EXPR (s->ctx)->stats.sess_connect [L1309] (s->ctx)->stats.sess_connect += 1 [L1310] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967336, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, init=1, ret=-1, s={-8:0}, s={-8:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1170] COND TRUE s->state == 4368 [L1314] s->shutdown = 0 [L1315] ret = __VERIFIER_nondet_int() [L1316] COND TRUE blastFlag == 0 [L1317] blastFlag = 1 VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1321] COND FALSE !(ret <= 0) [L1326] s->state = 4384 [L1327] s->init_num = 0 [L1328] EXPR s->bbio [L1328] EXPR s->wbio VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, s->bbio={0:11}, s->wbio={0:-13}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1328] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967336, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, init=1, ret=13, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1176] COND TRUE s->state == 4384 [L1336] ret = __VERIFIER_nondet_int() [L1337] COND TRUE blastFlag == 1 [L1338] blastFlag = 2 VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1346] COND FALSE !(ret <= 0) [L1351] s->hit VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->hit=0, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1351] COND FALSE !(s->hit) [L1354] s->state = 4400 VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1356] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967336, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1182] COND TRUE s->state == 4400 [L1360] EXPR s->s3 [L1360] EXPR (s->s3)->tmp.new_cipher [L1360] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:-2147483648}, ((s->s3)->tmp.new_cipher)->algorithms=4294967345, (s->s3)->tmp.new_cipher={-7:0}, blastFlag=2, init=1, ret=1, s={-8:0}, s={-8:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1360] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1363] ret = __VERIFIER_nondet_int() [L1364] COND TRUE blastFlag == 2 [L1365] blastFlag = 3 VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1369] COND FALSE !(ret <= 0) VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1375] s->state = 4416 [L1376] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967336, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1182] COND FALSE !(s->state == 4400) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1185] COND FALSE !(s->state == 4401) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, init=1, ret=18, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1188] COND TRUE s->state == 4416 [L1380] ret = __VERIFIER_nondet_int() [L1381] COND TRUE blastFlag == 3 [L1382] blastFlag = 4 VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1386] COND FALSE !(ret <= 0) [L1391] s->state = 4432 [L1392] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1393] COND FALSE !(! tmp___6) VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967336, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1182] COND FALSE !(s->state == 4400) [L1185] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1185] COND FALSE !(s->state == 4401) [L1188] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1188] COND FALSE !(s->state == 4416) [L1191] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1191] COND FALSE !(s->state == 4417) [L1194] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1194] COND TRUE s->state == 4432 [L1402] ret = __VERIFIER_nondet_int() [L1403] COND TRUE blastFlag == 4 VAL [={0:-2147483648}, blastFlag=4, init=1, ret=0, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1665] reach_error() VAL [={0:-2147483648}, blastFlag=4, init=1, ret=0, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 129 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 80.9s, OverallIterations: 27, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 74.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 34 mSolverCounterUnknown, 2438 SdHoareTripleChecker+Valid, 73.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2438 mSDsluCounter, 10162 SdHoareTripleChecker+Invalid, 72.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5839 mSDsCounter, 627 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4734 IncrementalHoareTripleChecker+Invalid, 5395 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 627 mSolverCounterUnsat, 4323 mSDtfsCounter, 4734 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1074occurred in iteration=26, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 26 MinimizatonAttempts, 3331 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 2554 NumberOfCodeBlocks, 2554 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2416 ConstructedInterpolants, 0 QuantifiedInterpolants, 6030 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 2491/2491 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-13 11:36:00,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl/s3_clnt.blast.03.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 1c5ecbc156ef402fa8ca002c27ace1df37fef4394f3f2e7d74e739b1fb38fbd5 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:36:02,165 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:36:02,167 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:36:02,200 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:36:02,200 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:36:02,201 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:36:02,204 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:36:02,207 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:36:02,212 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:36:02,215 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:36:02,216 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:36:02,220 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:36:02,220 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:36:02,221 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:36:02,222 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:36:02,224 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:36:02,225 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:36:02,226 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:36:02,227 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:36:02,231 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:36:02,232 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:36:02,233 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:36:02,234 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:36:02,235 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:36:02,236 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:36:02,244 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:36:02,245 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:36:02,245 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:36:02,245 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:36:02,246 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:36:02,246 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:36:02,247 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:36:02,248 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:36:02,248 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:36:02,249 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:36:02,250 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:36:02,250 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:36:02,250 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:36:02,251 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:36:02,251 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:36:02,251 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:36:02,252 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:36:02,259 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:36:02,283 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:36:02,284 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:36:02,284 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:36:02,284 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:36:02,284 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:36:02,285 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:36:02,285 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:36:02,285 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:36:02,285 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:36:02,287 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:36:02,287 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:36:02,287 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:36:02,287 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:36:02,288 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:36:02,288 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:36:02,288 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:36:02,288 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 11:36:02,288 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 11:36:02,288 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 11:36:02,289 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:36:02,289 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:36:02,289 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:36:02,289 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:36:02,289 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:36:02,289 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:36:02,289 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:36:02,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:36:02,290 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:36:02,290 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:36:02,290 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:36:02,290 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 11:36:02,290 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 11:36:02,291 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:36:02,291 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:36:02,291 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:36:02,291 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 11:36:02,291 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 -> 1c5ecbc156ef402fa8ca002c27ace1df37fef4394f3f2e7d74e739b1fb38fbd5 [2022-07-13 11:36:02,512 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:36:02,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:36:02,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:36:02,529 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:36:02,529 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:36:02,530 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_clnt.blast.03.i.cil-1.c [2022-07-13 11:36:02,575 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68afb0aca/3224f51453f84d7f831700a2e78280c5/FLAG58a542ead [2022-07-13 11:36:03,048 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:36:03,048 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_clnt.blast.03.i.cil-1.c [2022-07-13 11:36:03,063 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68afb0aca/3224f51453f84d7f831700a2e78280c5/FLAG58a542ead [2022-07-13 11:36:03,352 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68afb0aca/3224f51453f84d7f831700a2e78280c5 [2022-07-13 11:36:03,354 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:36:03,356 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:36:03,358 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:36:03,358 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:36:03,360 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:36:03,361 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:36:03" (1/1) ... [2022-07-13 11:36:03,363 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6972e6ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:36:03, skipping insertion in model container [2022-07-13 11:36:03,363 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:36:03" (1/1) ... [2022-07-13 11:36:03,368 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:36:03,412 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:36:03,763 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_clnt.blast.03.i.cil-1.c[65397,65410] [2022-07-13 11:36:03,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:36:03,789 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-13 11:36:03,798 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:36:03,874 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_clnt.blast.03.i.cil-1.c[65397,65410] [2022-07-13 11:36:03,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:36:03,886 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:36:03,963 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_clnt.blast.03.i.cil-1.c[65397,65410] [2022-07-13 11:36:03,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:36:03,976 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:36:03,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:36:03 WrapperNode [2022-07-13 11:36:03,976 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:36:03,977 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:36:03,977 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:36:03,977 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:36:03,982 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:36:03" (1/1) ... [2022-07-13 11:36:04,003 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:36:03" (1/1) ... [2022-07-13 11:36:04,047 INFO L137 Inliner]: procedures = 35, calls = 217, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 689 [2022-07-13 11:36:04,051 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:36:04,051 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:36:04,051 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:36:04,052 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:36:04,057 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:36:03" (1/1) ... [2022-07-13 11:36:04,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:36:03" (1/1) ... [2022-07-13 11:36:04,076 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:36:03" (1/1) ... [2022-07-13 11:36:04,077 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:36:03" (1/1) ... [2022-07-13 11:36:04,104 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:36:03" (1/1) ... [2022-07-13 11:36:04,110 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:36:03" (1/1) ... [2022-07-13 11:36:04,119 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:36:03" (1/1) ... [2022-07-13 11:36:04,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:36:04,128 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:36:04,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:36:04,129 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:36:04,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:36:03" (1/1) ... [2022-07-13 11:36:04,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:36:04,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:36:04,153 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:36:04,171 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:36:04,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:36:04,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 11:36:04,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 11:36:04,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-13 11:36:04,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 11:36:04,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 11:36:04,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:36:04,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:36:04,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-13 11:36:04,370 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:36:04,371 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:36:04,388 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:36:11,542 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-07-13 11:36:11,542 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-07-13 11:36:11,542 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:36:11,547 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:36:11,548 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 11:36:11,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:36:11 BoogieIcfgContainer [2022-07-13 11:36:11,549 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:36:11,550 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:36:11,550 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:36:11,552 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:36:11,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:36:03" (1/3) ... [2022-07-13 11:36:11,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a0b13a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:36:11, skipping insertion in model container [2022-07-13 11:36:11,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:36:03" (2/3) ... [2022-07-13 11:36:11,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a0b13a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:36:11, skipping insertion in model container [2022-07-13 11:36:11,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:36:11" (3/3) ... [2022-07-13 11:36:11,554 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.03.i.cil-1.c [2022-07-13 11:36:11,564 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:36:11,564 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:36:11,616 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:36:11,620 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@37a9b95a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1f9b8196 [2022-07-13 11:36:11,620 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:36:11,623 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 127 states have (on average 1.7086614173228347) internal successors, (217), 128 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:36:11,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-13 11:36:11,629 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:36:11,629 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] [2022-07-13 11:36:11,630 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:36:11,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:36:11,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2022-07-13 11:36:11,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:36:11,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697510760] [2022-07-13 11:36:11,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:36:11,649 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:36:11,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:36:11,652 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:36:11,654 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:36:12,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:36:12,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 892 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 11:36:12,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:36:12,448 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:36:12,448 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:36:12,448 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:36:12,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697510760] [2022-07-13 11:36:12,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [697510760] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:36:12,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:36:12,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:36:12,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507486329] [2022-07-13 11:36:12,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:36:12,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:36:12,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:36:12,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:36:12,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:36:12,471 INFO L87 Difference]: Start difference. First operand has 129 states, 127 states have (on average 1.7086614173228347) internal successors, (217), 128 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:36:12,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:36:12,571 INFO L93 Difference]: Finished difference Result 369 states and 623 transitions. [2022-07-13 11:36:12,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:36:12,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-07-13 11:36:12,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:36:12,580 INFO L225 Difference]: With dead ends: 369 [2022-07-13 11:36:12,580 INFO L226 Difference]: Without dead ends: 213 [2022-07-13 11:36:12,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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:36:12,585 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 180 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:36:12,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 400 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:36:12,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-07-13 11:36:12,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2022-07-13 11:36:12,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 1.4952830188679245) internal successors, (317), 212 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:36:12,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 317 transitions. [2022-07-13 11:36:12,616 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 317 transitions. Word has length 24 [2022-07-13 11:36:12,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:36:12,616 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 317 transitions. [2022-07-13 11:36:12,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:36:12,617 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 317 transitions. [2022-07-13 11:36:12,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-13 11:36:12,618 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:36:12,618 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] [2022-07-13 11:36:12,643 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:36:12,839 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:36:12,842 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:36:12,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:36:12,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1192110763, now seen corresponding path program 1 times [2022-07-13 11:36:12,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:36:12,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2055828033] [2022-07-13 11:36:12,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:36:12,843 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:36:12,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:36:12,844 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:36:12,845 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:36:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:36:13,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 11:36:13,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:36:13,655 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:36:13,655 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:36:13,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:36:13,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2055828033] [2022-07-13 11:36:13,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2055828033] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:36:13,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:36:13,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:36:13,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245196033] [2022-07-13 11:36:13,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:36:13,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:36:13,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:36:13,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:36:13,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:36:13,657 INFO L87 Difference]: Start difference. First operand 213 states and 317 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:36:15,681 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:36:15,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:36:15,772 INFO L93 Difference]: Finished difference Result 417 states and 626 transitions. [2022-07-13 11:36:15,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:36:15,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-13 11:36:15,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:36:15,775 INFO L225 Difference]: With dead ends: 417 [2022-07-13 11:36:15,775 INFO L226 Difference]: Without dead ends: 312 [2022-07-13 11:36:15,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 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:36:15,776 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 123 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:36:15,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 461 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-13 11:36:15,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-07-13 11:36:15,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2022-07-13 11:36:15,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 311 states have (on average 1.4887459807073955) internal successors, (463), 311 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:36:15,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 463 transitions. [2022-07-13 11:36:15,803 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 463 transitions. Word has length 39 [2022-07-13 11:36:15,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:36:15,804 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 463 transitions. [2022-07-13 11:36:15,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:36:15,804 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 463 transitions. [2022-07-13 11:36:15,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-13 11:36:15,806 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:36:15,806 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 11:36:15,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-13 11:36:16,006 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:36:16,006 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:36:16,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:36:16,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1499463818, now seen corresponding path program 1 times [2022-07-13 11:36:16,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:36:16,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [165902522] [2022-07-13 11:36:16,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:36:16,008 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:36:16,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:36:16,011 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:36:16,013 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:36:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:36:16,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 11:36:16,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:36:16,874 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 11:36:16,874 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:36:16,875 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:36:16,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [165902522] [2022-07-13 11:36:16,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [165902522] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:36:16,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:36:16,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:36:16,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249148363] [2022-07-13 11:36:16,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:36:16,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:36:16,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:36:16,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:36:16,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:36:16,876 INFO L87 Difference]: Start difference. First operand 312 states and 463 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:36:18,895 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:36:18,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:36:18,976 INFO L93 Difference]: Finished difference Result 618 states and 923 transitions. [2022-07-13 11:36:18,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:36:18,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 57 [2022-07-13 11:36:18,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:36:18,979 INFO L225 Difference]: With dead ends: 618 [2022-07-13 11:36:18,980 INFO L226 Difference]: Without dead ends: 414 [2022-07-13 11:36:18,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 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:36:18,981 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 126 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:36:18,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 468 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-13 11:36:18,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2022-07-13 11:36:19,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2022-07-13 11:36:19,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 413 states have (on average 1.4842615012106537) internal successors, (613), 413 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:36:19,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 613 transitions. [2022-07-13 11:36:19,013 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 613 transitions. Word has length 57 [2022-07-13 11:36:19,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:36:19,013 INFO L495 AbstractCegarLoop]: Abstraction has 414 states and 613 transitions. [2022-07-13 11:36:19,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:36:19,014 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 613 transitions. [2022-07-13 11:36:19,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-13 11:36:19,016 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:36:19,018 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2022-07-13 11:36:19,042 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:36:19,231 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:36:19,232 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:36:19,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:36:19,232 INFO L85 PathProgramCache]: Analyzing trace with hash -817434927, now seen corresponding path program 1 times [2022-07-13 11:36:19,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:36:19,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1688838000] [2022-07-13 11:36:19,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:36:19,233 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:36:19,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:36:19,234 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:36:19,235 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:36:19,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:36:19,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 1108 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 11:36:19,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:36:20,129 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-13 11:36:20,129 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:36:20,129 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:36:20,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1688838000] [2022-07-13 11:36:20,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1688838000] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:36:20,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:36:20,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:36:20,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985487780] [2022-07-13 11:36:20,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:36:20,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:36:20,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:36:20,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:36:20,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:36:20,131 INFO L87 Difference]: Start difference. First operand 414 states and 613 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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:36:22,148 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:36:22,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:36:22,243 INFO L93 Difference]: Finished difference Result 821 states and 1222 transitions. [2022-07-13 11:36:22,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:36:22,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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 77 [2022-07-13 11:36:22,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:36:22,246 INFO L225 Difference]: With dead ends: 821 [2022-07-13 11:36:22,246 INFO L226 Difference]: Without dead ends: 515 [2022-07-13 11:36:22,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 75 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:36:22,247 INFO L413 NwaCegarLoop]: 311 mSDtfsCounter, 126 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:36:22,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 467 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-13 11:36:22,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-07-13 11:36:22,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2022-07-13 11:36:22,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 514 states have (on average 1.482490272373541) internal successors, (762), 514 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:36:22,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 762 transitions. [2022-07-13 11:36:22,259 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 762 transitions. Word has length 77 [2022-07-13 11:36:22,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:36:22,270 INFO L495 AbstractCegarLoop]: Abstraction has 515 states and 762 transitions. [2022-07-13 11:36:22,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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:36:22,272 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 762 transitions. [2022-07-13 11:36:22,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-13 11:36:22,278 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:36:22,279 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:36:22,305 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:36:22,501 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:36:22,501 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:36:22,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:36:22,502 INFO L85 PathProgramCache]: Analyzing trace with hash 922615118, now seen corresponding path program 1 times [2022-07-13 11:36:22,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:36:22,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1013947736] [2022-07-13 11:36:22,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:36:22,503 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:36:22,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:36:22,519 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:36:22,520 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:36:23,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:36:23,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 1178 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 11:36:23,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:36:25,619 INFO L356 Elim1Store]: treesize reduction 32, result has 78.5 percent of original size [2022-07-13 11:36:25,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 1482 treesize of output 1090 [2022-07-13 11:36:43,036 WARN L233 SmtUtils]: Spent 17.33s on a formula simplification. DAG size of input: 205 DAG size of output: 93 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-13 11:36:43,037 INFO L356 Elim1Store]: treesize reduction 1374, result has 25.4 percent of original size [2022-07-13 11:36:43,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 9 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 10 new quantified variables, introduced 18 case distinctions, treesize of input 4790 treesize of output 4750 [2022-07-13 11:36:43,150 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 4345 treesize of output 3031 [2022-07-13 11:36:43,727 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:36:43,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2466 treesize of output 1710 [2022-07-13 11:36:44,403 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:36:44,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 968 treesize of output 891 [2022-07-13 11:36:44,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:44,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:44,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:44,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:44,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:44,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:44,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:44,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:44,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:44,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:44,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:44,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:44,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:44,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:44,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:44,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:44,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:44,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:45,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:45,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:45,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:45,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:45,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:45,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:45,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:45,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:45,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:45,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:45,773 INFO L244 Elim1Store]: Index analysis took 1046 ms [2022-07-13 11:36:46,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 31 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 87 [2022-07-13 11:36:46,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:46,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:46,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:46,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:46,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:46,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:46,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:46,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:46,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:47,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:47,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:47,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:47,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:47,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:47,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:47,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:47,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:47,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:47,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:47,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:47,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:47,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:47,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:47,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:47,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:47,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:47,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:47,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:47,551 INFO L244 Elim1Store]: Index analysis took 666 ms [2022-07-13 11:36:48,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 31 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 111 [2022-07-13 11:36:48,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:48,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:48,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:48,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:48,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:48,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:48,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:48,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:48,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:48,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:48,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:48,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:48,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:48,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:48,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:48,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:48,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:48,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:48,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:48,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:49,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:49,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:49,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:49,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:49,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:49,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:49,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:49,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:36:49,553 INFO L244 Elim1Store]: Index analysis took 813 ms [2022-07-13 11:36:50,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 31 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 111 [2022-07-13 11:36:50,591 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 431 treesize of output 371 [2022-07-13 11:36:51,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 123 [2022-07-13 11:36:51,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 115