./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26d01a9c 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/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.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 bec73cbd355af8995620266d1bb50e13212a1740ed8bd583620b6985b8fd569c --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 00:23:06,433 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 00:23:06,434 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 00:23:06,453 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 00:23:06,454 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 00:23:06,457 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 00:23:06,459 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 00:23:06,461 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 00:23:06,463 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 00:23:06,467 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 00:23:06,468 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 00:23:06,470 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 00:23:06,470 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 00:23:06,472 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 00:23:06,475 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 00:23:06,476 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 00:23:06,477 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 00:23:06,478 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 00:23:06,479 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 00:23:06,482 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 00:23:06,483 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 00:23:06,484 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 00:23:06,484 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 00:23:06,485 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 00:23:06,496 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 00:23:06,497 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 00:23:06,497 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 00:23:06,497 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 00:23:06,498 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 00:23:06,498 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 00:23:06,498 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 00:23:06,499 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 00:23:06,499 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 00:23:06,500 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 00:23:06,500 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 00:23:06,502 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 00:23:06,502 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 00:23:06,502 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 00:23:06,502 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 00:23:06,504 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 00:23:06,504 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 00:23:06,505 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 00:23:06,525 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 00:23:06,526 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 00:23:06,526 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 00:23:06,526 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 00:23:06,537 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 00:23:06,538 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 00:23:06,538 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 00:23:06,538 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 00:23:06,538 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 00:23:06,539 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 00:23:06,539 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 00:23:06,539 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 00:23:06,540 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 00:23:06,540 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 00:23:06,540 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 00:23:06,540 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 00:23:06,540 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 00:23:06,540 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 00:23:06,540 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 00:23:06,541 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 00:23:06,541 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 00:23:06,541 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 00:23:06,541 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 00:23:06,541 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 00:23:06,541 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 00:23:06,542 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 00:23:06,542 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 00:23:06,542 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 00:23:06,542 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 00:23:06,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 00:23:06,543 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 00:23:06,543 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 00:23:06,543 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 00:23:06,543 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 00:23:06,543 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 00:23:06,543 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> bec73cbd355af8995620266d1bb50e13212a1740ed8bd583620b6985b8fd569c [2023-02-17 00:23:06,719 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 00:23:06,737 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 00:23:06,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 00:23:06,740 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 00:23:06,740 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 00:23:06,741 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2023-02-17 00:23:07,677 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 00:23:07,833 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 00:23:07,834 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2023-02-17 00:23:07,839 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdc8ad299/cc5b2c57b54a4676846e0b20bc92508a/FLAG54a2b871c [2023-02-17 00:23:07,851 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdc8ad299/cc5b2c57b54a4676846e0b20bc92508a [2023-02-17 00:23:07,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 00:23:07,855 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 00:23:07,856 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 00:23:07,856 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 00:23:07,858 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 00:23:07,858 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 12:23:07" (1/1) ... [2023-02-17 00:23:07,860 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@727bcee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:23:07, skipping insertion in model container [2023-02-17 00:23:07,861 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 12:23:07" (1/1) ... [2023-02-17 00:23:07,865 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 00:23:07,879 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 00:23:07,991 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c[387,400] [2023-02-17 00:23:08,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 00:23:08,014 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 00:23:08,022 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c[387,400] [2023-02-17 00:23:08,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 00:23:08,043 INFO L208 MainTranslator]: Completed translation [2023-02-17 00:23:08,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:23:08 WrapperNode [2023-02-17 00:23:08,044 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 00:23:08,045 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 00:23:08,045 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 00:23:08,045 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 00:23:08,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:23:08" (1/1) ... [2023-02-17 00:23:08,055 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:23:08" (1/1) ... [2023-02-17 00:23:08,070 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 59 [2023-02-17 00:23:08,071 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 00:23:08,071 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 00:23:08,071 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 00:23:08,072 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 00:23:08,083 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:23:08" (1/1) ... [2023-02-17 00:23:08,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:23:08" (1/1) ... [2023-02-17 00:23:08,091 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:23:08" (1/1) ... [2023-02-17 00:23:08,091 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:23:08" (1/1) ... [2023-02-17 00:23:08,101 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:23:08" (1/1) ... [2023-02-17 00:23:08,103 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:23:08" (1/1) ... [2023-02-17 00:23:08,106 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:23:08" (1/1) ... [2023-02-17 00:23:08,107 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:23:08" (1/1) ... [2023-02-17 00:23:08,109 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 00:23:08,111 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 00:23:08,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 00:23:08,111 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 00:23:08,112 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:23:08" (1/1) ... [2023-02-17 00:23:08,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 00:23:08,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:23:08,133 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) [2023-02-17 00:23:08,137 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 [2023-02-17 00:23:08,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 00:23:08,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 00:23:08,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-17 00:23:08,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-17 00:23:08,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 00:23:08,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 00:23:08,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-17 00:23:08,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-17 00:23:08,224 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 00:23:08,225 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 00:23:08,382 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 00:23:08,386 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 00:23:08,386 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-17 00:23:08,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 12:23:08 BoogieIcfgContainer [2023-02-17 00:23:08,387 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 00:23:08,389 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 00:23:08,389 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 00:23:08,391 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 00:23:08,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 12:23:07" (1/3) ... [2023-02-17 00:23:08,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d39d5c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 12:23:08, skipping insertion in model container [2023-02-17 00:23:08,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:23:08" (2/3) ... [2023-02-17 00:23:08,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d39d5c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 12:23:08, skipping insertion in model container [2023-02-17 00:23:08,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 12:23:08" (3/3) ... [2023-02-17 00:23:08,407 INFO L112 eAbstractionObserver]: Analyzing ICFG verisec_sendmail_tTflag_arr_one_loop.c [2023-02-17 00:23:08,418 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 00:23:08,432 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 00:23:08,486 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 00:23:08,490 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@66f54a2d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 00:23:08,491 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 00:23:08,502 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:08,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-17 00:23:08,506 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:08,506 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:23:08,507 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:08,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:08,514 INFO L85 PathProgramCache]: Analyzing trace with hash 212076531, now seen corresponding path program 1 times [2023-02-17 00:23:08,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:23:08,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132053029] [2023-02-17 00:23:08,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:23:08,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:23:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:23:08,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:23:08,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:23:08,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132053029] [2023-02-17 00:23:08,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132053029] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:23:08,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:23:08,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 00:23:08,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903782251] [2023-02-17 00:23:08,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:23:08,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 00:23:08,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:23:08,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 00:23:08,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 00:23:08,734 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 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 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:08,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:08,776 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2023-02-17 00:23:08,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 00:23:08,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2023-02-17 00:23:08,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:08,782 INFO L225 Difference]: With dead ends: 35 [2023-02-17 00:23:08,783 INFO L226 Difference]: Without dead ends: 17 [2023-02-17 00:23:08,785 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 [2023-02-17 00:23:08,789 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:08,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 19 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:23:08,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-02-17 00:23:08,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 11. [2023-02-17 00:23:08,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:08,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2023-02-17 00:23:08,811 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2023-02-17 00:23:08,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:08,812 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2023-02-17 00:23:08,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:08,812 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2023-02-17 00:23:08,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-17 00:23:08,813 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:08,813 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:23:08,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 00:23:08,813 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:08,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:08,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1435974389, now seen corresponding path program 1 times [2023-02-17 00:23:08,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:23:08,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963896128] [2023-02-17 00:23:08,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:23:08,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:23:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:23:08,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:23:08,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:23:08,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963896128] [2023-02-17 00:23:08,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963896128] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 00:23:08,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438555102] [2023-02-17 00:23:08,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:23:08,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:23:08,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:23:08,917 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 00:23:08,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-17 00:23:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:23:08,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 00:23:08,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:23:09,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:23:09,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:23:09,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:23:09,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438555102] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:23:09,033 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 00:23:09,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-02-17 00:23:09,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56350136] [2023-02-17 00:23:09,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 00:23:09,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 00:23:09,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:23:09,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 00:23:09,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-02-17 00:23:09,037 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:09,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:09,076 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2023-02-17 00:23:09,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 00:23:09,079 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 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 10 [2023-02-17 00:23:09,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:09,080 INFO L225 Difference]: With dead ends: 33 [2023-02-17 00:23:09,080 INFO L226 Difference]: Without dead ends: 27 [2023-02-17 00:23:09,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-02-17 00:23:09,082 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 26 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:09,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 14 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:23:09,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-17 00:23:09,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2023-02-17 00:23:09,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:09,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2023-02-17 00:23:09,094 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 10 [2023-02-17 00:23:09,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:09,094 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2023-02-17 00:23:09,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:09,094 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2023-02-17 00:23:09,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-17 00:23:09,095 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:09,095 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:23:09,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-17 00:23:09,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:23:09,302 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:09,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:09,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1662320891, now seen corresponding path program 2 times [2023-02-17 00:23:09,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:23:09,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654371386] [2023-02-17 00:23:09,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:23:09,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:23:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:23:09,395 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-17 00:23:09,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:23:09,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654371386] [2023-02-17 00:23:09,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654371386] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:23:09,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:23:09,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 00:23:09,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530251042] [2023-02-17 00:23:09,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:23:09,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 00:23:09,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:23:09,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 00:23:09,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 00:23:09,401 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:09,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:09,420 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2023-02-17 00:23:09,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 00:23:09,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 16 [2023-02-17 00:23:09,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:09,421 INFO L225 Difference]: With dead ends: 22 [2023-02-17 00:23:09,421 INFO L226 Difference]: Without dead ends: 18 [2023-02-17 00:23:09,422 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 [2023-02-17 00:23:09,423 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 3 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:09,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 15 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:23:09,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-02-17 00:23:09,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-02-17 00:23:09,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:09,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2023-02-17 00:23:09,434 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2023-02-17 00:23:09,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:09,435 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2023-02-17 00:23:09,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:09,435 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2023-02-17 00:23:09,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-17 00:23:09,436 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:09,436 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:23:09,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-17 00:23:09,436 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:09,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:09,437 INFO L85 PathProgramCache]: Analyzing trace with hash -5994546, now seen corresponding path program 1 times [2023-02-17 00:23:09,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:23:09,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601498525] [2023-02-17 00:23:09,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:23:09,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:23:09,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:23:09,500 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 00:23:09,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:23:09,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601498525] [2023-02-17 00:23:09,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601498525] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 00:23:09,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909931098] [2023-02-17 00:23:09,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:23:09,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:23:09,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:23:09,502 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 00:23:09,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-17 00:23:09,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:23:09,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 00:23:09,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:23:09,563 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 00:23:09,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:23:09,604 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 00:23:09,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909931098] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:23:09,605 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 00:23:09,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-02-17 00:23:09,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237544652] [2023-02-17 00:23:09,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 00:23:09,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-17 00:23:09,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:23:09,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 00:23:09,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-02-17 00:23:09,610 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:09,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:09,643 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2023-02-17 00:23:09,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 00:23:09,643 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 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 17 [2023-02-17 00:23:09,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:09,643 INFO L225 Difference]: With dead ends: 42 [2023-02-17 00:23:09,644 INFO L226 Difference]: Without dead ends: 35 [2023-02-17 00:23:09,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-02-17 00:23:09,644 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 6 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:09,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 26 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:23:09,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-02-17 00:23:09,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2023-02-17 00:23:09,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:09,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2023-02-17 00:23:09,648 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 17 [2023-02-17 00:23:09,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:09,648 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2023-02-17 00:23:09,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:09,648 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2023-02-17 00:23:09,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-17 00:23:09,649 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:09,649 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:23:09,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-17 00:23:09,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-02-17 00:23:09,854 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:09,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:09,854 INFO L85 PathProgramCache]: Analyzing trace with hash 776585922, now seen corresponding path program 2 times [2023-02-17 00:23:09,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:23:09,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424087057] [2023-02-17 00:23:09,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:23:09,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:23:09,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:23:10,062 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 00:23:10,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:23:10,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424087057] [2023-02-17 00:23:10,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424087057] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 00:23:10,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888191669] [2023-02-17 00:23:10,063 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 00:23:10,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:23:10,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:23:10,073 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 00:23:10,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-17 00:23:10,124 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 00:23:10,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 00:23:10,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-17 00:23:10,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:23:10,179 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 00:23:10,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:23:10,232 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 00:23:10,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888191669] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:23:10,232 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 00:23:10,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 14 [2023-02-17 00:23:10,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291101701] [2023-02-17 00:23:10,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 00:23:10,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-17 00:23:10,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:23:10,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-17 00:23:10,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2023-02-17 00:23:10,234 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:10,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:10,274 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2023-02-17 00:23:10,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 00:23:10,274 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 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 29 [2023-02-17 00:23:10,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:10,275 INFO L225 Difference]: With dead ends: 44 [2023-02-17 00:23:10,275 INFO L226 Difference]: Without dead ends: 37 [2023-02-17 00:23:10,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 21 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2023-02-17 00:23:10,275 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 9 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:10,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 15 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:23:10,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-02-17 00:23:10,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2023-02-17 00:23:10,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:10,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2023-02-17 00:23:10,297 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 29 [2023-02-17 00:23:10,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:10,297 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2023-02-17 00:23:10,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:10,297 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2023-02-17 00:23:10,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-17 00:23:10,297 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:10,297 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:23:10,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-17 00:23:10,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:23:10,501 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:10,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:10,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1133517568, now seen corresponding path program 3 times [2023-02-17 00:23:10,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:23:10,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566429905] [2023-02-17 00:23:10,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:23:10,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:23:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:23:10,608 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2023-02-17 00:23:10,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:23:10,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566429905] [2023-02-17 00:23:10,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566429905] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 00:23:10,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296891273] [2023-02-17 00:23:10,609 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 00:23:10,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:23:10,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:23:10,610 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 00:23:10,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-17 00:23:10,665 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-02-17 00:23:10,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 00:23:10,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-17 00:23:10,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:23:10,832 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2023-02-17 00:23:10,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:23:10,948 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2023-02-17 00:23:10,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296891273] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:23:10,949 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 00:23:10,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2023-02-17 00:23:10,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120361912] [2023-02-17 00:23:10,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 00:23:10,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 00:23:10,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:23:10,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 00:23:10,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-17 00:23:10,952 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:11,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:11,017 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2023-02-17 00:23:11,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 00:23:11,018 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 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 31 [2023-02-17 00:23:11,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:11,018 INFO L225 Difference]: With dead ends: 40 [2023-02-17 00:23:11,019 INFO L226 Difference]: Without dead ends: 34 [2023-02-17 00:23:11,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-02-17 00:23:11,020 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 9 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:11,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 28 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:23:11,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-02-17 00:23:11,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-02-17 00:23:11,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:11,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2023-02-17 00:23:11,028 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 31 [2023-02-17 00:23:11,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:11,028 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2023-02-17 00:23:11,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:11,028 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2023-02-17 00:23:11,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-17 00:23:11,029 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:11,029 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:23:11,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-17 00:23:11,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:23:11,236 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:11,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:11,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1664602656, now seen corresponding path program 4 times [2023-02-17 00:23:11,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:23:11,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033463861] [2023-02-17 00:23:11,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:23:11,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:23:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:23:11,498 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2023-02-17 00:23:11,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:23:11,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033463861] [2023-02-17 00:23:11,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033463861] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 00:23:11,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101812247] [2023-02-17 00:23:11,498 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 00:23:11,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:23:11,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:23:11,500 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 00:23:11,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-17 00:23:11,732 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 00:23:11,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 00:23:11,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 81 conjunts are in the unsatisfiable core [2023-02-17 00:23:11,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:23:11,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-17 00:23:11,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:23:11,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-02-17 00:23:11,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:23:11,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-02-17 00:23:11,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:23:11,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-02-17 00:23:11,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:23:11,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-02-17 00:23:11,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:23:11,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-02-17 00:23:11,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:23:11,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-02-17 00:23:11,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:23:11,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-02-17 00:23:11,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:23:11,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-02-17 00:23:11,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:23:11,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-02-17 00:23:11,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-02-17 00:23:11,932 INFO L350 Elim1Store]: Elim1 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 28 treesize of output 10 [2023-02-17 00:23:13,201 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:23:13,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:23:13,391 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2023-02-17 00:23:13,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-17 00:23:13,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:23:13,597 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Possible infinite loop detected |aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~c~0#1_38_49_60| already exists at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.tryToHandleDivModSubterm(SolveForSubjectUtils.java:199) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.findTreatableDivModSubterm(SolveForSubjectUtils.java:594) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.findTreatableDivModSubterm(SolveForSubjectUtils.java:582) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.findTreatableDivModSubterm(SolveForSubjectUtils.java:582) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.solveForSubject(SolveForSubjectUtils.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.PolynomialRelation.solveForSubject(PolynomialRelation.java:514) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:423) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer$IDerHelper.findBestReplacementSbr(DualJunctionDer.java:312) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer$IDerHelper.tryToEliminateSbr(DualJunctionDer.java:328) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryToEliminateOne(DualJunctionDer.java:235) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryExhaustivelyToEliminate(DualJunctionDer.java:202) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryToEliminateOne(DualJunctionDer.java:186) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryExhaustivelyToEliminate(DualJunctionDer.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryToEliminate(DualJunctionDer.java:131) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:627) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:606) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:528) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:332) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-02-17 00:23:13,601 INFO L158 Benchmark]: Toolchain (without parser) took 5746.38ms. Allocated memory was 113.2MB in the beginning and 184.5MB in the end (delta: 71.3MB). Free memory was 63.8MB in the beginning and 128.8MB in the end (delta: -65.0MB). Peak memory consumption was 67.9MB. Max. memory is 16.1GB. [2023-02-17 00:23:13,601 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 113.2MB. Free memory is still 82.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 00:23:13,601 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.89ms. Allocated memory is still 113.2MB. Free memory was 63.8MB in the beginning and 53.5MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 00:23:13,602 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.71ms. Allocated memory is still 113.2MB. Free memory was 53.5MB in the beginning and 51.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 00:23:13,602 INFO L158 Benchmark]: Boogie Preprocessor took 38.30ms. Allocated memory is still 113.2MB. Free memory was 51.9MB in the beginning and 50.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 00:23:13,602 INFO L158 Benchmark]: RCFGBuilder took 276.63ms. Allocated memory was 113.2MB in the beginning and 153.1MB in the end (delta: 39.8MB). Free memory was 50.8MB in the beginning and 123.1MB in the end (delta: -72.3MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2023-02-17 00:23:13,602 INFO L158 Benchmark]: TraceAbstraction took 5211.68ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 122.6MB in the beginning and 128.8MB in the end (delta: -6.2MB). Peak memory consumption was 85.9MB. Max. memory is 16.1GB. [2023-02-17 00:23:13,603 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.14ms. Allocated memory is still 113.2MB. Free memory is still 82.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 188.89ms. Allocated memory is still 113.2MB. Free memory was 63.8MB in the beginning and 53.5MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.71ms. Allocated memory is still 113.2MB. Free memory was 53.5MB in the beginning and 51.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.30ms. Allocated memory is still 113.2MB. Free memory was 51.9MB in the beginning and 50.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 276.63ms. Allocated memory was 113.2MB in the beginning and 153.1MB in the end (delta: 39.8MB). Free memory was 50.8MB in the beginning and 123.1MB in the end (delta: -72.3MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5211.68ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 122.6MB in the beginning and 128.8MB in the end (delta: -6.2MB). Peak memory consumption was 85.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Possible infinite loop detected |aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~c~0#1_38_49_60| already exists de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Possible infinite loop detected |aux_div_aux_mod_aux_mod_ULTIMATE.start_main_~c~0#1_38_49_60| already exists: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.tryToHandleDivModSubterm(SolveForSubjectUtils.java:199) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-02-17 00:23:13,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.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 bec73cbd355af8995620266d1bb50e13212a1740ed8bd583620b6985b8fd569c --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 00:23:15,284 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 00:23:15,285 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 00:23:15,304 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 00:23:15,305 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 00:23:15,305 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 00:23:15,306 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 00:23:15,307 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 00:23:15,308 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 00:23:15,309 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 00:23:15,309 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 00:23:15,310 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 00:23:15,310 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 00:23:15,311 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 00:23:15,312 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 00:23:15,313 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 00:23:15,313 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 00:23:15,314 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 00:23:15,315 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 00:23:15,316 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 00:23:15,317 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 00:23:15,318 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 00:23:15,319 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 00:23:15,319 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 00:23:15,322 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 00:23:15,322 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 00:23:15,322 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 00:23:15,323 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 00:23:15,323 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 00:23:15,324 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 00:23:15,324 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 00:23:15,325 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 00:23:15,325 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 00:23:15,325 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 00:23:15,326 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 00:23:15,326 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 00:23:15,327 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 00:23:15,327 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 00:23:15,327 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 00:23:15,328 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 00:23:15,328 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 00:23:15,329 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-02-17 00:23:15,367 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 00:23:15,367 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 00:23:15,368 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 00:23:15,368 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 00:23:15,368 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 00:23:15,368 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 00:23:15,369 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 00:23:15,369 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 00:23:15,369 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 00:23:15,369 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 00:23:15,369 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 00:23:15,369 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 00:23:15,370 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 00:23:15,370 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 00:23:15,370 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 00:23:15,370 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 00:23:15,370 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 00:23:15,370 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-17 00:23:15,370 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-17 00:23:15,370 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 00:23:15,370 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 00:23:15,371 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 00:23:15,371 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 00:23:15,371 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 00:23:15,371 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 00:23:15,371 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 00:23:15,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 00:23:15,371 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 00:23:15,372 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 00:23:15,372 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 00:23:15,372 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-17 00:23:15,372 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-17 00:23:15,372 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 00:23:15,372 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 00:23:15,372 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 00:23:15,372 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 00:23:15,373 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-17 00:23:15,373 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 00:23:15,373 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> bec73cbd355af8995620266d1bb50e13212a1740ed8bd583620b6985b8fd569c [2023-02-17 00:23:15,627 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 00:23:15,640 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 00:23:15,642 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 00:23:15,643 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 00:23:15,644 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 00:23:15,644 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2023-02-17 00:23:16,580 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 00:23:16,746 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 00:23:16,747 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2023-02-17 00:23:16,751 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2858513b6/6655687478ae43698275e7e63495bf11/FLAG35ac88043 [2023-02-17 00:23:16,762 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2858513b6/6655687478ae43698275e7e63495bf11 [2023-02-17 00:23:16,765 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 00:23:16,766 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 00:23:16,770 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 00:23:16,770 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 00:23:16,772 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 00:23:16,772 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 12:23:16" (1/1) ... [2023-02-17 00:23:16,773 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aec7ff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:23:16, skipping insertion in model container [2023-02-17 00:23:16,773 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 12:23:16" (1/1) ... [2023-02-17 00:23:16,778 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 00:23:16,790 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 00:23:16,906 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c[387,400] [2023-02-17 00:23:16,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 00:23:16,927 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 00:23:16,936 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c[387,400] [2023-02-17 00:23:16,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 00:23:16,955 INFO L208 MainTranslator]: Completed translation [2023-02-17 00:23:16,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:23:16 WrapperNode [2023-02-17 00:23:16,956 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 00:23:16,957 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 00:23:16,957 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 00:23:16,957 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 00:23:16,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:23:16" (1/1) ... [2023-02-17 00:23:16,967 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:23:16" (1/1) ... [2023-02-17 00:23:16,982 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2023-02-17 00:23:16,982 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 00:23:16,983 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 00:23:16,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 00:23:16,984 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 00:23:16,989 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:23:16" (1/1) ... [2023-02-17 00:23:16,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:23:16" (1/1) ... [2023-02-17 00:23:16,999 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:23:16" (1/1) ... [2023-02-17 00:23:16,999 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:23:16" (1/1) ... [2023-02-17 00:23:17,009 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:23:16" (1/1) ... [2023-02-17 00:23:17,011 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:23:16" (1/1) ... [2023-02-17 00:23:17,012 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:23:16" (1/1) ... [2023-02-17 00:23:17,013 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:23:16" (1/1) ... [2023-02-17 00:23:17,014 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 00:23:17,015 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 00:23:17,015 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 00:23:17,015 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 00:23:17,015 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:23:16" (1/1) ... [2023-02-17 00:23:17,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 00:23:17,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:23:17,037 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) [2023-02-17 00:23:17,056 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 [2023-02-17 00:23:17,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 00:23:17,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-02-17 00:23:17,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-17 00:23:17,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-17 00:23:17,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 00:23:17,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 00:23:17,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-02-17 00:23:17,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-17 00:23:17,135 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 00:23:17,137 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 00:23:17,259 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 00:23:17,263 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 00:23:17,264 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-17 00:23:17,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 12:23:17 BoogieIcfgContainer [2023-02-17 00:23:17,265 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 00:23:17,266 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 00:23:17,267 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 00:23:17,268 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 00:23:17,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 12:23:16" (1/3) ... [2023-02-17 00:23:17,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@337589f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 12:23:17, skipping insertion in model container [2023-02-17 00:23:17,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:23:16" (2/3) ... [2023-02-17 00:23:17,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@337589f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 12:23:17, skipping insertion in model container [2023-02-17 00:23:17,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 12:23:17" (3/3) ... [2023-02-17 00:23:17,271 INFO L112 eAbstractionObserver]: Analyzing ICFG verisec_sendmail_tTflag_arr_one_loop.c [2023-02-17 00:23:17,282 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 00:23:17,283 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 00:23:17,320 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 00:23:17,325 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@fe28910, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 00:23:17,325 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 00:23:17,327 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:17,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-17 00:23:17,332 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:17,333 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:23:17,333 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:17,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:17,338 INFO L85 PathProgramCache]: Analyzing trace with hash 212076531, now seen corresponding path program 1 times [2023-02-17 00:23:17,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 00:23:17,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1944785614] [2023-02-17 00:23:17,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:23:17,347 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 00:23:17,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 00:23:17,350 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 00:23:17,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-17 00:23:17,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:23:17,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-17 00:23:17,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:23:17,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:23:17,466 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 00:23:17,466 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 00:23:17,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1944785614] [2023-02-17 00:23:17,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1944785614] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:23:17,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:23:17,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 00:23:17,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14667674] [2023-02-17 00:23:17,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:23:17,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 00:23:17,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 00:23:17,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 00:23:17,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 00:23:17,493 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 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 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:17,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:17,533 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2023-02-17 00:23:17,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 00:23:17,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2023-02-17 00:23:17,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:17,543 INFO L225 Difference]: With dead ends: 35 [2023-02-17 00:23:17,543 INFO L226 Difference]: Without dead ends: 17 [2023-02-17 00:23:17,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 00:23:17,547 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:17,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 19 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:23:17,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-02-17 00:23:17,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 11. [2023-02-17 00:23:17,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:17,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2023-02-17 00:23:17,565 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2023-02-17 00:23:17,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:17,565 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2023-02-17 00:23:17,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:17,565 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2023-02-17 00:23:17,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-17 00:23:17,566 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:17,566 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:23:17,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-17 00:23:17,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 00:23:17,772 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:17,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:17,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1435974389, now seen corresponding path program 1 times [2023-02-17 00:23:17,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 00:23:17,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [207920224] [2023-02-17 00:23:17,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:23:17,774 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 00:23:17,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 00:23:17,775 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 00:23:17,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-17 00:23:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:23:17,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 00:23:17,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:23:17,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:23:17,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:23:17,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:23:17,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 00:23:17,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [207920224] [2023-02-17 00:23:17,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [207920224] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:23:17,904 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 00:23:17,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-02-17 00:23:17,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058701426] [2023-02-17 00:23:17,905 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 00:23:17,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 00:23:17,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 00:23:17,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 00:23:17,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-17 00:23:17,906 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:17,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:17,969 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2023-02-17 00:23:17,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 00:23:17,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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 10 [2023-02-17 00:23:17,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:17,970 INFO L225 Difference]: With dead ends: 33 [2023-02-17 00:23:17,971 INFO L226 Difference]: Without dead ends: 27 [2023-02-17 00:23:17,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-02-17 00:23:17,972 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 19 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:17,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 22 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 00:23:17,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-17 00:23:17,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2023-02-17 00:23:17,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:17,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2023-02-17 00:23:17,976 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 10 [2023-02-17 00:23:17,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:17,976 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2023-02-17 00:23:17,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:17,976 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2023-02-17 00:23:17,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-17 00:23:17,977 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:17,977 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:23:17,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-17 00:23:18,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 00:23:18,179 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:18,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:18,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1662320891, now seen corresponding path program 2 times [2023-02-17 00:23:18,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 00:23:18,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [918065268] [2023-02-17 00:23:18,180 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 00:23:18,180 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 00:23:18,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 00:23:18,181 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 00:23:18,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-17 00:23:18,211 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-17 00:23:18,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 00:23:18,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 00:23:18,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:23:18,222 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-17 00:23:18,222 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 00:23:18,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 00:23:18,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [918065268] [2023-02-17 00:23:18,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [918065268] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:23:18,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:23:18,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 00:23:18,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146296975] [2023-02-17 00:23:18,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:23:18,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 00:23:18,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 00:23:18,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 00:23:18,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 00:23:18,225 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:18,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:18,242 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2023-02-17 00:23:18,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 00:23:18,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 16 [2023-02-17 00:23:18,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:18,243 INFO L225 Difference]: With dead ends: 22 [2023-02-17 00:23:18,243 INFO L226 Difference]: Without dead ends: 18 [2023-02-17 00:23:18,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 00:23:18,244 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:18,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 17 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:23:18,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-02-17 00:23:18,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-02-17 00:23:18,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:18,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2023-02-17 00:23:18,248 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2023-02-17 00:23:18,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:18,248 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2023-02-17 00:23:18,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:18,249 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2023-02-17 00:23:18,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-17 00:23:18,249 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:18,249 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:23:18,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-17 00:23:18,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 00:23:18,456 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:18,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:18,456 INFO L85 PathProgramCache]: Analyzing trace with hash -5994546, now seen corresponding path program 1 times [2023-02-17 00:23:18,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 00:23:18,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1340090667] [2023-02-17 00:23:18,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:23:18,457 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 00:23:18,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 00:23:18,458 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 00:23:18,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-17 00:23:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:23:18,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 00:23:18,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:23:18,523 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 00:23:18,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:23:18,582 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 00:23:18,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 00:23:18,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1340090667] [2023-02-17 00:23:18,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1340090667] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:23:18,583 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 00:23:18,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-02-17 00:23:18,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035917868] [2023-02-17 00:23:18,584 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 00:23:18,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 00:23:18,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 00:23:18,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 00:23:18,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-02-17 00:23:18,585 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:18,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:18,734 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2023-02-17 00:23:18,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 00:23:18,735 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 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 17 [2023-02-17 00:23:18,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:18,735 INFO L225 Difference]: With dead ends: 42 [2023-02-17 00:23:18,735 INFO L226 Difference]: Without dead ends: 35 [2023-02-17 00:23:18,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2023-02-17 00:23:18,736 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 14 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:18,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 31 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 00:23:18,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-02-17 00:23:18,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2023-02-17 00:23:18,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:18,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2023-02-17 00:23:18,741 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 17 [2023-02-17 00:23:18,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:18,741 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2023-02-17 00:23:18,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:18,741 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2023-02-17 00:23:18,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-17 00:23:18,742 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:18,742 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:23:18,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-17 00:23:18,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 00:23:18,945 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:18,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:18,946 INFO L85 PathProgramCache]: Analyzing trace with hash 776585922, now seen corresponding path program 2 times [2023-02-17 00:23:18,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 00:23:18,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [624487259] [2023-02-17 00:23:18,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 00:23:18,946 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 00:23:18,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 00:23:18,948 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 00:23:18,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-17 00:23:18,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 00:23:18,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 00:23:18,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-17 00:23:19,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:23:19,097 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 00:23:19,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:23:19,306 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 00:23:19,306 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 00:23:19,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [624487259] [2023-02-17 00:23:19,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [624487259] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:23:19,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 00:23:19,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2023-02-17 00:23:19,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687161109] [2023-02-17 00:23:19,307 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 00:23:19,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-17 00:23:19,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 00:23:19,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-17 00:23:19,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2023-02-17 00:23:19,308 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 24 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:19,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:19,542 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2023-02-17 00:23:19,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-17 00:23:19,543 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-02-17 00:23:19,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:19,544 INFO L225 Difference]: With dead ends: 45 [2023-02-17 00:23:19,544 INFO L226 Difference]: Without dead ends: 38 [2023-02-17 00:23:19,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2023-02-17 00:23:19,545 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 9 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:19,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 74 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 00:23:19,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-17 00:23:19,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2023-02-17 00:23:19,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:19,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2023-02-17 00:23:19,549 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 29 [2023-02-17 00:23:19,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:19,549 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2023-02-17 00:23:19,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:19,549 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2023-02-17 00:23:19,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-17 00:23:19,550 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:19,550 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:23:19,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-17 00:23:19,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 00:23:19,757 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:19,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:19,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1133517568, now seen corresponding path program 3 times [2023-02-17 00:23:19,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 00:23:19,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [597618937] [2023-02-17 00:23:19,758 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 00:23:19,758 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 00:23:19,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 00:23:19,759 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 00:23:19,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-17 00:23:19,800 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-02-17 00:23:19,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 00:23:19,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 00:23:19,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:23:19,844 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2023-02-17 00:23:19,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:23:19,877 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2023-02-17 00:23:19,877 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 00:23:19,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [597618937] [2023-02-17 00:23:19,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [597618937] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:23:19,878 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 00:23:19,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-02-17 00:23:19,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972226656] [2023-02-17 00:23:19,879 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 00:23:19,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 00:23:19,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 00:23:19,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 00:23:19,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-17 00:23:19,881 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:20,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:20,074 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2023-02-17 00:23:20,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 00:23:20,075 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 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 31 [2023-02-17 00:23:20,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:20,075 INFO L225 Difference]: With dead ends: 43 [2023-02-17 00:23:20,075 INFO L226 Difference]: Without dead ends: 35 [2023-02-17 00:23:20,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2023-02-17 00:23:20,076 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 10 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:20,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 24 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 00:23:20,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-02-17 00:23:20,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-02-17 00:23:20,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:20,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2023-02-17 00:23:20,081 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 31 [2023-02-17 00:23:20,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:20,081 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2023-02-17 00:23:20,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:20,082 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2023-02-17 00:23:20,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-17 00:23:20,082 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:20,082 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:23:20,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-17 00:23:20,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 00:23:20,283 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:20,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:20,283 INFO L85 PathProgramCache]: Analyzing trace with hash 64740169, now seen corresponding path program 4 times [2023-02-17 00:23:20,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 00:23:20,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1141366083] [2023-02-17 00:23:20,284 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 00:23:20,284 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 00:23:20,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 00:23:20,285 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 00:23:20,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-17 00:23:20,342 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 00:23:20,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 00:23:20,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-17 00:23:20,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:23:23,323 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2023-02-17 00:23:23,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:23:25,207 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2023-02-17 00:23:25,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 00:23:25,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1141366083] [2023-02-17 00:23:25,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1141366083] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:23:25,207 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 00:23:25,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-02-17 00:23:25,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158895981] [2023-02-17 00:23:25,208 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 00:23:25,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-17 00:23:25,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 00:23:25,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-17 00:23:25,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=122, Unknown=1, NotChecked=0, Total=182 [2023-02-17 00:23:25,209 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:26,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-02-17 00:23:28,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-02-17 00:23:33,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:23:33,775 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2023-02-17 00:23:33,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-17 00:23:33,776 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 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 34 [2023-02-17 00:23:33,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:23:33,776 INFO L225 Difference]: With dead ends: 49 [2023-02-17 00:23:33,776 INFO L226 Difference]: Without dead ends: 39 [2023-02-17 00:23:33,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=130, Invalid=288, Unknown=2, NotChecked=0, Total=420 [2023-02-17 00:23:33,777 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 24 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 14 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-02-17 00:23:33,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 44 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 39 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2023-02-17 00:23:33,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-02-17 00:23:33,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-02-17 00:23:33,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:33,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2023-02-17 00:23:33,784 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 34 [2023-02-17 00:23:33,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:23:33,784 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2023-02-17 00:23:33,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:23:33,785 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2023-02-17 00:23:33,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-17 00:23:33,785 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:23:33,785 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:23:33,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-17 00:23:33,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 00:23:33,989 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:23:33,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:23:33,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1606508279, now seen corresponding path program 5 times [2023-02-17 00:23:33,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 00:23:33,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [748003056] [2023-02-17 00:23:33,990 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-17 00:23:33,990 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 00:23:33,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 00:23:33,991 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 00:23:33,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-17 00:23:34,104 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2023-02-17 00:23:34,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 00:23:34,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-17 00:23:34,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:24:10,644 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2023-02-17 00:24:10,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:24:29,475 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2023-02-17 00:24:29,476 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 00:24:29,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [748003056] [2023-02-17 00:24:29,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [748003056] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:24:29,476 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 00:24:29,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2023-02-17 00:24:29,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148490528] [2023-02-17 00:24:29,476 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 00:24:29,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-17 00:24:29,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 00:24:29,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-17 00:24:29,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=331, Unknown=17, NotChecked=0, Total=462 [2023-02-17 00:24:29,478 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:24:38,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-02-17 00:24:40,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-02-17 00:24:42,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-02-17 00:24:44,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-02-17 00:24:46,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-02-17 00:24:48,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-02-17 00:24:51,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-02-17 00:24:53,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-02-17 00:24:58,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-02-17 00:26:07,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:26:07,038 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2023-02-17 00:26:07,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-17 00:26:07,039 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-02-17 00:26:07,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:26:07,039 INFO L225 Difference]: With dead ends: 47 [2023-02-17 00:26:07,039 INFO L226 Difference]: Without dead ends: 41 [2023-02-17 00:26:07,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 123.8s TimeCoverageRelationStatistics Valid=261, Invalid=714, Unknown=17, NotChecked=0, Total=992 [2023-02-17 00:26:07,044 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 14 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 12 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.7s IncrementalHoareTripleChecker+Time [2023-02-17 00:26:07,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 65 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 81 Invalid, 8 Unknown, 0 Unchecked, 28.7s Time] [2023-02-17 00:26:07,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-02-17 00:26:07,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-02-17 00:26:07,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.05) internal successors, (42), 40 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:26:07,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2023-02-17 00:26:07,052 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2023-02-17 00:26:07,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:26:07,053 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2023-02-17 00:26:07,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:26:07,053 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2023-02-17 00:26:07,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-17 00:26:07,053 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:26:07,054 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:26:07,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-17 00:26:07,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 00:26:07,264 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:26:07,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:26:07,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1907904535, now seen corresponding path program 6 times [2023-02-17 00:26:07,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 00:26:07,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1324401610] [2023-02-17 00:26:07,265 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-17 00:26:07,265 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 00:26:07,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 00:26:07,266 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 00:26:07,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-17 00:26:07,481 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2023-02-17 00:26:07,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-17 00:26:07,482 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 00:26:07,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 00:26:07,659 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-02-17 00:26:07,659 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-17 00:26:07,660 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 00:26:07,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-17 00:26:07,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 00:26:07,864 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 1] [2023-02-17 00:26:07,866 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 00:26:07,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 12:26:07 BoogieIcfgContainer [2023-02-17 00:26:07,890 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 00:26:07,890 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 00:26:07,890 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 00:26:07,891 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 00:26:07,891 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 12:23:17" (3/4) ... [2023-02-17 00:26:07,892 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-17 00:26:07,936 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 00:26:07,936 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 00:26:07,937 INFO L158 Benchmark]: Toolchain (without parser) took 171170.63ms. Allocated memory is still 86.0MB. Free memory was 63.4MB in the beginning and 38.6MB in the end (delta: 24.8MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. [2023-02-17 00:26:07,937 INFO L158 Benchmark]: CDTParser took 1.10ms. Allocated memory is still 62.9MB. Free memory is still 41.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 00:26:07,937 INFO L158 Benchmark]: CACSL2BoogieTranslator took 186.48ms. Allocated memory is still 86.0MB. Free memory was 63.0MB in the beginning and 52.3MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 00:26:07,937 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.66ms. Allocated memory is still 86.0MB. Free memory was 52.3MB in the beginning and 50.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 00:26:07,937 INFO L158 Benchmark]: Boogie Preprocessor took 30.95ms. Allocated memory is still 86.0MB. Free memory was 50.8MB in the beginning and 49.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 00:26:07,938 INFO L158 Benchmark]: RCFGBuilder took 250.48ms. Allocated memory is still 86.0MB. Free memory was 49.5MB in the beginning and 62.3MB in the end (delta: -12.8MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2023-02-17 00:26:07,938 INFO L158 Benchmark]: TraceAbstraction took 170623.73ms. Allocated memory is still 86.0MB. Free memory was 61.6MB in the beginning and 42.0MB in the end (delta: 19.6MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2023-02-17 00:26:07,938 INFO L158 Benchmark]: Witness Printer took 45.89ms. Allocated memory is still 86.0MB. Free memory was 42.0MB in the beginning and 38.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-17 00:26:07,939 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.10ms. Allocated memory is still 62.9MB. Free memory is still 41.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 186.48ms. Allocated memory is still 86.0MB. Free memory was 63.0MB in the beginning and 52.3MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.66ms. Allocated memory is still 86.0MB. Free memory was 52.3MB in the beginning and 50.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.95ms. Allocated memory is still 86.0MB. Free memory was 50.8MB in the beginning and 49.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 250.48ms. Allocated memory is still 86.0MB. Free memory was 49.5MB in the beginning and 62.3MB in the end (delta: -12.8MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * TraceAbstraction took 170623.73ms. Allocated memory is still 86.0MB. Free memory was 61.6MB in the beginning and 42.0MB in the end (delta: 19.6MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. * Witness Printer took 45.89ms. Allocated memory is still 86.0MB. Free memory was 42.0MB in the beginning and 38.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. 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 - CounterExampleResult [Line: 9]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L16] char in[11]; [L17] char *s; [L18] unsigned char c; [L19] int i, j; [L20] int idx_in; [L21] i = 0 VAL [i=0, in={5:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=1, in={5:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=2, in={5:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=3, in={5:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=4, in={5:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=5, in={5:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=6, in={5:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=7, in={5:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=8, in={5:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=9, in={5:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=10, in={5:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=11, in={5:0}] [L21] COND FALSE !(i < 11) VAL [i=11, in={5:0}] [L23] in[10] = 0 [L24] idx_in = 0 [L25] s = in [L26] i = 0 [L27] EXPR in[idx_in] [L27] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND FALSE !(('0' <= c) && (c <= '9')) VAL [c=0, i=-390241792, idx_in=10, in={5:0}, j=0, s={5:0}] [L36] CALL __VERIFIER_assert (i >= 0) [L8] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L9] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 170.6s, OverallIterations: 9, TraceHistogramMax: 11, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 106.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 9 mSolverCounterUnknown, 101 SdHoareTripleChecker+Valid, 33.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 101 mSDsluCounter, 296 SdHoareTripleChecker+Invalid, 33.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 238 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 657 IncrementalHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 58 mSDtfsCounter, 657 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 357 GetRequests, 249 SyntacticMatches, 3 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 133.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=8, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 27 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 60.8s InterpolantComputationTime, 223 NumberOfCodeBlocks, 195 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 328 ConstructedInterpolants, 29 QuantifiedInterpolants, 2159 SizeOfPredicates, 42 NumberOfNonLiveVariables, 576 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 746/1074 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 proved your program to be incorrect! [2023-02-17 00:26:08,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE