./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl/s3_clnt.blast.01.i.cil-2.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.01.i.cil-2.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 781939b227b3ba0a20ad2d0323c2d13ae338349fb5c0bf292cccf74fd05cfb42 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:33:31,025 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:33:31,026 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:33:31,052 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:33:31,053 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:33:31,054 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:33:31,056 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:33:31,059 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:33:31,060 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:33:31,064 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:33:31,064 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:33:31,066 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:33:31,066 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:33:31,068 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:33:31,069 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:33:31,071 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:33:31,072 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:33:31,073 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:33:31,074 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:33:31,078 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:33:31,080 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:33:31,080 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:33:31,081 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:33:31,081 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:33:31,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:33:31,087 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:33:31,088 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:33:31,088 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:33:31,089 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:33:31,089 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:33:31,090 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:33:31,091 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:33:31,092 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:33:31,092 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:33:31,093 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:33:31,094 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:33:31,094 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:33:31,095 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:33:31,095 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:33:31,095 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:33:31,096 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:33:31,097 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:33:31,098 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:33:31,127 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:33:31,128 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:33:31,128 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:33:31,128 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:33:31,129 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:33:31,129 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:33:31,129 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:33:31,130 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:33:31,130 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:33:31,130 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:33:31,131 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:33:31,131 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 11:33:31,131 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:33:31,131 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:33:31,131 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:33:31,131 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:33:31,131 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:33:31,132 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:33:31,132 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:33:31,132 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:33:31,132 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:33:31,132 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:33:31,132 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:33:31,133 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:33:31,133 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:33:31,134 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:33:31,134 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:33:31,134 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:33:31,134 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 11:33:31,134 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 11:33:31,134 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:33:31,135 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:33:31,135 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:33:31,135 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 -> 781939b227b3ba0a20ad2d0323c2d13ae338349fb5c0bf292cccf74fd05cfb42 [2022-07-13 11:33:31,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:33:31,330 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:33:31,331 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:33:31,332 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:33:31,341 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:33:31,342 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_clnt.blast.01.i.cil-2.c [2022-07-13 11:33:31,388 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/329dc867e/e2ad58cc1ebc47a5843f144603789b68/FLAGe55edef2e [2022-07-13 11:33:31,915 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:33:31,917 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_clnt.blast.01.i.cil-2.c [2022-07-13 11:33:31,933 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/329dc867e/e2ad58cc1ebc47a5843f144603789b68/FLAGe55edef2e [2022-07-13 11:33:32,185 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/329dc867e/e2ad58cc1ebc47a5843f144603789b68 [2022-07-13 11:33:32,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:33:32,189 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:33:32,191 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:33:32,192 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:33:32,194 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:33:32,194 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:33:32" (1/1) ... [2022-07-13 11:33:32,195 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7603c4c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:33:32, skipping insertion in model container [2022-07-13 11:33:32,195 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:33:32" (1/1) ... [2022-07-13 11:33:32,199 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:33:32,250 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:33:32,527 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.01.i.cil-2.c[65520,65533] [2022-07-13 11:33:32,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:33:32,558 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:33:32,660 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.01.i.cil-2.c[65520,65533] [2022-07-13 11:33:32,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:33:32,677 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:33:32,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:33:32 WrapperNode [2022-07-13 11:33:32,678 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:33:32,679 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:33:32,679 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:33:32,679 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:33:32,684 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:33:32" (1/1) ... [2022-07-13 11:33:32,711 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:33:32" (1/1) ... [2022-07-13 11:33:32,759 INFO L137 Inliner]: procedures = 31, calls = 217, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 724 [2022-07-13 11:33:32,759 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:33:32,760 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:33:32,760 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:33:32,760 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:33:32,766 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:33:32" (1/1) ... [2022-07-13 11:33:32,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:33:32" (1/1) ... [2022-07-13 11:33:32,771 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:33:32" (1/1) ... [2022-07-13 11:33:32,771 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:33:32" (1/1) ... [2022-07-13 11:33:32,791 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:33:32" (1/1) ... [2022-07-13 11:33:32,796 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:33:32" (1/1) ... [2022-07-13 11:33:32,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:33:32" (1/1) ... [2022-07-13 11:33:32,832 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:33:32,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:33:32,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:33:32,834 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:33:32,835 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:33:32" (1/1) ... [2022-07-13 11:33:32,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:33:32,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:33:32,921 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:33:32,945 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:33:32,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:33:32,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 11:33:32,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 11:33:32,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 11:33:32,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 11:33:32,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 11:33:32,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 11:33:32,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:33:32,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:33:33,076 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:33:33,077 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:33:33,088 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:33:35,586 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-07-13 11:33:35,587 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-07-13 11:33:35,587 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:33:35,592 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:33:35,592 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 11:33:35,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:33:35 BoogieIcfgContainer [2022-07-13 11:33:35,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:33:35,595 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:33:35,595 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:33:35,598 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:33:35,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:33:32" (1/3) ... [2022-07-13 11:33:35,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cfe3ac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:33:35, skipping insertion in model container [2022-07-13 11:33:35,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:33:32" (2/3) ... [2022-07-13 11:33:35,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cfe3ac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:33:35, skipping insertion in model container [2022-07-13 11:33:35,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:33:35" (3/3) ... [2022-07-13 11:33:35,600 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01.i.cil-2.c [2022-07-13 11:33:35,609 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:33:35,610 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:33:35,642 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:33:35,646 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@63ccd73c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4ece73a [2022-07-13 11:33:35,647 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:33:35,651 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 129 states have (on average 1.689922480620155) internal successors, (218), 130 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:35,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-13 11:33:35,657 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:35,657 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:33:35,658 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:35,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:35,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1457703967, now seen corresponding path program 1 times [2022-07-13 11:33:35,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:35,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933969681] [2022-07-13 11:33:35,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:35,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:36,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:36,255 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:33:36,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:36,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933969681] [2022-07-13 11:33:36,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933969681] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:36,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:36,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:33:36,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222710632] [2022-07-13 11:33:36,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:36,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:33:36,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:36,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:33:36,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:33:36,289 INFO L87 Difference]: Start difference. First operand has 131 states, 129 states have (on average 1.689922480620155) internal successors, (218), 130 states have internal predecessors, (218), 0 states have call successors, (0), 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:33:38,317 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:33:38,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:38,625 INFO L93 Difference]: Finished difference Result 365 states and 610 transitions. [2022-07-13 11:33:38,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:33:38,627 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:33:38,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:38,634 INFO L225 Difference]: With dead ends: 365 [2022-07-13 11:33:38,634 INFO L226 Difference]: Without dead ends: 208 [2022-07-13 11:33:38,637 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:33:38,643 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 143 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 45 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:33:38,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 381 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 235 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-13 11:33:38,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-13 11:33:38,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 138. [2022-07-13 11:33:38,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 1.5547445255474452) internal successors, (213), 137 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:38,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 213 transitions. [2022-07-13 11:33:38,696 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 213 transitions. Word has length 24 [2022-07-13 11:33:38,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:38,697 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 213 transitions. [2022-07-13 11:33:38,697 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:33:38,698 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 213 transitions. [2022-07-13 11:33:38,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-13 11:33:38,699 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:38,699 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:33:38,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 11:33:38,700 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:38,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:38,701 INFO L85 PathProgramCache]: Analyzing trace with hash 2051399350, now seen corresponding path program 1 times [2022-07-13 11:33:38,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:38,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350634231] [2022-07-13 11:33:38,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:38,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:38,928 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:33:38,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:38,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350634231] [2022-07-13 11:33:38,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350634231] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:38,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:38,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:33:38,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293300890] [2022-07-13 11:33:38,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:38,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:33:38,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:38,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:33:38,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:33:38,933 INFO L87 Difference]: Start difference. First operand 138 states and 213 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:40,948 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:33:41,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:41,189 INFO L93 Difference]: Finished difference Result 363 states and 558 transitions. [2022-07-13 11:33:41,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:33:41,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-07-13 11:33:41,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:41,191 INFO L225 Difference]: With dead ends: 363 [2022-07-13 11:33:41,191 INFO L226 Difference]: Without dead ends: 232 [2022-07-13 11:33:41,192 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:33:41,193 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 109 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:33:41,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 270 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 11:33:41,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-07-13 11:33:41,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 163. [2022-07-13 11:33:41,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.5864197530864197) internal successors, (257), 162 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:41,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 257 transitions. [2022-07-13 11:33:41,204 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 257 transitions. Word has length 25 [2022-07-13 11:33:41,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:41,205 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 257 transitions. [2022-07-13 11:33:41,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:41,205 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 257 transitions. [2022-07-13 11:33:41,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-13 11:33:41,206 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:41,208 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:33:41,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 11:33:41,209 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:41,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:41,209 INFO L85 PathProgramCache]: Analyzing trace with hash -835386660, now seen corresponding path program 1 times [2022-07-13 11:33:41,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:41,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543650171] [2022-07-13 11:33:41,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:41,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:41,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:41,349 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:33:41,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:41,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543650171] [2022-07-13 11:33:41,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543650171] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:41,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:41,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:33:41,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161774855] [2022-07-13 11:33:41,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:41,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:33:41,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:41,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:33:41,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:33:41,351 INFO L87 Difference]: Start difference. First operand 163 states and 257 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:43,363 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:33:43,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:43,494 INFO L93 Difference]: Finished difference Result 323 states and 508 transitions. [2022-07-13 11:33:43,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:33:43,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-07-13 11:33:43,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:43,496 INFO L225 Difference]: With dead ends: 323 [2022-07-13 11:33:43,496 INFO L226 Difference]: Without dead ends: 167 [2022-07-13 11:33:43,496 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:33:43,497 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 7 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:33:43,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 409 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-13 11:33:43,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-13 11:33:43,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2022-07-13 11:33:43,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 1.5757575757575757) internal successors, (260), 165 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:43,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 260 transitions. [2022-07-13 11:33:43,503 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 260 transitions. Word has length 26 [2022-07-13 11:33:43,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:43,503 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 260 transitions. [2022-07-13 11:33:43,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:43,504 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 260 transitions. [2022-07-13 11:33:43,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-13 11:33:43,504 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:43,505 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:33:43,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 11:33:43,505 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:43,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:43,506 INFO L85 PathProgramCache]: Analyzing trace with hash -747175225, now seen corresponding path program 1 times [2022-07-13 11:33:43,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:43,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897693427] [2022-07-13 11:33:43,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:43,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:43,640 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:33:43,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:43,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897693427] [2022-07-13 11:33:43,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897693427] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:43,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:43,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:33:43,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658416579] [2022-07-13 11:33:43,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:43,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:33:43,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:43,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:33:43,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:33:43,642 INFO L87 Difference]: Start difference. First operand 166 states and 260 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:33:43,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:43,659 INFO L93 Difference]: Finished difference Result 474 states and 748 transitions. [2022-07-13 11:33:43,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:33:43,660 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 41 [2022-07-13 11:33:43,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:43,661 INFO L225 Difference]: With dead ends: 474 [2022-07-13 11:33:43,661 INFO L226 Difference]: Without dead ends: 318 [2022-07-13 11:33:43,661 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:33:43,662 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 123 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 314 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:33:43,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 314 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:33:43,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2022-07-13 11:33:43,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2022-07-13 11:33:43,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 317 states have (on average 1.5646687697160884) internal successors, (496), 317 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:43,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 496 transitions. [2022-07-13 11:33:43,671 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 496 transitions. Word has length 41 [2022-07-13 11:33:43,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:43,671 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 496 transitions. [2022-07-13 11:33:43,671 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:33:43,672 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 496 transitions. [2022-07-13 11:33:43,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-13 11:33:43,673 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:43,673 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, 1, 1, 1] [2022-07-13 11:33:43,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 11:33:43,673 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:43,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:43,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1722196731, now seen corresponding path program 1 times [2022-07-13 11:33:43,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:43,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296486455] [2022-07-13 11:33:43,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:43,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:43,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:43,813 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:33:43,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:43,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296486455] [2022-07-13 11:33:43,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296486455] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:43,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:43,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:33:43,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282364080] [2022-07-13 11:33:43,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:43,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:33:43,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:43,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:33:43,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:33:43,815 INFO L87 Difference]: Start difference. First operand 318 states and 496 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:45,828 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:33:45,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:45,887 INFO L93 Difference]: Finished difference Result 625 states and 983 transitions. [2022-07-13 11:33:45,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:33:45,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-07-13 11:33:45,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:45,893 INFO L225 Difference]: With dead ends: 625 [2022-07-13 11:33:45,893 INFO L226 Difference]: Without dead ends: 469 [2022-07-13 11:33:45,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:33:45,895 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 124 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 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:33:45,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 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:33:45,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2022-07-13 11:33:45,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 469. [2022-07-13 11:33:45,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 468 states have (on average 1.561965811965812) internal successors, (731), 468 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:45,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 731 transitions. [2022-07-13 11:33:45,924 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 731 transitions. Word has length 56 [2022-07-13 11:33:45,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:45,926 INFO L495 AbstractCegarLoop]: Abstraction has 469 states and 731 transitions. [2022-07-13 11:33:45,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:45,926 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 731 transitions. [2022-07-13 11:33:45,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-13 11:33:45,931 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:45,932 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, 1, 1] [2022-07-13 11:33:45,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 11:33:45,932 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:45,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:45,933 INFO L85 PathProgramCache]: Analyzing trace with hash 475156595, now seen corresponding path program 1 times [2022-07-13 11:33:45,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:45,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764103677] [2022-07-13 11:33:45,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:45,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:46,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:46,144 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:33:46,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:46,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764103677] [2022-07-13 11:33:46,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764103677] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:46,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:46,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:33:46,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496826722] [2022-07-13 11:33:46,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:46,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:33:46,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:46,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:33:46,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:33:46,145 INFO L87 Difference]: Start difference. First operand 469 states and 731 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:48,152 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:33:50,167 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:33:50,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:50,423 INFO L93 Difference]: Finished difference Result 1110 states and 1718 transitions. [2022-07-13 11:33:50,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:33:50,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-07-13 11:33:50,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:50,426 INFO L225 Difference]: With dead ends: 1110 [2022-07-13 11:33:50,426 INFO L226 Difference]: Without dead ends: 651 [2022-07-13 11:33:50,426 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:33:50,427 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 91 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 560 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:33:50,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 560 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 234 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-07-13 11:33:50,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2022-07-13 11:33:50,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 523. [2022-07-13 11:33:50,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 522 states have (on average 1.5727969348659003) internal successors, (821), 522 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:50,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 821 transitions. [2022-07-13 11:33:50,436 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 821 transitions. Word has length 74 [2022-07-13 11:33:50,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:50,436 INFO L495 AbstractCegarLoop]: Abstraction has 523 states and 821 transitions. [2022-07-13 11:33:50,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:50,436 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 821 transitions. [2022-07-13 11:33:50,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-13 11:33:50,437 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:50,437 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, 1, 1] [2022-07-13 11:33:50,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 11:33:50,438 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:50,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:50,438 INFO L85 PathProgramCache]: Analyzing trace with hash 537196209, now seen corresponding path program 1 times [2022-07-13 11:33:50,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:50,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202899631] [2022-07-13 11:33:50,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:50,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:50,562 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:33:50,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:50,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202899631] [2022-07-13 11:33:50,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202899631] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:50,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:50,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:33:50,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726547722] [2022-07-13 11:33:50,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:50,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:33:50,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:50,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:33:50,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:33:50,564 INFO L87 Difference]: Start difference. First operand 523 states and 821 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:52,580 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:33:54,597 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:33:54,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:54,822 INFO L93 Difference]: Finished difference Result 1120 states and 1753 transitions. [2022-07-13 11:33:54,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:33:54,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-07-13 11:33:54,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:54,824 INFO L225 Difference]: With dead ends: 1120 [2022-07-13 11:33:54,824 INFO L226 Difference]: Without dead ends: 607 [2022-07-13 11:33:54,825 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:33:54,825 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 38 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 496 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:33:54,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 496 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 146 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-13 11:33:54,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2022-07-13 11:33:54,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 563. [2022-07-13 11:33:54,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 562 states have (on average 1.5818505338078293) internal successors, (889), 562 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:54,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 889 transitions. [2022-07-13 11:33:54,835 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 889 transitions. Word has length 74 [2022-07-13 11:33:54,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:54,836 INFO L495 AbstractCegarLoop]: Abstraction has 563 states and 889 transitions. [2022-07-13 11:33:54,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:54,836 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 889 transitions. [2022-07-13 11:33:54,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-13 11:33:54,837 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:54,837 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, 1, 1, 1] [2022-07-13 11:33:54,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 11:33:54,838 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:54,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:54,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1840475418, now seen corresponding path program 1 times [2022-07-13 11:33:54,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:54,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401933262] [2022-07-13 11:33:54,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:54,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:54,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:54,987 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:33:54,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:54,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401933262] [2022-07-13 11:33:54,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401933262] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:54,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:54,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:33:54,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61350231] [2022-07-13 11:33:54,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:54,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:33:54,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:54,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:33:54,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:33:54,989 INFO L87 Difference]: Start difference. First operand 563 states and 889 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:57,003 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:33:57,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:57,219 INFO L93 Difference]: Finished difference Result 1316 states and 2040 transitions. [2022-07-13 11:33:57,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:33:57,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2022-07-13 11:33:57,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:57,221 INFO L225 Difference]: With dead ends: 1316 [2022-07-13 11:33:57,221 INFO L226 Difference]: Without dead ends: 763 [2022-07-13 11:33:57,222 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:33:57,223 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 105 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 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, 43 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:33:57,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 270 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 11:33:57,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2022-07-13 11:33:57,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 569. [2022-07-13 11:33:57,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 568 states have (on average 1.5809859154929577) internal successors, (898), 568 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:57,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 898 transitions. [2022-07-13 11:33:57,232 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 898 transitions. Word has length 75 [2022-07-13 11:33:57,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:57,233 INFO L495 AbstractCegarLoop]: Abstraction has 569 states and 898 transitions. [2022-07-13 11:33:57,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:57,233 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 898 transitions. [2022-07-13 11:33:57,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-13 11:33:57,234 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:57,234 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:33:57,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 11:33:57,234 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:57,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:57,235 INFO L85 PathProgramCache]: Analyzing trace with hash -729811888, now seen corresponding path program 2 times [2022-07-13 11:33:57,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:57,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624225304] [2022-07-13 11:33:57,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:57,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:57,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:57,384 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-13 11:33:57,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:57,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624225304] [2022-07-13 11:33:57,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624225304] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:57,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:57,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:33:57,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611177908] [2022-07-13 11:33:57,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:57,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:33:57,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:57,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:33:57,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:33:57,389 INFO L87 Difference]: Start difference. First operand 569 states and 898 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:59,396 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:01,410 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:01,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:34:01,633 INFO L93 Difference]: Finished difference Result 1319 states and 2043 transitions. [2022-07-13 11:34:01,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:34:01,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2022-07-13 11:34:01,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:34:01,636 INFO L225 Difference]: With dead ends: 1319 [2022-07-13 11:34:01,636 INFO L226 Difference]: Without dead ends: 760 [2022-07-13 11:34:01,637 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:01,637 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 112 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 40 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 288 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.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:34:01,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 288 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 203 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-13 11:34:01,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2022-07-13 11:34:01,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 569. [2022-07-13 11:34:01,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 568 states have (on average 1.5633802816901408) internal successors, (888), 568 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call 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:01,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 888 transitions. [2022-07-13 11:34:01,648 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 888 transitions. Word has length 89 [2022-07-13 11:34:01,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:34:01,648 INFO L495 AbstractCegarLoop]: Abstraction has 569 states and 888 transitions. [2022-07-13 11:34:01,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:34:01,648 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 888 transitions. [2022-07-13 11:34:01,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-13 11:34:01,649 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:34:01,649 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:34:01,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 11:34:01,650 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:34:01,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:34:01,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1477837842, now seen corresponding path program 1 times [2022-07-13 11:34:01,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:34:01,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167238034] [2022-07-13 11:34:01,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:34:01,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:34:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:01,799 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-13 11:34:01,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:34:01,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167238034] [2022-07-13 11:34:01,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167238034] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:34:01,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:34:01,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:34:01,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298510552] [2022-07-13 11:34:01,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:34:01,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:34:01,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:34:01,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:34:01,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:34:01,801 INFO L87 Difference]: Start difference. First operand 569 states and 888 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:34:03,816 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:04,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:34:04,144 INFO L93 Difference]: Finished difference Result 1320 states and 2024 transitions. [2022-07-13 11:34:04,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:34:04,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2022-07-13 11:34:04,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:34:04,147 INFO L225 Difference]: With dead ends: 1320 [2022-07-13 11:34:04,147 INFO L226 Difference]: Without dead ends: 761 [2022-07-13 11:34:04,148 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:04,149 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 119 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 270 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:34:04,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 270 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-13 11:34:04,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2022-07-13 11:34:04,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 569. [2022-07-13 11:34:04,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 568 states have (on average 1.545774647887324) internal successors, (878), 568 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call 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:04,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 878 transitions. [2022-07-13 11:34:04,161 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 878 transitions. Word has length 89 [2022-07-13 11:34:04,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:34:04,161 INFO L495 AbstractCegarLoop]: Abstraction has 569 states and 878 transitions. [2022-07-13 11:34:04,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:34:04,162 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 878 transitions. [2022-07-13 11:34:04,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-13 11:34:04,163 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:34:04,163 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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:34:04,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 11:34:04,163 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:34:04,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:34:04,164 INFO L85 PathProgramCache]: Analyzing trace with hash -859117231, now seen corresponding path program 1 times [2022-07-13 11:34:04,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:34:04,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533516159] [2022-07-13 11:34:04,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:34:04,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:34:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:04,310 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-13 11:34:04,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:34:04,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533516159] [2022-07-13 11:34:04,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533516159] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:34:04,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:34:04,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:34:04,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924064413] [2022-07-13 11:34:04,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:34:04,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:34:04,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:34:04,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:34:04,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:34:04,313 INFO L87 Difference]: Start difference. First operand 569 states and 878 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:34:06,322 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:08,336 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:08,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:34:08,577 INFO L93 Difference]: Finished difference Result 1045 states and 1596 transitions. [2022-07-13 11:34:08,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:34:08,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2022-07-13 11:34:08,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:34:08,579 INFO L225 Difference]: With dead ends: 1045 [2022-07-13 11:34:08,579 INFO L226 Difference]: Without dead ends: 685 [2022-07-13 11:34:08,580 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:08,580 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 92 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:34:08,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 544 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 223 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-13 11:34:08,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2022-07-13 11:34:08,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 569. [2022-07-13 11:34:08,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 568 states have (on average 1.5422535211267605) internal successors, (876), 568 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call 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:08,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 876 transitions. [2022-07-13 11:34:08,590 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 876 transitions. Word has length 89 [2022-07-13 11:34:08,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:34:08,590 INFO L495 AbstractCegarLoop]: Abstraction has 569 states and 876 transitions. [2022-07-13 11:34:08,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:34:08,591 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 876 transitions. [2022-07-13 11:34:08,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-13 11:34:08,592 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:34:08,592 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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:34:08,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 11:34:08,592 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:34:08,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:34:08,593 INFO L85 PathProgramCache]: Analyzing trace with hash -435470509, now seen corresponding path program 1 times [2022-07-13 11:34:08,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:34:08,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858030612] [2022-07-13 11:34:08,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:34:08,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:34:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:08,758 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-13 11:34:08,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:34:08,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858030612] [2022-07-13 11:34:08,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858030612] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:34:08,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:34:08,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:34:08,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707434823] [2022-07-13 11:34:08,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:34:08,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:34:08,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:34:08,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:34:08,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:34:08,760 INFO L87 Difference]: Start difference. First operand 569 states and 876 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:34:10,775 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:11,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:34:11,040 INFO L93 Difference]: Finished difference Result 1202 states and 1825 transitions. [2022-07-13 11:34:11,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:34:11,041 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2022-07-13 11:34:11,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:34:11,043 INFO L225 Difference]: With dead ends: 1202 [2022-07-13 11:34:11,043 INFO L226 Difference]: Without dead ends: 842 [2022-07-13 11:34:11,044 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:11,044 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 114 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 29 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 498 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.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:34:11,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 498 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 214 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-13 11:34:11,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2022-07-13 11:34:11,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 617. [2022-07-13 11:34:11,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 616 states have (on average 1.530844155844156) internal successors, (943), 616 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call 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:11,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 943 transitions. [2022-07-13 11:34:11,057 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 943 transitions. Word has length 89 [2022-07-13 11:34:11,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:34:11,057 INFO L495 AbstractCegarLoop]: Abstraction has 617 states and 943 transitions. [2022-07-13 11:34:11,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:34:11,057 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 943 transitions. [2022-07-13 11:34:11,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-13 11:34:11,058 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:34:11,058 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:34:11,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 11:34:11,059 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:34:11,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:34:11,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1165506567, now seen corresponding path program 1 times [2022-07-13 11:34:11,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:34:11,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490583518] [2022-07-13 11:34:11,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:34:11,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:34:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:11,220 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-13 11:34:11,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:34:11,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490583518] [2022-07-13 11:34:11,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490583518] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:34:11,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:34:11,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:34:11,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886885541] [2022-07-13 11:34:11,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:34:11,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:34:11,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:34:11,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:34:11,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:34:11,222 INFO L87 Difference]: Start difference. First operand 617 states and 943 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:34:13,235 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:13,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:34:13,469 INFO L93 Difference]: Finished difference Result 1416 states and 2134 transitions. [2022-07-13 11:34:13,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:34:13,470 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 90 [2022-07-13 11:34:13,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:34:13,472 INFO L225 Difference]: With dead ends: 1416 [2022-07-13 11:34:13,472 INFO L226 Difference]: Without dead ends: 809 [2022-07-13 11:34:13,473 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:13,473 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 117 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 40 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 292 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:34:13,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 292 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 210 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 11:34:13,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2022-07-13 11:34:13,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 617. [2022-07-13 11:34:13,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 616 states have (on average 1.5097402597402598) internal successors, (930), 616 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call 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:13,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 930 transitions. [2022-07-13 11:34:13,485 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 930 transitions. Word has length 90 [2022-07-13 11:34:13,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:34:13,485 INFO L495 AbstractCegarLoop]: Abstraction has 617 states and 930 transitions. [2022-07-13 11:34:13,485 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:34:13,486 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 930 transitions. [2022-07-13 11:34:13,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-13 11:34:13,487 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:34:13,487 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:34:13,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 11:34:13,487 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:34:13,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:34:13,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1304764074, now seen corresponding path program 1 times [2022-07-13 11:34:13,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:34:13,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781240341] [2022-07-13 11:34:13,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:34:13,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:34:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:13,643 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-13 11:34:13,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:34:13,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781240341] [2022-07-13 11:34:13,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781240341] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:34:13,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:34:13,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:34:13,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080751226] [2022-07-13 11:34:13,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:34:13,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:34:13,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:34:13,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:34:13,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:34:13,645 INFO L87 Difference]: Start difference. First operand 617 states and 930 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:34:15,659 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:15,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:34:15,893 INFO L93 Difference]: Finished difference Result 1226 states and 1832 transitions. [2022-07-13 11:34:15,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:34:15,894 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 90 [2022-07-13 11:34:15,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:34:15,896 INFO L225 Difference]: With dead ends: 1226 [2022-07-13 11:34:15,896 INFO L226 Difference]: Without dead ends: 834 [2022-07-13 11:34:15,897 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:15,898 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 109 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 28 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:34:15,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 492 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 210 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 11:34:15,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2022-07-13 11:34:15,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 620. [2022-07-13 11:34:15,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 619 states have (on average 1.495961227786753) internal successors, (926), 619 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call 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:15,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 926 transitions. [2022-07-13 11:34:15,910 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 926 transitions. Word has length 90 [2022-07-13 11:34:15,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:34:15,910 INFO L495 AbstractCegarLoop]: Abstraction has 620 states and 926 transitions. [2022-07-13 11:34:15,911 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:34:15,911 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 926 transitions. [2022-07-13 11:34:15,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-13 11:34:15,912 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:34:15,912 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:34:15,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 11:34:15,912 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:34:15,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:34:15,913 INFO L85 PathProgramCache]: Analyzing trace with hash -823645421, now seen corresponding path program 1 times [2022-07-13 11:34:15,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:34:15,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055750471] [2022-07-13 11:34:15,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:34:15,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:34:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:16,069 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-13 11:34:16,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:34:16,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055750471] [2022-07-13 11:34:16,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055750471] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:34:16,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:34:16,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:34:16,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471905051] [2022-07-13 11:34:16,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:34:16,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:34:16,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:34:16,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:34:16,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:34:16,071 INFO L87 Difference]: Start difference. First operand 620 states and 926 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:34:18,083 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:18,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:34:18,315 INFO L93 Difference]: Finished difference Result 1422 states and 2100 transitions. [2022-07-13 11:34:18,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:34:18,315 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 91 [2022-07-13 11:34:18,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:34:18,318 INFO L225 Difference]: With dead ends: 1422 [2022-07-13 11:34:18,318 INFO L226 Difference]: Without dead ends: 812 [2022-07-13 11:34:18,319 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:18,319 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 115 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 270 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:18,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 270 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:18,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2022-07-13 11:34:18,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 620. [2022-07-13 11:34:18,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 619 states have (on average 1.4749596122778674) internal successors, (913), 619 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call 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:18,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 913 transitions. [2022-07-13 11:34:18,334 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 913 transitions. Word has length 91 [2022-07-13 11:34:18,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:34:18,334 INFO L495 AbstractCegarLoop]: Abstraction has 620 states and 913 transitions. [2022-07-13 11:34:18,334 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:34:18,334 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 913 transitions. [2022-07-13 11:34:18,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-13 11:34:18,335 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:34:18,335 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:34:18,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 11:34:18,336 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:34:18,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:34:18,336 INFO L85 PathProgramCache]: Analyzing trace with hash -391297652, now seen corresponding path program 1 times [2022-07-13 11:34:18,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:34:18,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63584496] [2022-07-13 11:34:18,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:34:18,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:34:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:18,458 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-13 11:34:18,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:34:18,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63584496] [2022-07-13 11:34:18,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63584496] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:34:18,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:34:18,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:34:18,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392418733] [2022-07-13 11:34:18,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:34:18,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:34:18,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:34:18,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:34:18,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:34:18,461 INFO L87 Difference]: Start difference. First operand 620 states and 913 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:20,475 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:20,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:34:20,720 INFO L93 Difference]: Finished difference Result 1422 states and 2074 transitions. [2022-07-13 11:34:20,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:34:20,721 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:20,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:34:20,723 INFO L225 Difference]: With dead ends: 1422 [2022-07-13 11:34:20,723 INFO L226 Difference]: Without dead ends: 812 [2022-07-13 11:34:20,724 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:20,724 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 113 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 272 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:20,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 272 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:20,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2022-07-13 11:34:20,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 620. [2022-07-13 11:34:20,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 619 states have (on average 1.4539579967689822) internal successors, (900), 619 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call 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:20,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 900 transitions. [2022-07-13 11:34:20,739 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 900 transitions. Word has length 92 [2022-07-13 11:34:20,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:34:20,740 INFO L495 AbstractCegarLoop]: Abstraction has 620 states and 900 transitions. [2022-07-13 11:34:20,740 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:20,740 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 900 transitions. [2022-07-13 11:34:20,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-13 11:34:20,741 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:34:20,741 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:34:20,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 11:34:20,741 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:34:20,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:34:20,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1939969181, now seen corresponding path program 1 times [2022-07-13 11:34:20,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:34:20,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853302063] [2022-07-13 11:34:20,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:34:20,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:34:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:20,877 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-13 11:34:20,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:34:20,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853302063] [2022-07-13 11:34:20,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853302063] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:34:20,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:34:20,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:34:20,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326309263] [2022-07-13 11:34:20,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:34:20,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:34:20,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:34:20,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:34:20,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:34:20,880 INFO L87 Difference]: Start difference. First operand 620 states and 900 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:22,887 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:23,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:34:23,104 INFO L93 Difference]: Finished difference Result 1422 states and 2048 transitions. [2022-07-13 11:34:23,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:34:23,105 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:23,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:34:23,107 INFO L225 Difference]: With dead ends: 1422 [2022-07-13 11:34:23,107 INFO L226 Difference]: Without dead ends: 812 [2022-07-13 11:34:23,108 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:23,108 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 107 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 274 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:34:23,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 274 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 211 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 11:34:23,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2022-07-13 11:34:23,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 620. [2022-07-13 11:34:23,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 619 states have (on average 1.4410339256865912) internal successors, (892), 619 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:34:23,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 892 transitions. [2022-07-13 11:34:23,119 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 892 transitions. Word has length 92 [2022-07-13 11:34:23,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:34:23,120 INFO L495 AbstractCegarLoop]: Abstraction has 620 states and 892 transitions. [2022-07-13 11:34:23,120 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:23,120 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 892 transitions. [2022-07-13 11:34:23,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-13 11:34:23,121 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:34:23,121 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:34:23,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 11:34:23,121 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:34:23,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:34:23,122 INFO L85 PathProgramCache]: Analyzing trace with hash -109418661, now seen corresponding path program 1 times [2022-07-13 11:34:23,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:34:23,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388353005] [2022-07-13 11:34:23,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:34:23,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:34:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:23,270 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-13 11:34:23,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:34:23,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388353005] [2022-07-13 11:34:23,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388353005] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:34:23,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:34:23,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:34:23,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215597741] [2022-07-13 11:34:23,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:34:23,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:34:23,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:34:23,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:34:23,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:34:23,272 INFO L87 Difference]: Start difference. First operand 620 states and 892 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:34:25,283 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:25,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:34:25,326 INFO L93 Difference]: Finished difference Result 1231 states and 1778 transitions. [2022-07-13 11:34:25,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:34:25,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2022-07-13 11:34:25,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:34:25,328 INFO L225 Difference]: With dead ends: 1231 [2022-07-13 11:34:25,329 INFO L226 Difference]: Without dead ends: 839 [2022-07-13 11:34:25,329 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:25,330 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 122 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 474 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:34:25,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 474 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-07-13 11:34:25,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2022-07-13 11:34:25,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 839. [2022-07-13 11:34:25,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 838 states have (on average 1.437947494033413) internal successors, (1205), 838 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call 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:25,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1205 transitions. [2022-07-13 11:34:25,346 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1205 transitions. Word has length 92 [2022-07-13 11:34:25,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:34:25,347 INFO L495 AbstractCegarLoop]: Abstraction has 839 states and 1205 transitions. [2022-07-13 11:34:25,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:34:25,347 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1205 transitions. [2022-07-13 11:34:25,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-13 11:34:25,348 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:34:25,348 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:34:25,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-13 11:34:25,348 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:34:25,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:34:25,349 INFO L85 PathProgramCache]: Analyzing trace with hash 883897329, now seen corresponding path program 1 times [2022-07-13 11:34:25,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:34:25,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232716458] [2022-07-13 11:34:25,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:34:25,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:34:25,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:25,497 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-13 11:34:25,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:34:25,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232716458] [2022-07-13 11:34:25,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232716458] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:34:25,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:34:25,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:34:25,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790820326] [2022-07-13 11:34:25,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:34:25,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:34:25,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:34:25,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:34:25,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:34:25,500 INFO L87 Difference]: Start difference. First operand 839 states and 1205 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:34:27,505 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:27,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:34:27,565 INFO L93 Difference]: Finished difference Result 1644 states and 2368 transitions. [2022-07-13 11:34:27,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:34:27,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2022-07-13 11:34:27,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:34:27,568 INFO L225 Difference]: With dead ends: 1644 [2022-07-13 11:34:27,568 INFO L226 Difference]: Without dead ends: 1033 [2022-07-13 11:34:27,569 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:27,570 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 126 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 473 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:34:27,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 473 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-13 11:34:27,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2022-07-13 11:34:27,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 1033. [2022-07-13 11:34:27,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 1032 states have (on average 1.436046511627907) internal successors, (1482), 1032 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call 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:27,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1482 transitions. [2022-07-13 11:34:27,588 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1482 transitions. Word has length 94 [2022-07-13 11:34:27,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:34:27,589 INFO L495 AbstractCegarLoop]: Abstraction has 1033 states and 1482 transitions. [2022-07-13 11:34:27,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:34:27,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1482 transitions. [2022-07-13 11:34:27,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-13 11:34:27,591 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:34:27,591 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, 1] [2022-07-13 11:34:27,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 11:34:27,592 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:34:27,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:34:27,592 INFO L85 PathProgramCache]: Analyzing trace with hash -782701753, now seen corresponding path program 1 times [2022-07-13 11:34:27,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:34:27,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270903791] [2022-07-13 11:34:27,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:34:27,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:34:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:27,771 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-13 11:34:27,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:34:27,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270903791] [2022-07-13 11:34:27,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270903791] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:34:27,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:34:27,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:34:27,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51461992] [2022-07-13 11:34:27,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:34:27,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:34:27,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:34:27,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:34:27,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:34:27,773 INFO L87 Difference]: Start difference. First operand 1033 states and 1482 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:34:29,787 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:29,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:34:29,834 INFO L93 Difference]: Finished difference Result 1835 states and 2635 transitions. [2022-07-13 11:34:29,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:34:29,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2022-07-13 11:34:29,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:34:29,842 INFO L225 Difference]: With dead ends: 1835 [2022-07-13 11:34:29,842 INFO L226 Difference]: Without dead ends: 1030 [2022-07-13 11:34:29,844 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:29,846 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 128 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:34:29,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 469 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-07-13 11:34:29,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2022-07-13 11:34:29,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 1030. [2022-07-13 11:34:29,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 1029 states have (on average 1.4305150631681245) internal successors, (1472), 1029 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call 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:29,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1472 transitions. [2022-07-13 11:34:29,870 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1472 transitions. Word has length 113 [2022-07-13 11:34:29,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:34:29,871 INFO L495 AbstractCegarLoop]: Abstraction has 1030 states and 1472 transitions. [2022-07-13 11:34:29,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:34:29,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1472 transitions. [2022-07-13 11:34:29,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-13 11:34:29,872 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:34:29,872 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, 1, 1, 1] [2022-07-13 11:34:29,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-13 11:34:29,873 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:34:29,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:34:29,873 INFO L85 PathProgramCache]: Analyzing trace with hash -698320702, now seen corresponding path program 1 times [2022-07-13 11:34:29,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:34:29,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76133486] [2022-07-13 11:34:29,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:34:29,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:34:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:30,038 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-13 11:34:30,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:34:30,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76133486] [2022-07-13 11:34:30,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76133486] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:34:30,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:34:30,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:34:30,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820615525] [2022-07-13 11:34:30,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:34:30,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:34:30,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:34:30,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:34:30,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:34:30,040 INFO L87 Difference]: Start difference. First operand 1030 states and 1472 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:34:32,056 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:32,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:34:32,292 INFO L93 Difference]: Finished difference Result 2478 states and 3517 transitions. [2022-07-13 11:34:32,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:34:32,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2022-07-13 11:34:32,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:34:32,302 INFO L225 Difference]: With dead ends: 2478 [2022-07-13 11:34:32,302 INFO L226 Difference]: Without dead ends: 1458 [2022-07-13 11:34:32,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:34:32,304 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 94 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 40 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:34:32,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 275 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 204 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 11:34:32,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2022-07-13 11:34:32,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1056. [2022-07-13 11:34:32,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1056 states, 1055 states have (on average 1.4293838862559243) internal successors, (1508), 1055 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call 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:32,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1508 transitions. [2022-07-13 11:34:32,379 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1508 transitions. Word has length 115 [2022-07-13 11:34:32,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:34:32,379 INFO L495 AbstractCegarLoop]: Abstraction has 1056 states and 1508 transitions. [2022-07-13 11:34:32,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:34:32,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1508 transitions. [2022-07-13 11:34:32,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-13 11:34:32,381 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:34:32,381 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:34:32,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-13 11:34:32,381 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:34:32,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:34:32,382 INFO L85 PathProgramCache]: Analyzing trace with hash -272550210, now seen corresponding path program 1 times [2022-07-13 11:34:32,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:34:32,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056365645] [2022-07-13 11:34:32,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:34:32,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:34:33,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 11:34:33,451 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 11:34:33,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 11:34:33,675 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 11:34:33,675 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 11:34:33,676 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 11:34:33,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-13 11:34:33,683 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] [2022-07-13 11:34:33,686 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 11:34:33,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 11:34:33 BoogieIcfgContainer [2022-07-13 11:34:33,794 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 11:34:33,795 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 11:34:33,795 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 11:34:33,795 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 11:34:33,795 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:33:35" (3/4) ... [2022-07-13 11:34:33,797 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-13 11:34:33,797 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 11:34:33,798 INFO L158 Benchmark]: Toolchain (without parser) took 61608.87ms. Allocated memory was 98.6MB in the beginning and 178.3MB in the end (delta: 79.7MB). Free memory was 67.0MB in the beginning and 79.0MB in the end (delta: -12.0MB). Peak memory consumption was 67.0MB. Max. memory is 16.1GB. [2022-07-13 11:34:33,798 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 98.6MB. Free memory is still 55.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 11:34:33,799 INFO L158 Benchmark]: CACSL2BoogieTranslator took 486.88ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 66.7MB in the beginning and 75.6MB in the end (delta: -8.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 11:34:33,799 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.72ms. Allocated memory is still 119.5MB. Free memory was 75.6MB in the beginning and 70.5MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-13 11:34:33,799 INFO L158 Benchmark]: Boogie Preprocessor took 73.70ms. Allocated memory is still 119.5MB. Free memory was 70.5MB in the beginning and 92.2MB in the end (delta: -21.7MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2022-07-13 11:34:33,799 INFO L158 Benchmark]: RCFGBuilder took 2759.82ms. Allocated memory is still 119.5MB. Free memory was 92.2MB in the beginning and 69.3MB in the end (delta: 23.0MB). Peak memory consumption was 57.8MB. Max. memory is 16.1GB. [2022-07-13 11:34:33,801 INFO L158 Benchmark]: TraceAbstraction took 58199.01ms. Allocated memory was 119.5MB in the beginning and 178.3MB in the end (delta: 58.7MB). Free memory was 69.0MB in the beginning and 80.0MB in the end (delta: -11.1MB). Peak memory consumption was 97.3MB. Max. memory is 16.1GB. [2022-07-13 11:34:33,801 INFO L158 Benchmark]: Witness Printer took 2.68ms. Allocated memory is still 178.3MB. Free memory was 80.0MB in the beginning and 79.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 11:34:33,807 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.16ms. Allocated memory is still 98.6MB. Free memory is still 55.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 486.88ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 66.7MB in the beginning and 75.6MB in the end (delta: -8.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.72ms. Allocated memory is still 119.5MB. Free memory was 75.6MB in the beginning and 70.5MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.70ms. Allocated memory is still 119.5MB. Free memory was 70.5MB in the beginning and 92.2MB in the end (delta: -21.7MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * RCFGBuilder took 2759.82ms. Allocated memory is still 119.5MB. Free memory was 92.2MB in the beginning and 69.3MB in the end (delta: 23.0MB). Peak memory consumption was 57.8MB. Max. memory is 16.1GB. * TraceAbstraction took 58199.01ms. Allocated memory was 119.5MB in the beginning and 178.3MB in the end (delta: 58.7MB). Free memory was 69.0MB in the beginning and 80.0MB in the end (delta: -11.1MB). Peak memory consumption was 97.3MB. Max. memory is 16.1GB. * Witness Printer took 2.68ms. Allocated memory is still 178.3MB. Free memory was 80.0MB in the beginning and 79.0MB in the end (delta: 1.0MB). There was no memory consumed. 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: 1668]: 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 1353. 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 = (BUF_MEM *)__VERIFIER_nondet_ulong(); [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 ; [L1116] int tmp___4 ; [L1117] int tmp___5 ; [L1118] int tmp___6 ; [L1119] int tmp___7 ; [L1120] int tmp___8 ; [L1121] long tmp___9 ; [L1123] int blastFlag ; [L1126] blastFlag = 0 [L1127] s->hit=__VERIFIER_nondet_int () [L1128] s->state = 12292 [L1129] tmp = __VERIFIER_nondet_int() [L1130] cb = (void (*)())((void *)0) [L1131] ret = -1 [L1132] skip = 0 [L1133] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf={0:-5}, init=1, ret=-1, s={-8:0}, s={-8:0}, s->info_callback={0:1}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=0, tmp___2=0] [L1133] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1134] EXPR s->info_callback [L1134] cb = s->info_callback [L1142] EXPR s->in_handshake [L1142] s->in_handshake += 1 [L1143] COND FALSE !(tmp___1 & 12288) VAL [={0:1}, blastFlag=0, buf={0:-5}, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=0, tmp___2=0] [L1153] COND TRUE 1 VAL [={0:1}, blastFlag=0, buf={0:-5}, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=0, tmp___2=0] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:1}, blastFlag=0, buf={0:-5}, 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=0, tmp___2=0] [L1156] COND TRUE s->state == 12292 [L1259] s->new_session = 1 [L1260] s->state = 4096 [L1261] EXPR s->ctx [L1261] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1261] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1266] s->server = 0 VAL [={0:1}, blastFlag=0, buf={0:-5}, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0] [L1267] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={0:1}, blastFlag=0, buf={0:-5}, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0] [L1272] EXPR s->version VAL [={0:1}, blastFlag=0, buf={0:-5}, init=1, ret=-1, s={-8:0}, s={-8:0}, s->version=8, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0] [L1272] COND FALSE !((s->version & 65280) != 768) [L1278] s->type = 4096 [L1279] EXPR s->init_buf VAL [={0:1}, blastFlag=0, buf={0:-5}, 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=0, tmp___2=0] [L1279] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1291] tmp___4 = __VERIFIER_nondet_int() [L1292] COND FALSE !(! tmp___4) [L1298] tmp___5 = __VERIFIER_nondet_int() [L1299] COND FALSE !(! tmp___5) [L1305] s->state = 4368 [L1306] EXPR s->ctx [L1306] EXPR (s->ctx)->stats.sess_connect [L1306] (s->ctx)->stats.sess_connect += 1 [L1307] s->init_num = 0 VAL [={0:1}, blastFlag=0, buf={0:-5}, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message VAL [={0:1}, (s->s3)->tmp.reuse_message=4294967305, blastFlag=0, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 VAL [={0:1}, blastFlag=0, buf={0:-5}, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1153] COND TRUE 1 VAL [={0:1}, blastFlag=0, buf={0:-5}, init=1, ret=-1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:1}, blastFlag=0, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state VAL [={0:1}, blastFlag=0, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state VAL [={0:1}, blastFlag=0, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state VAL [={0:1}, blastFlag=0, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state VAL [={0:1}, blastFlag=0, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state VAL [={0:1}, blastFlag=0, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1171] COND TRUE s->state == 4368 [L1311] s->shutdown = 0 [L1312] ret = __VERIFIER_nondet_int() [L1313] COND TRUE blastFlag == 0 [L1314] blastFlag = 1 VAL [={0:1}, blastFlag=1, buf={0:-5}, init=1, ret=11, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1318] COND FALSE !(ret <= 0) [L1323] s->state = 4384 [L1324] s->init_num = 0 [L1325] EXPR s->bbio [L1325] EXPR s->wbio VAL [={0:1}, blastFlag=1, buf={0:-5}, init=1, ret=11, 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=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1325] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message VAL [={0:1}, (s->s3)->tmp.reuse_message=4294967305, blastFlag=1, buf={0:-5}, init=1, ret=11, s={-8:0}, s={-8:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 VAL [={0:1}, blastFlag=1, buf={0:-5}, init=1, ret=11, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1153] COND TRUE 1 VAL [={0:1}, blastFlag=1, buf={0:-5}, init=1, ret=11, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:-5}, init=1, ret=11, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:-5}, init=1, ret=11, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:-5}, init=1, ret=11, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:-5}, init=1, ret=11, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:-5}, init=1, ret=11, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:-5}, init=1, ret=11, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:-5}, init=1, ret=11, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:-5}, init=1, ret=11, s={-8:0}, s={-8:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1177] COND TRUE s->state == 4384 [L1333] ret = __VERIFIER_nondet_int() [L1334] COND TRUE blastFlag == 1 [L1335] blastFlag = 2 VAL [={0:1}, blastFlag=2, buf={0:-5}, init=1, ret=19, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1339] COND FALSE !(ret <= 0) [L1344] s->hit VAL [={0:1}, blastFlag=2, buf={0:-5}, init=1, ret=19, s={-8:0}, s={-8:0}, s->hit=0, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1344] COND FALSE !(s->hit) [L1347] s->state = 4400 VAL [={0:1}, blastFlag=2, buf={0:-5}, init=1, ret=19, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1349] s->init_num = 0 VAL [={0:1}, blastFlag=2, buf={0:-5}, init=1, ret=19, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message VAL [={0:1}, (s->s3)->tmp.reuse_message=4294967305, blastFlag=2, buf={0:-5}, init=1, ret=19, s={-8:0}, s={-8:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 VAL [={0:1}, blastFlag=2, buf={0:-5}, init=1, ret=19, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1153] COND TRUE 1 VAL [={0:1}, blastFlag=2, buf={0:-5}, init=1, ret=19, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-5}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-5}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-5}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-5}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-5}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-5}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-5}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-5}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1177] COND FALSE !(s->state == 4384) [L1180] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-5}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1180] COND FALSE !(s->state == 4385) [L1183] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:-5}, init=1, ret=19, s={-8:0}, s={-8:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1183] COND TRUE s->state == 4400 [L1353] EXPR s->s3 [L1353] EXPR (s->s3)->tmp.new_cipher [L1353] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:1}, ((s->s3)->tmp.new_cipher)->algorithms=4294967322, (s->s3)->tmp.new_cipher={-9:0}, blastFlag=2, buf={0:-5}, init=1, ret=19, s={-8:0}, s={-8:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1353] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1356] ret = __VERIFIER_nondet_int() [L1357] COND TRUE blastFlag == 2 [L1358] blastFlag = 3 VAL [={0:1}, blastFlag=3, buf={0:-5}, init=1, ret=22, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1362] COND FALSE !(ret <= 0) VAL [={0:1}, blastFlag=3, buf={0:-5}, init=1, ret=22, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1368] s->state = 4416 [L1369] s->init_num = 0 VAL [={0:1}, blastFlag=3, buf={0:-5}, init=1, ret=22, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message VAL [={0:1}, (s->s3)->tmp.reuse_message=4294967305, blastFlag=3, buf={0:-5}, init=1, ret=22, s={-8:0}, s={-8:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 VAL [={0:1}, blastFlag=3, buf={0:-5}, init=1, ret=22, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1153] COND TRUE 1 VAL [={0:1}, blastFlag=3, buf={0:-5}, init=1, ret=22, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:-5}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:-5}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:-5}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:-5}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:-5}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:-5}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:-5}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:-5}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1177] COND FALSE !(s->state == 4384) [L1180] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:-5}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1180] COND FALSE !(s->state == 4385) [L1183] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:-5}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1183] COND FALSE !(s->state == 4400) [L1186] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:-5}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1186] COND FALSE !(s->state == 4401) [L1189] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:-5}, init=1, ret=22, s={-8:0}, s={-8:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1189] COND TRUE s->state == 4416 [L1373] ret = __VERIFIER_nondet_int() [L1374] COND TRUE blastFlag == 3 [L1375] blastFlag = 4 VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1379] COND FALSE !(ret <= 0) [L1384] s->state = 4432 [L1385] s->init_num = 0 [L1386] tmp___6 = __VERIFIER_nondet_int() [L1387] COND FALSE !(! tmp___6) VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message VAL [={0:1}, (s->s3)->tmp.reuse_message=4294967305, blastFlag=4, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1153] COND TRUE 1 VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1177] COND FALSE !(s->state == 4384) [L1180] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1180] COND FALSE !(s->state == 4385) [L1183] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1183] COND FALSE !(s->state == 4400) [L1186] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1186] COND FALSE !(s->state == 4401) [L1189] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1189] COND FALSE !(s->state == 4416) [L1192] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1192] COND FALSE !(s->state == 4417) [L1195] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, 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=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1195] COND TRUE s->state == 4432 [L1396] ret = __VERIFIER_nondet_int() [L1397] COND FALSE !(blastFlag == 5) VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1402] COND FALSE !(ret <= 0) [L1407] s->state = 4448 [L1408] s->init_num = 0 VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message VAL [={0:1}, (s->s3)->tmp.reuse_message=4294967305, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, s->s3={-2:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1153] COND TRUE 1 VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1177] COND FALSE !(s->state == 4384) [L1180] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1180] COND FALSE !(s->state == 4385) [L1183] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1183] COND FALSE !(s->state == 4400) [L1186] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1186] COND FALSE !(s->state == 4401) [L1189] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1189] COND FALSE !(s->state == 4416) [L1192] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1192] COND FALSE !(s->state == 4417) [L1195] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1195] COND FALSE !(s->state == 4432) [L1198] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1198] COND FALSE !(s->state == 4433) [L1201] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=1, s={-8:0}, s={-8:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1201] COND TRUE s->state == 4448 [L1412] ret = __VERIFIER_nondet_int() [L1413] COND TRUE blastFlag == 4 VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=-14, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1668] reach_error() VAL [={0:1}, blastFlag=4, buf={0:-5}, init=1, ret=-14, s={-8:0}, s={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 131 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 58.1s, OverallIterations: 22, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 52.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 24 mSolverCounterUnknown, 2208 SdHoareTripleChecker+Valid, 51.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2208 mSDsluCounter, 8058 SdHoareTripleChecker+Invalid, 50.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4363 mSDsCounter, 527 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3312 IncrementalHoareTripleChecker+Invalid, 3863 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 527 mSolverCounterUnsat, 3695 mSDtfsCounter, 3312 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1056occurred in iteration=21, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 2614 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1757 NumberOfCodeBlocks, 1757 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1599 ConstructedInterpolants, 0 QuantifiedInterpolants, 3791 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 1350/1350 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:34:33,846 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.01.i.cil-2.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 781939b227b3ba0a20ad2d0323c2d13ae338349fb5c0bf292cccf74fd05cfb42 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:34:35,869 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:34:35,871 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:34:35,908 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:34:35,909 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:34:35,910 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:34:35,914 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:34:35,916 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:34:35,917 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:34:35,922 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:34:35,923 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:34:35,924 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:34:35,925 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:34:35,926 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:34:35,927 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:34:35,931 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:34:35,933 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:34:35,934 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:34:35,935 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:34:35,936 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:34:35,940 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:34:35,940 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:34:35,941 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:34:35,942 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:34:35,943 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:34:35,945 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:34:35,946 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:34:35,946 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:34:35,947 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:34:35,947 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:34:35,948 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:34:35,948 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:34:35,949 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:34:35,950 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:34:35,951 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:34:35,951 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:34:35,951 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:34:35,952 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:34:35,952 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:34:35,952 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:34:35,953 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:34:35,954 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:34:35,955 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:34:35,982 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:34:35,982 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:34:35,983 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:34:35,983 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:34:35,983 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:34:35,983 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:34:35,984 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:34:35,984 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:34:35,984 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:34:35,985 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:34:35,985 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:34:35,985 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:34:35,985 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:34:35,986 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:34:35,986 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:34:35,986 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:34:35,986 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 11:34:35,986 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 11:34:35,986 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 11:34:35,986 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:34:35,986 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:34:35,987 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:34:35,987 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:34:35,987 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:34:35,987 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:34:35,987 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:34:35,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:34:35,988 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:34:35,988 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:34:35,988 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:34:35,988 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 11:34:35,988 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 11:34:35,988 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:34:35,989 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:34:35,989 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:34:35,989 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 11:34:35,989 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 -> 781939b227b3ba0a20ad2d0323c2d13ae338349fb5c0bf292cccf74fd05cfb42 [2022-07-13 11:34:36,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:34:36,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:34:36,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:34:36,305 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:34:36,305 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:34:36,306 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_clnt.blast.01.i.cil-2.c [2022-07-13 11:34:36,343 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ac5478b3/21e0a244d90e41fb97c34b04d9bf3b48/FLAG667a21177 [2022-07-13 11:34:36,719 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:34:36,719 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_clnt.blast.01.i.cil-2.c [2022-07-13 11:34:36,734 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ac5478b3/21e0a244d90e41fb97c34b04d9bf3b48/FLAG667a21177 [2022-07-13 11:34:37,107 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ac5478b3/21e0a244d90e41fb97c34b04d9bf3b48 [2022-07-13 11:34:37,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:34:37,111 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:34:37,112 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:34:37,112 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:34:37,114 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:34:37,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:34:37" (1/1) ... [2022-07-13 11:34:37,116 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c206961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:34:37, skipping insertion in model container [2022-07-13 11:34:37,117 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:34:37" (1/1) ... [2022-07-13 11:34:37,121 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:34:37,172 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:34:37,590 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.01.i.cil-2.c[65520,65533] [2022-07-13 11:34:37,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:34:37,631 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-13 11:34:37,639 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:34:37,687 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.01.i.cil-2.c[65520,65533] [2022-07-13 11:34:37,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:34:37,694 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:34:37,743 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.01.i.cil-2.c[65520,65533] [2022-07-13 11:34:37,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:34:37,767 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:34:37,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:34:37 WrapperNode [2022-07-13 11:34:37,767 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:34:37,768 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:34:37,768 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:34:37,768 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:34:37,772 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:37" (1/1) ... [2022-07-13 11:34:37,787 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:37" (1/1) ... [2022-07-13 11:34:37,812 INFO L137 Inliner]: procedures = 35, calls = 217, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 694 [2022-07-13 11:34:37,813 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:34:37,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:34:37,814 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:34:37,814 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:34:37,819 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:37" (1/1) ... [2022-07-13 11:34:37,820 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:37" (1/1) ... [2022-07-13 11:34:37,825 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:37" (1/1) ... [2022-07-13 11:34:37,834 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:37" (1/1) ... [2022-07-13 11:34:37,865 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:37" (1/1) ... [2022-07-13 11:34:37,873 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:37" (1/1) ... [2022-07-13 11:34:37,883 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:37" (1/1) ... [2022-07-13 11:34:37,886 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:34:37,887 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:34:37,887 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:34:37,887 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:34:37,902 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:34:37" (1/1) ... [2022-07-13 11:34:37,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:34:37,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:34:37,928 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:37,945 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:37,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:34:37,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 11:34:37,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 11:34:37,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-13 11:34:37,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 11:34:37,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 11:34:37,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:34:37,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:34:37,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-13 11:34:38,063 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:34:38,064 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:34:38,074 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:34:43,831 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-07-13 11:34:43,831 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-07-13 11:34:43,831 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:34:43,836 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:34:43,836 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 11:34:43,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:34:43 BoogieIcfgContainer [2022-07-13 11:34:43,837 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:34:43,838 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:34:43,838 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:34:43,840 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:34:43,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:34:37" (1/3) ... [2022-07-13 11:34:43,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41a0f29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:34:43, skipping insertion in model container [2022-07-13 11:34:43,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:34:37" (2/3) ... [2022-07-13 11:34:43,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41a0f29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:34:43, skipping insertion in model container [2022-07-13 11:34:43,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:34:43" (3/3) ... [2022-07-13 11:34:43,842 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01.i.cil-2.c [2022-07-13 11:34:43,850 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:34:43,850 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:34:43,877 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:34:43,881 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@3563e74c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3ec41125 [2022-07-13 11:34:43,881 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:34:43,884 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 129 states have (on average 1.689922480620155) internal successors, (218), 130 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call 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:43,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-13 11:34:43,888 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:34:43,889 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:43,889 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:34:43,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:34:43,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1457703967, now seen corresponding path program 1 times [2022-07-13 11:34:43,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:34:43,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1132212624] [2022-07-13 11:34:43,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:34:43,909 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:34:43,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:34:43,911 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:34:43,912 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:34:44,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:44,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 11:34:44,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:34:44,734 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:44,735 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:34:44,735 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:34:44,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1132212624] [2022-07-13 11:34:44,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1132212624] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:34:44,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:34:44,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:34:44,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245153696] [2022-07-13 11:34:44,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:34:44,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:34:44,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:34:44,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:34:44,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:34:44,759 INFO L87 Difference]: Start difference. First operand has 131 states, 129 states have (on average 1.689922480620155) internal successors, (218), 130 states have internal predecessors, (218), 0 states have call successors, (0), 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:34:44,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:34:44,854 INFO L93 Difference]: Finished difference Result 375 states and 626 transitions. [2022-07-13 11:34:44,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:34:44,856 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:34:44,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:34:44,863 INFO L225 Difference]: With dead ends: 375 [2022-07-13 11:34:44,864 INFO L226 Difference]: Without dead ends: 217 [2022-07-13 11:34:44,866 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:34:44,868 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 181 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 402 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:34:44,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 402 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:34:44,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-07-13 11:34:44,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2022-07-13 11:34:44,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call 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,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 321 transitions. [2022-07-13 11:34:44,903 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 321 transitions. Word has length 24 [2022-07-13 11:34:44,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:34:44,903 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 321 transitions. [2022-07-13 11:34:44,904 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:34:44,904 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 321 transitions. [2022-07-13 11:34:44,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-13 11:34:44,905 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:34:44,905 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:34:44,925 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:34:45,119 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:34:45,119 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:34:45,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:34:45,120 INFO L85 PathProgramCache]: Analyzing trace with hash 546953675, now seen corresponding path program 1 times [2022-07-13 11:34:45,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:34:45,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [454609581] [2022-07-13 11:34:45,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:34:45,121 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:34:45,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:34:45,123 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:34:45,156 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:34:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:45,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 973 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 11:34:45,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:34:45,949 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:34:45,949 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:34:45,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:34:45,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [454609581] [2022-07-13 11:34:45,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [454609581] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:34:45,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:34:45,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:34:45,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278781454] [2022-07-13 11:34:45,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:34:45,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:34:45,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:34:45,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:34:45,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:34:45,952 INFO L87 Difference]: Start difference. First operand 217 states and 321 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:34:47,969 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:34:48,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:34:48,078 INFO L93 Difference]: Finished difference Result 426 states and 636 transitions. [2022-07-13 11:34:48,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:34:48,078 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:34:48,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:34:48,081 INFO L225 Difference]: With dead ends: 426 [2022-07-13 11:34:48,081 INFO L226 Difference]: Without dead ends: 319 [2022-07-13 11:34:48,081 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:34:48,082 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 126 mSDsluCounter, 158 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:34:48,082 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:34:48,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-07-13 11:34:48,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2022-07-13 11:34:48,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 318 states have (on average 1.4779874213836477) internal successors, (470), 318 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call 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:48,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 470 transitions. [2022-07-13 11:34:48,109 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 470 transitions. Word has length 39 [2022-07-13 11:34:48,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:34:48,109 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 470 transitions. [2022-07-13 11:34:48,109 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:34:48,109 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 470 transitions. [2022-07-13 11:34:48,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-13 11:34:48,111 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:34:48,111 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:34:48,132 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:34:48,319 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:34:48,321 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:34:48,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:34:48,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1711683715, now seen corresponding path program 1 times [2022-07-13 11:34:48,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:34:48,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [753262646] [2022-07-13 11:34:48,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:34:48,341 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:34:48,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:34:48,342 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:34:48,360 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:34:48,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:49,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 11:34:49,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:34:49,187 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:34:49,187 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:34:49,187 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:34:49,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [753262646] [2022-07-13 11:34:49,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [753262646] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:34:49,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:34:49,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:34:49,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6695485] [2022-07-13 11:34:49,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:34:49,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:34:49,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:34:49,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:34:49,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:34:49,188 INFO L87 Difference]: Start difference. First operand 319 states and 470 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:34:51,205 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:34:51,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:34:51,276 INFO L93 Difference]: Finished difference Result 632 states and 937 transitions. [2022-07-13 11:34:51,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:34:51,277 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:34:51,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:34:51,279 INFO L225 Difference]: With dead ends: 632 [2022-07-13 11:34:51,279 INFO L226 Difference]: Without dead ends: 423 [2022-07-13 11:34:51,279 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:34:51,280 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 128 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 474 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:34:51,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 474 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-13 11:34:51,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-07-13 11:34:51,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2022-07-13 11:34:51,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 422 states have (on average 1.4739336492890995) internal successors, (622), 422 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call 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:51,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 622 transitions. [2022-07-13 11:34:51,292 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 622 transitions. Word has length 57 [2022-07-13 11:34:51,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:34:51,293 INFO L495 AbstractCegarLoop]: Abstraction has 423 states and 622 transitions. [2022-07-13 11:34:51,293 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:34:51,293 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 622 transitions. [2022-07-13 11:34:51,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-13 11:34:51,295 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:34:51,295 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:34:51,328 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:34:51,515 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:34:51,515 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:34:51,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:34:51,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1922596163, now seen corresponding path program 1 times [2022-07-13 11:34:51,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:34:51,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [290066505] [2022-07-13 11:34:51,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:34:51,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:34:51,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:34:51,518 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:34:51,520 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:34:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:52,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 1109 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 11:34:52,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:34:52,384 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:34:52,384 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:34:52,384 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:34:52,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [290066505] [2022-07-13 11:34:52,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [290066505] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:34:52,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:34:52,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:34:52,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580948646] [2022-07-13 11:34:52,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:34:52,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:34:52,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:34:52,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:34:52,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:34:52,385 INFO L87 Difference]: Start difference. First operand 423 states and 622 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:34:54,403 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:34:54,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:34:54,476 INFO L93 Difference]: Finished difference Result 839 states and 1240 transitions. [2022-07-13 11:34:54,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:34:54,477 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:34:54,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:34:54,479 INFO L225 Difference]: With dead ends: 839 [2022-07-13 11:34:54,479 INFO L226 Difference]: Without dead ends: 526 [2022-07-13 11:34:54,480 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:34:54,481 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 128 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 473 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:34:54,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 473 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-13 11:34:54,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-07-13 11:34:54,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2022-07-13 11:34:54,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.4723809523809523) internal successors, (773), 525 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call 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,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 773 transitions. [2022-07-13 11:34:54,518 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 773 transitions. Word has length 77 [2022-07-13 11:34:54,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:34:54,518 INFO L495 AbstractCegarLoop]: Abstraction has 526 states and 773 transitions. [2022-07-13 11:34:54,519 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:34:54,519 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 773 transitions. [2022-07-13 11:34:54,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-13 11:34:54,522 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:34:54,522 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:34:54,544 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:34:54,744 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:34:54,745 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:34:54,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:34:54,745 INFO L85 PathProgramCache]: Analyzing trace with hash -158208422, now seen corresponding path program 1 times [2022-07-13 11:34:54,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:34:54,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1016952453] [2022-07-13 11:34:54,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:34:54,746 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:34:54,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:34:54,750 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:34:54,750 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:34:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:55,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 1180 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 11:34:55,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:34:55,716 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-13 11:34:55,716 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:34:55,716 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:34:55,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1016952453] [2022-07-13 11:34:55,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1016952453] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:34:55,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:34:55,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:34:55,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601085474] [2022-07-13 11:34:55,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:34:55,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:34:55,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:34:55,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:34:55,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:34:55,717 INFO L87 Difference]: Start difference. First operand 526 states and 773 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:34:57,735 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:34:57,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:34:57,802 INFO L93 Difference]: Finished difference Result 939 states and 1381 transitions. [2022-07-13 11:34:57,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:34:57,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2022-07-13 11:34:57,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:34:57,804 INFO L225 Difference]: With dead ends: 939 [2022-07-13 11:34:57,804 INFO L226 Difference]: Without dead ends: 523 [2022-07-13 11:34:57,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 96 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:57,805 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 128 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:34:57,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 469 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-13 11:34:57,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-07-13 11:34:57,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2022-07-13 11:34:57,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 522 states have (on average 1.4616858237547892) internal successors, (763), 522 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call 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:57,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 763 transitions. [2022-07-13 11:34:57,814 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 763 transitions. Word has length 98 [2022-07-13 11:34:57,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:34:57,815 INFO L495 AbstractCegarLoop]: Abstraction has 523 states and 763 transitions. [2022-07-13 11:34:57,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:34:57,815 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 763 transitions. [2022-07-13 11:34:57,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-13 11:34:57,816 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:34:57,816 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, 1, 1] [2022-07-13 11:34:57,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-13 11:34:58,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:34:58,032 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:34:58,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:34:58,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1855651051, now seen corresponding path program 1 times [2022-07-13 11:34:58,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:34:58,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [370041461] [2022-07-13 11:34:58,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:34:58,033 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:34:58,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:34:58,034 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:34:58,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-13 11:34:59,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:59,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 1184 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 11:34:59,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:35:00,879 INFO L356 Elim1Store]: treesize reduction 32, result has 78.5 percent of original size [2022-07-13 11:35:00,880 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:35:15,165 WARN L233 SmtUtils]: Spent 14.18s 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:35:15,166 INFO L356 Elim1Store]: treesize reduction 1374, result has 25.4 percent of original size [2022-07-13 11:35:15,167 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 4114 treesize of output 4792 [2022-07-13 11:35:15,233 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 4387 treesize of output 3109 [2022-07-13 11:35:15,361 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 4561 treesize of output 4027 [2022-07-13 11:35:16,882 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:35:16,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3791 treesize of output 3115 [2022-07-13 11:35:17,367 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 1375 treesize of output 1263 [2022-07-13 11:35:18,143 INFO L244 Elim1Store]: Index analysis took 420 ms [2022-07-13 11:35:19,042 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:35:19,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1229 treesize of output 1053 [2022-07-13 11:35:19,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:19,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:19,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:19,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:19,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:19,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:19,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:19,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:19,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:19,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:19,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:19,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:19,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:19,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:19,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:19,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:19,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:19,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:19,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:19,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:19,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:19,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:20,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:20,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:20,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:20,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:20,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:20,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:20,471 INFO L244 Elim1Store]: Index analysis took 768 ms [2022-07-13 11:35:21,734 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:35:22,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:22,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:22,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:22,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:22,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:22,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:22,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:22,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:22,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:22,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:22,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:22,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:22,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:22,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:22,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:22,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:22,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:22,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:22,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:22,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:22,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:22,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:22,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:22,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:22,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:22,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:22,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:22,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:23,529 INFO L244 Elim1Store]: Index analysis took 1104 ms [2022-07-13 11:35:24,578 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:35:25,115 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 137 treesize of output 113 [2022-07-13 11:35:26,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:26,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:26,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:26,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:26,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:26,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:26,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:26,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:26,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:26,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:26,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:26,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:26,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:26,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:26,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:26,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:26,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:26,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:26,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:26,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:26,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:26,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:26,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:26,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:27,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:27,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:27,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:27,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:35:27,409 INFO L244 Elim1Store]: Index analysis took 1512 ms [2022-07-13 11:35:28,030 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