./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1251.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e19ca921 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/float-newlib/float_req_bl_1251.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 de540e539c3db6027c1fdb04fcc6cae02aafb8aa58950d31054b2b0b8391af6d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 10:24:55,158 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 10:24:55,161 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 10:24:55,200 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 10:24:55,201 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 10:24:55,204 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 10:24:55,206 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 10:24:55,208 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 10:24:55,210 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 10:24:55,213 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 10:24:55,214 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 10:24:55,215 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 10:24:55,215 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 10:24:55,217 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 10:24:55,218 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 10:24:55,221 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 10:24:55,222 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 10:24:55,223 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 10:24:55,225 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 10:24:55,229 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 10:24:55,230 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 10:24:55,231 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 10:24:55,232 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 10:24:55,233 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 10:24:55,236 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 10:24:55,237 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 10:24:55,237 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 10:24:55,238 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 10:24:55,238 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 10:24:55,239 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 10:24:55,239 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 10:24:55,240 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 10:24:55,241 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 10:24:55,242 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 10:24:55,244 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 10:24:55,244 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 10:24:55,245 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 10:24:55,245 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 10:24:55,245 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 10:24:55,246 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 10:24:55,246 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 10:24:55,247 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-22 10:24:55,273 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 10:24:55,273 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 10:24:55,274 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 10:24:55,274 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 10:24:55,275 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 10:24:55,275 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 10:24:55,275 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 10:24:55,275 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 10:24:55,276 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 10:24:55,276 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 10:24:55,276 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 10:24:55,277 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 10:24:55,277 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 10:24:55,277 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 10:24:55,277 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-22 10:24:55,277 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 10:24:55,278 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-22 10:24:55,278 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 10:24:55,278 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-22 10:24:55,278 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 10:24:55,278 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-22 10:24:55,279 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 10:24:55,279 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 10:24:55,279 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 10:24:55,279 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 10:24:55,279 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 10:24:55,279 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 10:24:55,280 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-22 10:24:55,280 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 10:24:55,280 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-22 10:24:55,280 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-22 10:24:55,280 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-22 10:24:55,281 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-22 10:24:55,281 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 10:24:55,281 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de540e539c3db6027c1fdb04fcc6cae02aafb8aa58950d31054b2b0b8391af6d [2021-12-22 10:24:55,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 10:24:55,478 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 10:24:55,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 10:24:55,481 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 10:24:55,482 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 10:24:55,482 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2021-12-22 10:24:55,538 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06bd62d71/475db3919b6f4509af9ca04c11c77af3/FLAG0f0260f72 [2021-12-22 10:24:55,871 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 10:24:55,871 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2021-12-22 10:24:55,876 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06bd62d71/475db3919b6f4509af9ca04c11c77af3/FLAG0f0260f72 [2021-12-22 10:24:56,301 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06bd62d71/475db3919b6f4509af9ca04c11c77af3 [2021-12-22 10:24:56,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 10:24:56,305 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 10:24:56,306 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 10:24:56,306 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 10:24:56,309 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 10:24:56,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 10:24:56" (1/1) ... [2021-12-22 10:24:56,311 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12c22d7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:24:56, skipping insertion in model container [2021-12-22 10:24:56,311 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 10:24:56" (1/1) ... [2021-12-22 10:24:56,317 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 10:24:56,328 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 10:24:56,478 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c[1980,1993] [2021-12-22 10:24:56,480 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c[2139,2152] [2021-12-22 10:24:56,481 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 10:24:56,486 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 10:24:56,502 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c[1980,1993] [2021-12-22 10:24:56,503 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c[2139,2152] [2021-12-22 10:24:56,504 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 10:24:56,513 INFO L208 MainTranslator]: Completed translation [2021-12-22 10:24:56,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:24:56 WrapperNode [2021-12-22 10:24:56,514 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 10:24:56,514 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 10:24:56,514 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 10:24:56,515 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 10:24:56,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:24:56" (1/1) ... [2021-12-22 10:24:56,525 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:24:56" (1/1) ... [2021-12-22 10:24:56,542 INFO L137 Inliner]: procedures = 18, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 107 [2021-12-22 10:24:56,543 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 10:24:56,544 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 10:24:56,544 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 10:24:56,544 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 10:24:56,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:24:56" (1/1) ... [2021-12-22 10:24:56,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:24:56" (1/1) ... [2021-12-22 10:24:56,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:24:56" (1/1) ... [2021-12-22 10:24:56,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:24:56" (1/1) ... [2021-12-22 10:24:56,558 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:24:56" (1/1) ... [2021-12-22 10:24:56,565 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:24:56" (1/1) ... [2021-12-22 10:24:56,571 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:24:56" (1/1) ... [2021-12-22 10:24:56,573 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 10:24:56,574 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 10:24:56,574 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 10:24:56,574 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 10:24:56,575 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:24:56" (1/1) ... [2021-12-22 10:24:56,592 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 10:24:56,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 10:24:56,616 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) [2021-12-22 10:24:56,644 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 [2021-12-22 10:24:56,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 10:24:56,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 10:24:56,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-22 10:24:56,658 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2021-12-22 10:24:56,658 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2021-12-22 10:24:56,659 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2021-12-22 10:24:56,659 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2021-12-22 10:24:56,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2021-12-22 10:24:56,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 10:24:56,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 10:24:56,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-22 10:24:56,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 10:24:56,713 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 10:24:56,714 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 10:24:56,856 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 10:24:56,861 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 10:24:56,862 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-22 10:24:56,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 10:24:56 BoogieIcfgContainer [2021-12-22 10:24:56,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 10:24:56,864 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 10:24:56,865 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 10:24:56,867 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 10:24:56,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 10:24:56" (1/3) ... [2021-12-22 10:24:56,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c878ec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 10:24:56, skipping insertion in model container [2021-12-22 10:24:56,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:24:56" (2/3) ... [2021-12-22 10:24:56,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c878ec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 10:24:56, skipping insertion in model container [2021-12-22 10:24:56,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 10:24:56" (3/3) ... [2021-12-22 10:24:56,870 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251.c [2021-12-22 10:24:56,874 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 10:24:56,874 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-22 10:24:56,908 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 10:24:56,913 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-22 10:24:56,914 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-22 10:24:56,927 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 44 states have internal predecessors, (61), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-12-22 10:24:56,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-22 10:24:56,932 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:24:56,933 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:24:56,933 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:24:56,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:24:56,937 INFO L85 PathProgramCache]: Analyzing trace with hash -625969503, now seen corresponding path program 1 times [2021-12-22 10:24:56,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 10:24:56,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036800930] [2021-12-22 10:24:56,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:24:56,946 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 10:24:57,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:24:57,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 10:24:57,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:24:57,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 10:24:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:24:57,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-22 10:24:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:24:57,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-22 10:24:57,168 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 10:24:57,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036800930] [2021-12-22 10:24:57,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036800930] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 10:24:57,169 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 10:24:57,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 10:24:57,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913123244] [2021-12-22 10:24:57,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 10:24:57,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 10:24:57,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 10:24:57,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 10:24:57,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 10:24:57,209 INFO L87 Difference]: Start difference. First operand has 57 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 44 states have internal predecessors, (61), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-22 10:24:57,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:24:57,365 INFO L93 Difference]: Finished difference Result 108 states and 156 transitions. [2021-12-22 10:24:57,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 10:24:57,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2021-12-22 10:24:57,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:24:57,379 INFO L225 Difference]: With dead ends: 108 [2021-12-22 10:24:57,379 INFO L226 Difference]: Without dead ends: 62 [2021-12-22 10:24:57,382 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-22 10:24:57,388 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 19 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 10:24:57,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 259 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 10:24:57,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-12-22 10:24:57,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2021-12-22 10:24:57,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 42 states have internal predecessors, (54), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-12-22 10:24:57,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 74 transitions. [2021-12-22 10:24:57,436 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 74 transitions. Word has length 28 [2021-12-22 10:24:57,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:24:57,437 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 74 transitions. [2021-12-22 10:24:57,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-22 10:24:57,438 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 74 transitions. [2021-12-22 10:24:57,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-22 10:24:57,440 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:24:57,440 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:24:57,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-22 10:24:57,441 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:24:57,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:24:57,443 INFO L85 PathProgramCache]: Analyzing trace with hash 716059, now seen corresponding path program 1 times [2021-12-22 10:24:57,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 10:24:57,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049371253] [2021-12-22 10:24:57,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:24:57,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 10:24:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:24:57,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 10:24:57,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:24:57,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-22 10:24:57,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:24:57,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-22 10:24:57,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:24:57,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-22 10:24:57,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:24:57,654 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-22 10:24:57,655 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 10:24:57,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049371253] [2021-12-22 10:24:57,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049371253] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 10:24:57,656 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 10:24:57,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 10:24:57,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305059437] [2021-12-22 10:24:57,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 10:24:57,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 10:24:57,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 10:24:57,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 10:24:57,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 10:24:57,663 INFO L87 Difference]: Start difference. First operand 55 states and 74 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-22 10:24:57,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:24:57,732 INFO L93 Difference]: Finished difference Result 79 states and 104 transitions. [2021-12-22 10:24:57,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 10:24:57,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2021-12-22 10:24:57,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:24:57,735 INFO L225 Difference]: With dead ends: 79 [2021-12-22 10:24:57,735 INFO L226 Difference]: Without dead ends: 59 [2021-12-22 10:24:57,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 10:24:57,737 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 3 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 10:24:57,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 243 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 10:24:57,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-12-22 10:24:57,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-12-22 10:24:57,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 45 states have internal predecessors, (57), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2021-12-22 10:24:57,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 79 transitions. [2021-12-22 10:24:57,745 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 79 transitions. Word has length 34 [2021-12-22 10:24:57,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:24:57,746 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 79 transitions. [2021-12-22 10:24:57,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-22 10:24:57,746 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 79 transitions. [2021-12-22 10:24:57,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-22 10:24:57,748 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:24:57,748 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:24:57,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-22 10:24:57,748 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:24:57,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:24:57,749 INFO L85 PathProgramCache]: Analyzing trace with hash 840977401, now seen corresponding path program 1 times [2021-12-22 10:24:57,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 10:24:57,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451329981] [2021-12-22 10:24:57,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:24:57,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 10:24:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:24:57,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 10:24:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:24:57,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-22 10:24:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:24:57,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-22 10:24:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:24:57,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-22 10:24:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:24:57,826 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-22 10:24:57,827 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 10:24:57,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451329981] [2021-12-22 10:24:57,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451329981] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 10:24:57,827 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 10:24:57,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 10:24:57,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426547863] [2021-12-22 10:24:57,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 10:24:57,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 10:24:57,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 10:24:57,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 10:24:57,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 10:24:57,830 INFO L87 Difference]: Start difference. First operand 59 states and 79 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-22 10:24:57,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:24:57,888 INFO L93 Difference]: Finished difference Result 83 states and 109 transitions. [2021-12-22 10:24:57,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 10:24:57,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2021-12-22 10:24:57,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:24:57,892 INFO L225 Difference]: With dead ends: 83 [2021-12-22 10:24:57,892 INFO L226 Difference]: Without dead ends: 63 [2021-12-22 10:24:57,895 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 10:24:57,898 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 3 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 10:24:57,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 259 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 10:24:57,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-12-22 10:24:57,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2021-12-22 10:24:57,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 45 states have internal predecessors, (57), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2021-12-22 10:24:57,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 79 transitions. [2021-12-22 10:24:57,907 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 79 transitions. Word has length 35 [2021-12-22 10:24:57,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:24:57,908 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 79 transitions. [2021-12-22 10:24:57,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-22 10:24:57,908 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 79 transitions. [2021-12-22 10:24:57,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-22 10:24:57,909 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:24:57,909 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:24:57,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-22 10:24:57,910 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:24:57,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:24:57,911 INFO L85 PathProgramCache]: Analyzing trace with hash -902959273, now seen corresponding path program 1 times [2021-12-22 10:24:57,911 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 10:24:57,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638961600] [2021-12-22 10:24:57,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:24:57,911 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 10:24:57,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:24:57,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 10:24:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:24:57,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-22 10:24:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:24:57,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-22 10:24:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:24:57,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-22 10:24:57,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:24:57,990 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-22 10:24:57,990 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 10:24:57,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638961600] [2021-12-22 10:24:57,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638961600] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 10:24:57,991 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 10:24:57,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 10:24:57,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833345352] [2021-12-22 10:24:57,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 10:24:57,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 10:24:57,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 10:24:57,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 10:24:57,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 10:24:57,992 INFO L87 Difference]: Start difference. First operand 59 states and 79 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-22 10:24:58,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:24:58,045 INFO L93 Difference]: Finished difference Result 83 states and 109 transitions. [2021-12-22 10:24:58,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 10:24:58,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2021-12-22 10:24:58,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:24:58,046 INFO L225 Difference]: With dead ends: 83 [2021-12-22 10:24:58,046 INFO L226 Difference]: Without dead ends: 63 [2021-12-22 10:24:58,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 10:24:58,048 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 3 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 10:24:58,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 259 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 10:24:58,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-12-22 10:24:58,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2021-12-22 10:24:58,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 45 states have internal predecessors, (57), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2021-12-22 10:24:58,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 79 transitions. [2021-12-22 10:24:58,054 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 79 transitions. Word has length 36 [2021-12-22 10:24:58,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:24:58,055 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 79 transitions. [2021-12-22 10:24:58,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-22 10:24:58,055 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 79 transitions. [2021-12-22 10:24:58,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-22 10:24:58,056 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:24:58,057 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:24:58,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-22 10:24:58,057 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:24:58,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:24:58,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1658214444, now seen corresponding path program 1 times [2021-12-22 10:24:58,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 10:24:58,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435149536] [2021-12-22 10:24:58,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:24:58,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 10:24:58,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:24:58,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 10:24:58,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:24:58,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-22 10:24:58,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:24:58,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-22 10:24:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:24:58,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-22 10:24:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:24:58,112 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-22 10:24:58,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 10:24:58,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435149536] [2021-12-22 10:24:58,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435149536] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 10:24:58,112 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 10:24:58,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 10:24:58,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257382754] [2021-12-22 10:24:58,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 10:24:58,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 10:24:58,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 10:24:58,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 10:24:58,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 10:24:58,114 INFO L87 Difference]: Start difference. First operand 59 states and 79 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-22 10:24:58,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:24:58,152 INFO L93 Difference]: Finished difference Result 62 states and 82 transitions. [2021-12-22 10:24:58,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 10:24:58,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2021-12-22 10:24:58,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:24:58,154 INFO L225 Difference]: With dead ends: 62 [2021-12-22 10:24:58,154 INFO L226 Difference]: Without dead ends: 60 [2021-12-22 10:24:58,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 10:24:58,155 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 3 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 10:24:58,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 180 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 10:24:58,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-12-22 10:24:58,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2021-12-22 10:24:58,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 45 states have (on average 1.288888888888889) internal successors, (58), 46 states have internal predecessors, (58), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2021-12-22 10:24:58,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 80 transitions. [2021-12-22 10:24:58,161 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 80 transitions. Word has length 37 [2021-12-22 10:24:58,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:24:58,161 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 80 transitions. [2021-12-22 10:24:58,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-22 10:24:58,162 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 80 transitions. [2021-12-22 10:24:58,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-22 10:24:58,163 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:24:58,167 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:24:58,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-22 10:24:58,167 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:24:58,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:24:58,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1826594765, now seen corresponding path program 1 times [2021-12-22 10:24:58,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 10:24:58,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826469202] [2021-12-22 10:24:58,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:24:58,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 10:24:58,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 10:24:58,222 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 10:24:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 10:24:58,275 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 10:24:58,275 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-22 10:24:58,276 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-12-22 10:24:58,278 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-12-22 10:24:58,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-22 10:24:58,282 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2021-12-22 10:24:58,284 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-22 10:24:58,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 10:24:58 BoogieIcfgContainer [2021-12-22 10:24:58,315 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-22 10:24:58,316 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-22 10:24:58,316 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-22 10:24:58,316 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-22 10:24:58,317 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 10:24:56" (3/4) ... [2021-12-22 10:24:58,321 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-22 10:24:58,321 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-22 10:24:58,322 INFO L158 Benchmark]: Toolchain (without parser) took 2016.66ms. Allocated memory is still 119.5MB. Free memory was 89.5MB in the beginning and 88.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.4MB. Max. memory is 16.1GB. [2021-12-22 10:24:58,322 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 88.1MB. Free memory was 45.7MB in the beginning and 45.6MB in the end (delta: 43.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 10:24:58,322 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.47ms. Allocated memory is still 119.5MB. Free memory was 89.5MB in the beginning and 95.5MB in the end (delta: -6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-22 10:24:58,322 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.64ms. Allocated memory is still 119.5MB. Free memory was 95.5MB in the beginning and 93.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 10:24:58,323 INFO L158 Benchmark]: Boogie Preprocessor took 29.47ms. Allocated memory is still 119.5MB. Free memory was 93.5MB in the beginning and 92.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 10:24:58,323 INFO L158 Benchmark]: RCFGBuilder took 289.72ms. Allocated memory is still 119.5MB. Free memory was 92.2MB in the beginning and 78.7MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-22 10:24:58,323 INFO L158 Benchmark]: TraceAbstraction took 1451.03ms. Allocated memory is still 119.5MB. Free memory was 77.8MB in the beginning and 88.8MB in the end (delta: -11.0MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 10:24:58,323 INFO L158 Benchmark]: Witness Printer took 5.15ms. Allocated memory is still 119.5MB. Free memory was 88.8MB in the beginning and 88.0MB in the end (delta: 792.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 10:24:58,325 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.09ms. Allocated memory is still 88.1MB. Free memory was 45.7MB in the beginning and 45.6MB in the end (delta: 43.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 207.47ms. Allocated memory is still 119.5MB. Free memory was 89.5MB in the beginning and 95.5MB in the end (delta: -6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.64ms. Allocated memory is still 119.5MB. Free memory was 95.5MB in the beginning and 93.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.47ms. Allocated memory is still 119.5MB. Free memory was 93.5MB in the beginning and 92.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 289.72ms. Allocated memory is still 119.5MB. Free memory was 92.2MB in the beginning and 78.7MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1451.03ms. Allocated memory is still 119.5MB. Free memory was 77.8MB in the beginning and 88.8MB in the end (delta: -11.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.15ms. Allocated memory is still 119.5MB. Free memory was 88.8MB in the beginning and 88.0MB in the end (delta: 792.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 76]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 75. Possible FailurePath: [L66] float x = __VERIFIER_nondet_float(); [L67] float y = __VERIFIER_nondet_float(); [L69] CALL, EXPR isnan_float(x) VAL [\old(x)=4286578691] [L57] return x != x; VAL [\old(x)=4286578691, \result=1, x=4286578691] [L69] RET, EXPR isnan_float(x) VAL [isnan_float(x)=1, x=4286578691] [L69] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, x=4286578691] [L69] CALL, EXPR isnan_float(y) VAL [\old(x)=4286578690] [L57] return x != x; VAL [\old(x)=4286578690, \result=0, x=4286578690] [L69] RET, EXPR isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, x=4286578691, y=4286578690] [L69] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, x=4286578691, y=4286578690] [L69-L70] (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) VAL [(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))=1, isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, x=4286578691, y=4286578690] [L69-L70] COND TRUE (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L72] CALL, EXPR fmax_float(x, y) [L46] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=4286578691] [L23] __uint32_t w; VAL [\old(x)=4286578691, x=4286578691] [L26] ieee_float_shape_type gf_u; [L27] gf_u.value = (x) [L28] EXPR gf_u.word [L28] (w) = gf_u.word [L31] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=4286578691, w=4286578689, x=4286578691] [L33-L34] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=4286578691, w=4286578689, x=4286578691] [L36-L37] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=4286578691, w=4286578689, x=4286578691] [L39] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L42] return 0; VAL [\old(x)=4286578691, \result=0, w=4286578689, x=4286578691] [L46] RET, EXPR __fpclassify_float(x) VAL [\old(x)=4286578691, \old(y)=4286578690, __fpclassify_float(x)=0, x=4286578691, y=4286578690] [L46] COND TRUE __fpclassify_float(x) == 0 [L47] return y; VAL [\old(x)=4286578691, \old(y)=4286578690, \result=4286578690, x=4286578691, y=4286578690] [L72] RET, EXPR fmax_float(x, y) [L72] float res = fmax_float(x, y); [L75] CALL, EXPR isnan_float(x) VAL [\old(x)=4286578691] [L57] return x != x; VAL [\old(x)=4286578691, \result=1, x=4286578691] [L75] RET, EXPR isnan_float(x) VAL [isnan_float(x)=1, res=4286578690, x=4286578691, y=4286578690] [L75] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, res=4286578690, x=4286578691, y=4286578690] [L75] CALL, EXPR isnan_float(y) VAL [\old(x)=4286578690] [L57] return x != x; VAL [\old(x)=4286578690, \result=0, x=4286578690] [L75] RET, EXPR isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, res=4286578690, x=4286578691, y=4286578690] [L75] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, res=4286578690, x=4286578691, y=4286578690] [L75] COND TRUE isnan_float(x) && !isnan_float(y) && res != y [L76] reach_error() VAL [res=4286578690, x=4286578691, y=4286578690] - UnprovableResult [Line: 82]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 57 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 33 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 1200 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 835 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 157 IncrementalHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 365 mSDtfsCounter, 157 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=5, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 15 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 212 NumberOfCodeBlocks, 212 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 165 ConstructedInterpolants, 0 QuantifiedInterpolants, 276 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 39/39 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-12-22 10:24:58,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_1251.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 de540e539c3db6027c1fdb04fcc6cae02aafb8aa58950d31054b2b0b8391af6d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 10:25:00,258 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 10:25:00,261 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 10:25:00,301 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 10:25:00,301 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 10:25:00,305 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 10:25:00,306 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 10:25:00,312 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 10:25:00,314 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 10:25:00,319 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 10:25:00,320 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 10:25:00,324 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 10:25:00,325 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 10:25:00,326 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 10:25:00,327 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 10:25:00,331 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 10:25:00,332 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 10:25:00,332 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 10:25:00,333 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 10:25:00,337 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 10:25:00,340 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 10:25:00,341 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 10:25:00,342 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 10:25:00,344 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 10:25:00,348 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 10:25:00,348 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 10:25:00,348 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 10:25:00,350 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 10:25:00,350 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 10:25:00,351 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 10:25:00,351 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 10:25:00,352 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 10:25:00,353 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 10:25:00,354 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 10:25:00,355 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 10:25:00,355 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 10:25:00,356 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 10:25:00,356 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 10:25:00,356 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 10:25:00,358 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 10:25:00,358 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 10:25:00,359 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-22 10:25:00,391 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 10:25:00,392 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 10:25:00,392 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 10:25:00,392 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 10:25:00,393 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 10:25:00,393 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 10:25:00,395 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 10:25:00,395 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 10:25:00,395 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 10:25:00,395 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 10:25:00,396 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 10:25:00,396 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 10:25:00,396 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 10:25:00,397 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-22 10:25:00,397 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 10:25:00,397 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-22 10:25:00,397 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-22 10:25:00,397 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-22 10:25:00,398 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-22 10:25:00,398 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 10:25:00,398 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-22 10:25:00,398 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 10:25:00,398 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-22 10:25:00,398 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 10:25:00,399 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 10:25:00,399 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 10:25:00,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 10:25:00,408 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 10:25:00,408 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 10:25:00,409 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-22 10:25:00,409 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-22 10:25:00,409 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-22 10:25:00,409 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-22 10:25:00,410 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-22 10:25:00,410 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-22 10:25:00,410 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 10:25:00,410 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-22 10:25:00,410 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de540e539c3db6027c1fdb04fcc6cae02aafb8aa58950d31054b2b0b8391af6d [2021-12-22 10:25:00,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 10:25:00,702 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 10:25:00,704 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 10:25:00,705 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 10:25:00,706 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 10:25:00,707 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2021-12-22 10:25:00,756 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b77ce6f82/f86efbcb7a0a4247963bbc4e46ceb756/FLAG59c3acb29 [2021-12-22 10:25:01,169 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 10:25:01,170 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2021-12-22 10:25:01,177 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b77ce6f82/f86efbcb7a0a4247963bbc4e46ceb756/FLAG59c3acb29 [2021-12-22 10:25:01,190 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b77ce6f82/f86efbcb7a0a4247963bbc4e46ceb756 [2021-12-22 10:25:01,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 10:25:01,195 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 10:25:01,197 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 10:25:01,197 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 10:25:01,200 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 10:25:01,201 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 10:25:01" (1/1) ... [2021-12-22 10:25:01,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a2cd2b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:25:01, skipping insertion in model container [2021-12-22 10:25:01,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 10:25:01" (1/1) ... [2021-12-22 10:25:01,208 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 10:25:01,223 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 10:25:01,380 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c[1980,1993] [2021-12-22 10:25:01,389 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c[2139,2152] [2021-12-22 10:25:01,391 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 10:25:01,401 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 10:25:01,470 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c[1980,1993] [2021-12-22 10:25:01,474 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c[2139,2152] [2021-12-22 10:25:01,476 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 10:25:01,492 INFO L208 MainTranslator]: Completed translation [2021-12-22 10:25:01,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:25:01 WrapperNode [2021-12-22 10:25:01,495 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 10:25:01,496 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 10:25:01,496 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 10:25:01,496 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 10:25:01,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:25:01" (1/1) ... [2021-12-22 10:25:01,518 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:25:01" (1/1) ... [2021-12-22 10:25:01,542 INFO L137 Inliner]: procedures = 21, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 98 [2021-12-22 10:25:01,543 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 10:25:01,544 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 10:25:01,544 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 10:25:01,545 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 10:25:01,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:25:01" (1/1) ... [2021-12-22 10:25:01,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:25:01" (1/1) ... [2021-12-22 10:25:01,565 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:25:01" (1/1) ... [2021-12-22 10:25:01,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:25:01" (1/1) ... [2021-12-22 10:25:01,580 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:25:01" (1/1) ... [2021-12-22 10:25:01,587 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:25:01" (1/1) ... [2021-12-22 10:25:01,589 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:25:01" (1/1) ... [2021-12-22 10:25:01,593 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 10:25:01,597 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 10:25:01,598 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 10:25:01,598 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 10:25:01,599 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:25:01" (1/1) ... [2021-12-22 10:25:01,605 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 10:25:01,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 10:25:01,628 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) [2021-12-22 10:25:01,647 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 [2021-12-22 10:25:01,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 10:25:01,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-22 10:25:01,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-22 10:25:01,673 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2021-12-22 10:25:01,673 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2021-12-22 10:25:01,674 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2021-12-22 10:25:01,674 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2021-12-22 10:25:01,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-22 10:25:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 10:25:01,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 10:25:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2021-12-22 10:25:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 10:25:01,765 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 10:25:01,769 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 10:25:01,950 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 10:25:01,955 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 10:25:01,962 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-22 10:25:01,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 10:25:01 BoogieIcfgContainer [2021-12-22 10:25:01,963 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 10:25:01,965 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 10:25:01,965 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 10:25:01,971 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 10:25:01,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 10:25:01" (1/3) ... [2021-12-22 10:25:01,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@347efaf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 10:25:01, skipping insertion in model container [2021-12-22 10:25:01,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:25:01" (2/3) ... [2021-12-22 10:25:01,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@347efaf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 10:25:01, skipping insertion in model container [2021-12-22 10:25:01,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 10:25:01" (3/3) ... [2021-12-22 10:25:01,973 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251.c [2021-12-22 10:25:01,984 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 10:25:01,985 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-22 10:25:02,026 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 10:25:02,035 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-22 10:25:02,035 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-22 10:25:02,050 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 40 states have (on average 1.475) internal successors, (59), 42 states have internal predecessors, (59), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-12-22 10:25:02,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-22 10:25:02,055 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:25:02,056 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:25:02,057 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:25:02,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:25:02,065 INFO L85 PathProgramCache]: Analyzing trace with hash 956195031, now seen corresponding path program 1 times [2021-12-22 10:25:02,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 10:25:02,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1081451741] [2021-12-22 10:25:02,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:25:02,076 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 10:25:02,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 10:25:02,081 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 10:25:02,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-22 10:25:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:25:02,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-22 10:25:02,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:25:02,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:25:02,224 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 10:25:02,225 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 10:25:02,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1081451741] [2021-12-22 10:25:02,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1081451741] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 10:25:02,226 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 10:25:02,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 10:25:02,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106812379] [2021-12-22 10:25:02,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 10:25:02,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-22 10:25:02,231 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 10:25:02,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-22 10:25:02,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-22 10:25:02,258 INFO L87 Difference]: Start difference. First operand has 55 states, 40 states have (on average 1.475) internal successors, (59), 42 states have internal predecessors, (59), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-22 10:25:02,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:25:02,282 INFO L93 Difference]: Finished difference Result 93 states and 134 transitions. [2021-12-22 10:25:02,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-22 10:25:02,283 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2021-12-22 10:25:02,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:25:02,289 INFO L225 Difference]: With dead ends: 93 [2021-12-22 10:25:02,290 INFO L226 Difference]: Without dead ends: 51 [2021-12-22 10:25:02,292 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-22 10:25:02,295 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 10:25:02,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 10:25:02,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-12-22 10:25:02,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-12-22 10:25:02,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 38 states have internal predecessors, (50), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-12-22 10:25:02,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2021-12-22 10:25:02,334 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 27 [2021-12-22 10:25:02,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:25:02,335 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2021-12-22 10:25:02,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-22 10:25:02,336 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2021-12-22 10:25:02,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-22 10:25:02,337 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:25:02,338 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:25:02,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-22 10:25:02,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 10:25:02,548 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:25:02,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:25:02,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1128254016, now seen corresponding path program 1 times [2021-12-22 10:25:02,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 10:25:02,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1838138471] [2021-12-22 10:25:02,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:25:02,550 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 10:25:02,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 10:25:02,551 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 10:25:02,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-22 10:25:02,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:25:02,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-22 10:25:02,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:25:02,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:25:02,730 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 10:25:02,731 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 10:25:02,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1838138471] [2021-12-22 10:25:02,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1838138471] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 10:25:02,734 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 10:25:02,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 10:25:02,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599534563] [2021-12-22 10:25:02,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 10:25:02,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 10:25:02,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 10:25:02,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 10:25:02,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 10:25:02,739 INFO L87 Difference]: Start difference. First operand 51 states and 70 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-22 10:25:02,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:25:02,792 INFO L93 Difference]: Finished difference Result 96 states and 131 transitions. [2021-12-22 10:25:02,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 10:25:02,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2021-12-22 10:25:02,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:25:02,798 INFO L225 Difference]: With dead ends: 96 [2021-12-22 10:25:02,799 INFO L226 Difference]: Without dead ends: 60 [2021-12-22 10:25:02,800 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-22 10:25:02,802 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 16 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 10:25:02,803 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 192 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 10:25:02,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-12-22 10:25:02,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2021-12-22 10:25:02,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-12-22 10:25:02,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 72 transitions. [2021-12-22 10:25:02,822 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 72 transitions. Word has length 28 [2021-12-22 10:25:02,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:25:02,822 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 72 transitions. [2021-12-22 10:25:02,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-22 10:25:02,823 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 72 transitions. [2021-12-22 10:25:02,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-22 10:25:02,824 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:25:02,825 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:25:02,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-22 10:25:03,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 10:25:03,035 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:25:03,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:25:03,036 INFO L85 PathProgramCache]: Analyzing trace with hash 987158491, now seen corresponding path program 1 times [2021-12-22 10:25:03,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 10:25:03,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1349683857] [2021-12-22 10:25:03,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:25:03,037 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 10:25:03,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 10:25:03,038 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 10:25:03,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-22 10:25:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:25:03,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-22 10:25:03,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:25:03,174 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-22 10:25:03,174 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 10:25:03,175 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 10:25:03,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1349683857] [2021-12-22 10:25:03,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1349683857] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 10:25:03,175 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 10:25:03,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 10:25:03,176 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942249128] [2021-12-22 10:25:03,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 10:25:03,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 10:25:03,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 10:25:03,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 10:25:03,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 10:25:03,178 INFO L87 Difference]: Start difference. First operand 53 states and 72 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-22 10:25:03,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:25:03,202 INFO L93 Difference]: Finished difference Result 76 states and 101 transitions. [2021-12-22 10:25:03,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 10:25:03,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2021-12-22 10:25:03,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:25:03,205 INFO L225 Difference]: With dead ends: 76 [2021-12-22 10:25:03,205 INFO L226 Difference]: Without dead ends: 56 [2021-12-22 10:25:03,206 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 10:25:03,207 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 10:25:03,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 10:25:03,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-12-22 10:25:03,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2021-12-22 10:25:03,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 42 states have internal predecessors, (54), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2021-12-22 10:25:03,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2021-12-22 10:25:03,214 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 76 transitions. Word has length 33 [2021-12-22 10:25:03,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:25:03,215 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 76 transitions. [2021-12-22 10:25:03,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-22 10:25:03,215 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2021-12-22 10:25:03,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-22 10:25:03,216 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:25:03,216 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:25:03,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-22 10:25:03,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 10:25:03,440 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:25:03,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:25:03,441 INFO L85 PathProgramCache]: Analyzing trace with hash 871427583, now seen corresponding path program 1 times [2021-12-22 10:25:03,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 10:25:03,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [33259941] [2021-12-22 10:25:03,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:25:03,441 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 10:25:03,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 10:25:03,443 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 10:25:03,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-22 10:25:03,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:25:03,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-22 10:25:03,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:25:03,561 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-22 10:25:03,562 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 10:25:03,562 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 10:25:03,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [33259941] [2021-12-22 10:25:03,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [33259941] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 10:25:03,563 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 10:25:03,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 10:25:03,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063111288] [2021-12-22 10:25:03,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 10:25:03,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 10:25:03,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 10:25:03,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 10:25:03,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 10:25:03,565 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-22 10:25:03,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:25:03,584 INFO L93 Difference]: Finished difference Result 79 states and 105 transitions. [2021-12-22 10:25:03,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 10:25:03,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2021-12-22 10:25:03,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:25:03,585 INFO L225 Difference]: With dead ends: 79 [2021-12-22 10:25:03,585 INFO L226 Difference]: Without dead ends: 59 [2021-12-22 10:25:03,586 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 10:25:03,587 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 10:25:03,587 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 209 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 10:25:03,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-12-22 10:25:03,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2021-12-22 10:25:03,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 42 states have internal predecessors, (54), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2021-12-22 10:25:03,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2021-12-22 10:25:03,595 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 76 transitions. Word has length 34 [2021-12-22 10:25:03,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:25:03,595 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 76 transitions. [2021-12-22 10:25:03,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-22 10:25:03,595 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2021-12-22 10:25:03,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-22 10:25:03,596 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:25:03,597 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:25:03,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-22 10:25:03,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 10:25:03,807 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:25:03,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:25:03,808 INFO L85 PathProgramCache]: Analyzing trace with hash 405124703, now seen corresponding path program 1 times [2021-12-22 10:25:03,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 10:25:03,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [41540174] [2021-12-22 10:25:03,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:25:03,809 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 10:25:03,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 10:25:03,812 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 10:25:03,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-22 10:25:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:25:03,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-22 10:25:03,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:25:03,954 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-22 10:25:03,955 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 10:25:03,955 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 10:25:03,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [41540174] [2021-12-22 10:25:03,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [41540174] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 10:25:03,956 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 10:25:03,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 10:25:03,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781986915] [2021-12-22 10:25:03,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 10:25:03,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 10:25:03,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 10:25:03,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 10:25:03,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 10:25:03,958 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-22 10:25:03,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:25:03,973 INFO L93 Difference]: Finished difference Result 79 states and 105 transitions. [2021-12-22 10:25:03,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 10:25:03,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2021-12-22 10:25:03,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:25:03,974 INFO L225 Difference]: With dead ends: 79 [2021-12-22 10:25:03,974 INFO L226 Difference]: Without dead ends: 59 [2021-12-22 10:25:03,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 10:25:03,976 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 10:25:03,976 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 209 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 10:25:03,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-12-22 10:25:03,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2021-12-22 10:25:03,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 42 states have internal predecessors, (54), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2021-12-22 10:25:03,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2021-12-22 10:25:03,982 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 76 transitions. Word has length 35 [2021-12-22 10:25:03,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:25:03,983 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 76 transitions. [2021-12-22 10:25:03,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-22 10:25:03,993 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2021-12-22 10:25:03,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-22 10:25:03,995 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:25:03,995 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:25:04,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-22 10:25:04,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 10:25:04,206 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:25:04,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:25:04,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1955992579, now seen corresponding path program 1 times [2021-12-22 10:25:04,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 10:25:04,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1509971891] [2021-12-22 10:25:04,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:25:04,208 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 10:25:04,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 10:25:04,236 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 10:25:04,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-22 10:25:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:25:04,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-22 10:25:04,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:25:04,356 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-22 10:25:04,356 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 10:25:04,356 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 10:25:04,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1509971891] [2021-12-22 10:25:04,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1509971891] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 10:25:04,357 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 10:25:04,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 10:25:04,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082054663] [2021-12-22 10:25:04,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 10:25:04,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 10:25:04,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 10:25:04,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 10:25:04,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 10:25:04,359 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-22 10:25:04,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:25:04,375 INFO L93 Difference]: Finished difference Result 79 states and 105 transitions. [2021-12-22 10:25:04,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 10:25:04,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2021-12-22 10:25:04,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:25:04,379 INFO L225 Difference]: With dead ends: 79 [2021-12-22 10:25:04,379 INFO L226 Difference]: Without dead ends: 59 [2021-12-22 10:25:04,380 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 10:25:04,381 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 10:25:04,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 209 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 10:25:04,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-12-22 10:25:04,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2021-12-22 10:25:04,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 42 states have internal predecessors, (54), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2021-12-22 10:25:04,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2021-12-22 10:25:04,387 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 76 transitions. Word has length 36 [2021-12-22 10:25:04,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:25:04,387 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 76 transitions. [2021-12-22 10:25:04,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-22 10:25:04,388 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2021-12-22 10:25:04,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-22 10:25:04,389 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:25:04,389 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:25:04,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-22 10:25:04,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 10:25:04,599 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:25:04,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:25:04,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1662589572, now seen corresponding path program 1 times [2021-12-22 10:25:04,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 10:25:04,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1644821225] [2021-12-22 10:25:04,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:25:04,601 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 10:25:04,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 10:25:04,602 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 10:25:04,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-22 10:25:04,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:25:04,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-22 10:25:04,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:25:04,947 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-22 10:25:04,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 10:25:05,194 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-22 10:25:05,194 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 10:25:05,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1644821225] [2021-12-22 10:25:05,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1644821225] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 10:25:05,194 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-22 10:25:05,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2021-12-22 10:25:05,195 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080469831] [2021-12-22 10:25:05,195 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-22 10:25:05,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-22 10:25:05,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 10:25:05,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-22 10:25:05,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-12-22 10:25:05,196 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-22 10:25:05,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:25:05,696 INFO L93 Difference]: Finished difference Result 102 states and 138 transitions. [2021-12-22 10:25:05,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-22 10:25:05,696 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) Word has length 36 [2021-12-22 10:25:05,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:25:05,697 INFO L225 Difference]: With dead ends: 102 [2021-12-22 10:25:05,698 INFO L226 Difference]: Without dead ends: 88 [2021-12-22 10:25:05,698 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2021-12-22 10:25:05,699 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 103 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 10:25:05,699 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 675 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-22 10:25:05,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-22 10:25:05,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 74. [2021-12-22 10:25:05,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 54 states have internal predecessors, (71), 15 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (19), 17 states have call predecessors, (19), 15 states have call successors, (19) [2021-12-22 10:25:05,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2021-12-22 10:25:05,706 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 36 [2021-12-22 10:25:05,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:25:05,707 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2021-12-22 10:25:05,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-22 10:25:05,707 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2021-12-22 10:25:05,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-22 10:25:05,714 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:25:05,714 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:25:05,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-22 10:25:05,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 10:25:05,924 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:25:05,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:25:05,925 INFO L85 PathProgramCache]: Analyzing trace with hash 2045835875, now seen corresponding path program 1 times [2021-12-22 10:25:05,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 10:25:05,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1942183419] [2021-12-22 10:25:05,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:25:05,926 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 10:25:05,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 10:25:05,927 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 10:25:05,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-22 10:25:05,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:25:05,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-22 10:25:05,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:25:06,184 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-22 10:25:06,184 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 10:25:06,184 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 10:25:06,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1942183419] [2021-12-22 10:25:06,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1942183419] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 10:25:06,185 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 10:25:06,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 10:25:06,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059306506] [2021-12-22 10:25:06,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 10:25:06,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 10:25:06,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 10:25:06,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 10:25:06,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-22 10:25:06,187 INFO L87 Difference]: Start difference. First operand 74 states and 105 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-22 10:25:06,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:25:06,454 INFO L93 Difference]: Finished difference Result 127 states and 174 transitions. [2021-12-22 10:25:06,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 10:25:06,455 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2021-12-22 10:25:06,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:25:06,456 INFO L225 Difference]: With dead ends: 127 [2021-12-22 10:25:06,456 INFO L226 Difference]: Without dead ends: 87 [2021-12-22 10:25:06,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2021-12-22 10:25:06,457 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 56 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 10:25:06,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 522 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 10:25:06,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-12-22 10:25:06,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 74. [2021-12-22 10:25:06,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 54 states have internal predecessors, (70), 15 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (19), 17 states have call predecessors, (19), 15 states have call successors, (19) [2021-12-22 10:25:06,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 104 transitions. [2021-12-22 10:25:06,465 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 104 transitions. Word has length 38 [2021-12-22 10:25:06,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:25:06,465 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 104 transitions. [2021-12-22 10:25:06,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-22 10:25:06,472 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 104 transitions. [2021-12-22 10:25:06,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-22 10:25:06,473 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:25:06,473 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:25:06,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-22 10:25:06,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 10:25:06,684 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:25:06,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:25:06,684 INFO L85 PathProgramCache]: Analyzing trace with hash -490349503, now seen corresponding path program 1 times [2021-12-22 10:25:06,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 10:25:06,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [285841390] [2021-12-22 10:25:06,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:25:06,685 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 10:25:06,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 10:25:06,685 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 10:25:06,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-22 10:25:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:25:06,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-22 10:25:06,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:25:07,292 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-22 10:25:07,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 10:25:07,498 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-22 10:25:07,499 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 10:25:07,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [285841390] [2021-12-22 10:25:07,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [285841390] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 10:25:07,499 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-22 10:25:07,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-12-22 10:25:07,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270345838] [2021-12-22 10:25:07,499 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-22 10:25:07,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-22 10:25:07,500 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 10:25:07,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-22 10:25:07,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2021-12-22 10:25:07,500 INFO L87 Difference]: Start difference. First operand 74 states and 104 transitions. Second operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 15 states have internal predecessors, (39), 5 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2021-12-22 10:25:08,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:25:08,043 INFO L93 Difference]: Finished difference Result 117 states and 162 transitions. [2021-12-22 10:25:08,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-22 10:25:08,044 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 15 states have internal predecessors, (39), 5 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) Word has length 41 [2021-12-22 10:25:08,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:25:08,045 INFO L225 Difference]: With dead ends: 117 [2021-12-22 10:25:08,045 INFO L226 Difference]: Without dead ends: 115 [2021-12-22 10:25:08,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2021-12-22 10:25:08,046 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 149 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 10:25:08,046 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 506 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-22 10:25:08,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-12-22 10:25:08,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 84. [2021-12-22 10:25:08,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 61 states have (on average 1.278688524590164) internal successors, (78), 61 states have internal predecessors, (78), 18 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (23), 20 states have call predecessors, (23), 18 states have call successors, (23) [2021-12-22 10:25:08,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 119 transitions. [2021-12-22 10:25:08,053 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 119 transitions. Word has length 41 [2021-12-22 10:25:08,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:25:08,054 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 119 transitions. [2021-12-22 10:25:08,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 15 states have internal predecessors, (39), 5 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2021-12-22 10:25:08,054 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 119 transitions. [2021-12-22 10:25:08,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-22 10:25:08,055 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:25:08,055 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:25:08,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-22 10:25:08,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 10:25:08,270 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:25:08,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:25:08,271 INFO L85 PathProgramCache]: Analyzing trace with hash 38675638, now seen corresponding path program 1 times [2021-12-22 10:25:08,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 10:25:08,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1982369294] [2021-12-22 10:25:08,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:25:08,271 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 10:25:08,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 10:25:08,273 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 10:25:08,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-22 10:25:08,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:25:08,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-22 10:25:08,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:25:08,392 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-22 10:25:08,392 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 10:25:08,392 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 10:25:08,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1982369294] [2021-12-22 10:25:08,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1982369294] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 10:25:08,392 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 10:25:08,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 10:25:08,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458615019] [2021-12-22 10:25:08,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 10:25:08,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 10:25:08,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 10:25:08,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 10:25:08,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 10:25:08,394 INFO L87 Difference]: Start difference. First operand 84 states and 119 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-12-22 10:25:08,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:25:08,405 INFO L93 Difference]: Finished difference Result 87 states and 122 transitions. [2021-12-22 10:25:08,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 10:25:08,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 43 [2021-12-22 10:25:08,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:25:08,406 INFO L225 Difference]: With dead ends: 87 [2021-12-22 10:25:08,406 INFO L226 Difference]: Without dead ends: 85 [2021-12-22 10:25:08,406 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 10:25:08,407 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 10:25:08,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 10:25:08,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-22 10:25:08,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2021-12-22 10:25:08,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 61 states have (on average 1.278688524590164) internal successors, (78), 61 states have internal predecessors, (78), 18 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (23), 20 states have call predecessors, (23), 18 states have call successors, (23) [2021-12-22 10:25:08,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 119 transitions. [2021-12-22 10:25:08,414 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 119 transitions. Word has length 43 [2021-12-22 10:25:08,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:25:08,414 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 119 transitions. [2021-12-22 10:25:08,414 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-12-22 10:25:08,414 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 119 transitions. [2021-12-22 10:25:08,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-22 10:25:08,415 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:25:08,415 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:25:08,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-22 10:25:08,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 10:25:08,625 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:25:08,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:25:08,625 INFO L85 PathProgramCache]: Analyzing trace with hash 972082008, now seen corresponding path program 1 times [2021-12-22 10:25:08,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 10:25:08,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [13000018] [2021-12-22 10:25:08,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:25:08,626 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 10:25:08,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 10:25:08,627 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 10:25:08,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-22 10:25:08,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:25:08,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-22 10:25:08,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:25:08,769 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-22 10:25:08,769 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 10:25:08,769 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 10:25:08,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [13000018] [2021-12-22 10:25:08,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [13000018] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 10:25:08,770 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 10:25:08,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 10:25:08,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869233258] [2021-12-22 10:25:08,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 10:25:08,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 10:25:08,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 10:25:08,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 10:25:08,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 10:25:08,771 INFO L87 Difference]: Start difference. First operand 84 states and 119 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-22 10:25:08,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:25:08,796 INFO L93 Difference]: Finished difference Result 113 states and 159 transitions. [2021-12-22 10:25:08,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 10:25:08,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 46 [2021-12-22 10:25:08,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:25:08,798 INFO L225 Difference]: With dead ends: 113 [2021-12-22 10:25:08,798 INFO L226 Difference]: Without dead ends: 88 [2021-12-22 10:25:08,798 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 10:25:08,799 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 10:25:08,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 10:25:08,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-22 10:25:08,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2021-12-22 10:25:08,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 64 states have (on average 1.265625) internal successors, (81), 63 states have internal predecessors, (81), 18 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (28), 22 states have call predecessors, (28), 18 states have call successors, (28) [2021-12-22 10:25:08,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 127 transitions. [2021-12-22 10:25:08,807 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 127 transitions. Word has length 46 [2021-12-22 10:25:08,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:25:08,807 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 127 transitions. [2021-12-22 10:25:08,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-22 10:25:08,807 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 127 transitions. [2021-12-22 10:25:08,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-22 10:25:08,808 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:25:08,808 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:25:08,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-22 10:25:09,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 10:25:09,019 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:25:09,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:25:09,019 INFO L85 PathProgramCache]: Analyzing trace with hash 411048800, now seen corresponding path program 1 times [2021-12-22 10:25:09,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 10:25:09,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1384358975] [2021-12-22 10:25:09,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:25:09,020 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 10:25:09,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 10:25:09,021 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 10:25:09,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-22 10:25:09,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:25:09,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-22 10:25:09,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:25:09,153 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-22 10:25:09,153 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 10:25:09,153 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 10:25:09,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1384358975] [2021-12-22 10:25:09,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1384358975] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 10:25:09,153 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 10:25:09,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 10:25:09,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063742998] [2021-12-22 10:25:09,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 10:25:09,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 10:25:09,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 10:25:09,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 10:25:09,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 10:25:09,155 INFO L87 Difference]: Start difference. First operand 88 states and 127 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-22 10:25:09,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:25:09,171 INFO L93 Difference]: Finished difference Result 117 states and 167 transitions. [2021-12-22 10:25:09,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 10:25:09,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 47 [2021-12-22 10:25:09,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:25:09,173 INFO L225 Difference]: With dead ends: 117 [2021-12-22 10:25:09,173 INFO L226 Difference]: Without dead ends: 92 [2021-12-22 10:25:09,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 10:25:09,174 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 10:25:09,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 209 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 10:25:09,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-22 10:25:09,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2021-12-22 10:25:09,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 64 states have (on average 1.265625) internal successors, (81), 63 states have internal predecessors, (81), 18 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (28), 22 states have call predecessors, (28), 18 states have call successors, (28) [2021-12-22 10:25:09,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 127 transitions. [2021-12-22 10:25:09,182 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 127 transitions. Word has length 47 [2021-12-22 10:25:09,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:25:09,182 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 127 transitions. [2021-12-22 10:25:09,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-22 10:25:09,182 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 127 transitions. [2021-12-22 10:25:09,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-22 10:25:09,183 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:25:09,183 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:25:09,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-22 10:25:09,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 10:25:09,399 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:25:09,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:25:09,400 INFO L85 PathProgramCache]: Analyzing trace with hash -877982242, now seen corresponding path program 1 times [2021-12-22 10:25:09,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 10:25:09,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1025887124] [2021-12-22 10:25:09,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:25:09,401 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 10:25:09,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 10:25:09,401 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 10:25:09,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-22 10:25:09,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:25:09,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-22 10:25:09,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:25:09,662 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-22 10:25:09,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 10:25:09,782 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 10:25:09,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1025887124] [2021-12-22 10:25:09,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1025887124] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 10:25:09,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1623798876] [2021-12-22 10:25:09,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:25:09,783 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-22 10:25:09,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-22 10:25:09,791 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-22 10:25:09,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2021-12-22 10:25:10,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:25:10,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-22 10:25:10,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:25:10,186 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-22 10:25:10,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 10:25:10,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1623798876] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 10:25:10,236 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-22 10:25:10,236 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2021-12-22 10:25:10,236 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422961063] [2021-12-22 10:25:10,236 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-22 10:25:10,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 10:25:10,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 10:25:10,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 10:25:10,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-22 10:25:10,237 INFO L87 Difference]: Start difference. First operand 88 states and 127 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-22 10:25:10,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:25:10,605 INFO L93 Difference]: Finished difference Result 123 states and 168 transitions. [2021-12-22 10:25:10,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-22 10:25:10,606 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2021-12-22 10:25:10,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:25:10,607 INFO L225 Difference]: With dead ends: 123 [2021-12-22 10:25:10,607 INFO L226 Difference]: Without dead ends: 102 [2021-12-22 10:25:10,608 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-12-22 10:25:10,608 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 68 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 10:25:10,609 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 333 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 10:25:10,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-12-22 10:25:10,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 88. [2021-12-22 10:25:10,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 64 states have (on average 1.25) internal successors, (80), 63 states have internal predecessors, (80), 18 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (28), 22 states have call predecessors, (28), 18 states have call successors, (28) [2021-12-22 10:25:10,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 126 transitions. [2021-12-22 10:25:10,615 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 126 transitions. Word has length 48 [2021-12-22 10:25:10,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:25:10,616 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 126 transitions. [2021-12-22 10:25:10,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-22 10:25:10,616 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 126 transitions. [2021-12-22 10:25:10,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-22 10:25:10,617 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:25:10,617 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:25:10,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Ended with exit code 0 [2021-12-22 10:25:10,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-22 10:25:11,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 10:25:11,021 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:25:11,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:25:11,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1899050596, now seen corresponding path program 1 times [2021-12-22 10:25:11,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 10:25:11,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089172630] [2021-12-22 10:25:11,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:25:11,022 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 10:25:11,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 10:25:11,023 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 10:25:11,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-22 10:25:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:25:11,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-22 10:25:11,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:25:11,674 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-22 10:25:11,674 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 10:25:11,674 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 10:25:11,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089172630] [2021-12-22 10:25:11,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1089172630] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 10:25:11,675 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 10:25:11,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-22 10:25:11,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065386648] [2021-12-22 10:25:11,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 10:25:11,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 10:25:11,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 10:25:11,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 10:25:11,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-22 10:25:11,676 INFO L87 Difference]: Start difference. First operand 88 states and 126 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-22 10:25:12,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:25:12,705 INFO L93 Difference]: Finished difference Result 137 states and 191 transitions. [2021-12-22 10:25:12,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 10:25:12,706 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 48 [2021-12-22 10:25:12,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:25:12,707 INFO L225 Difference]: With dead ends: 137 [2021-12-22 10:25:12,707 INFO L226 Difference]: Without dead ends: 135 [2021-12-22 10:25:12,708 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2021-12-22 10:25:12,708 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 91 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-22 10:25:12,708 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 560 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-22 10:25:12,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-12-22 10:25:12,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 100. [2021-12-22 10:25:12,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 74 states have (on average 1.2432432432432432) internal successors, (92), 72 states have internal predecessors, (92), 19 states have call successors, (19), 2 states have call predecessors, (19), 5 states have return successors, (34), 25 states have call predecessors, (34), 19 states have call successors, (34) [2021-12-22 10:25:12,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 145 transitions. [2021-12-22 10:25:12,715 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 145 transitions. Word has length 48 [2021-12-22 10:25:12,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:25:12,715 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 145 transitions. [2021-12-22 10:25:12,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-22 10:25:12,715 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 145 transitions. [2021-12-22 10:25:12,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-22 10:25:12,716 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:25:12,716 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:25:12,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-22 10:25:12,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 10:25:12,929 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:25:12,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:25:12,930 INFO L85 PathProgramCache]: Analyzing trace with hash 505566420, now seen corresponding path program 1 times [2021-12-22 10:25:12,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 10:25:12,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [134828889] [2021-12-22 10:25:12,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:25:12,930 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 10:25:12,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 10:25:12,932 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 10:25:12,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-22 10:25:12,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:25:12,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-22 10:25:12,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:25:13,047 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-22 10:25:13,048 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 10:25:13,048 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 10:25:13,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [134828889] [2021-12-22 10:25:13,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [134828889] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 10:25:13,048 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 10:25:13,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 10:25:13,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232524524] [2021-12-22 10:25:13,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 10:25:13,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 10:25:13,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 10:25:13,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 10:25:13,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 10:25:13,050 INFO L87 Difference]: Start difference. First operand 100 states and 145 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-22 10:25:13,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:25:13,066 INFO L93 Difference]: Finished difference Result 129 states and 185 transitions. [2021-12-22 10:25:13,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 10:25:13,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2021-12-22 10:25:13,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:25:13,068 INFO L225 Difference]: With dead ends: 129 [2021-12-22 10:25:13,068 INFO L226 Difference]: Without dead ends: 104 [2021-12-22 10:25:13,068 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 10:25:13,069 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 10:25:13,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 209 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 10:25:13,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-22 10:25:13,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2021-12-22 10:25:13,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 74 states have (on average 1.2432432432432432) internal successors, (92), 72 states have internal predecessors, (92), 19 states have call successors, (19), 2 states have call predecessors, (19), 5 states have return successors, (34), 25 states have call predecessors, (34), 19 states have call successors, (34) [2021-12-22 10:25:13,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 145 transitions. [2021-12-22 10:25:13,075 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 145 transitions. Word has length 48 [2021-12-22 10:25:13,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:25:13,076 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 145 transitions. [2021-12-22 10:25:13,076 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-22 10:25:13,076 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 145 transitions. [2021-12-22 10:25:13,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-22 10:25:13,077 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:25:13,077 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:25:13,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-22 10:25:13,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 10:25:13,287 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:25:13,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:25:13,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1437385679, now seen corresponding path program 1 times [2021-12-22 10:25:13,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 10:25:13,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2134381126] [2021-12-22 10:25:13,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:25:13,289 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 10:25:13,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 10:25:13,290 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 10:25:13,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-22 10:25:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:25:13,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-22 10:25:13,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:25:13,541 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-22 10:25:13,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 10:25:13,755 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-22 10:25:13,756 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 10:25:13,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2134381126] [2021-12-22 10:25:13,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2134381126] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 10:25:13,756 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-22 10:25:13,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2021-12-22 10:25:13,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116099998] [2021-12-22 10:25:13,757 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-22 10:25:13,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-22 10:25:13,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 10:25:13,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-22 10:25:13,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-12-22 10:25:13,758 INFO L87 Difference]: Start difference. First operand 100 states and 145 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 5 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-22 10:25:14,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:25:14,303 INFO L93 Difference]: Finished difference Result 122 states and 170 transitions. [2021-12-22 10:25:14,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-22 10:25:14,304 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 5 states have call predecessors, (8), 2 states have call successors, (8) Word has length 48 [2021-12-22 10:25:14,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:25:14,305 INFO L225 Difference]: With dead ends: 122 [2021-12-22 10:25:14,305 INFO L226 Difference]: Without dead ends: 99 [2021-12-22 10:25:14,305 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2021-12-22 10:25:14,306 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 86 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-22 10:25:14,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 466 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-22 10:25:14,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-12-22 10:25:14,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2021-12-22 10:25:14,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 69 states have internal predecessors, (85), 19 states have call successors, (19), 2 states have call predecessors, (19), 5 states have return successors, (33), 23 states have call predecessors, (33), 19 states have call successors, (33) [2021-12-22 10:25:14,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2021-12-22 10:25:14,313 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 48 [2021-12-22 10:25:14,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:25:14,313 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2021-12-22 10:25:14,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 5 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-22 10:25:14,314 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2021-12-22 10:25:14,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-22 10:25:14,315 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:25:14,315 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:25:14,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-22 10:25:14,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 10:25:14,525 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:25:14,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:25:14,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1803392071, now seen corresponding path program 1 times [2021-12-22 10:25:14,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 10:25:14,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1107269946] [2021-12-22 10:25:14,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:25:14,525 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 10:25:14,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 10:25:14,527 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 10:25:14,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-22 10:25:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:25:14,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-22 10:25:14,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:25:14,785 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-22 10:25:14,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 10:25:15,189 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-22 10:25:15,189 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 10:25:15,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1107269946] [2021-12-22 10:25:15,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1107269946] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 10:25:15,190 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-22 10:25:15,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2021-12-22 10:25:15,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946480790] [2021-12-22 10:25:15,192 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-22 10:25:15,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-22 10:25:15,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 10:25:15,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-22 10:25:15,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-12-22 10:25:15,193 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-22 10:25:15,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:25:15,636 INFO L93 Difference]: Finished difference Result 133 states and 178 transitions. [2021-12-22 10:25:15,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-22 10:25:15,636 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) Word has length 48 [2021-12-22 10:25:15,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:25:15,638 INFO L225 Difference]: With dead ends: 133 [2021-12-22 10:25:15,638 INFO L226 Difference]: Without dead ends: 89 [2021-12-22 10:25:15,638 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2021-12-22 10:25:15,639 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 48 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 10:25:15,639 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 564 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 10:25:15,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-12-22 10:25:15,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2021-12-22 10:25:15,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 63 states have internal predecessors, (76), 16 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (27), 20 states have call predecessors, (27), 16 states have call successors, (27) [2021-12-22 10:25:15,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 119 transitions. [2021-12-22 10:25:15,644 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 119 transitions. Word has length 48 [2021-12-22 10:25:15,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:25:15,644 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 119 transitions. [2021-12-22 10:25:15,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-22 10:25:15,644 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 119 transitions. [2021-12-22 10:25:15,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-22 10:25:15,645 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:25:15,645 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:25:15,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-12-22 10:25:15,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 10:25:15,855 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:25:15,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:25:15,856 INFO L85 PathProgramCache]: Analyzing trace with hash -495361713, now seen corresponding path program 1 times [2021-12-22 10:25:15,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 10:25:15,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [514909028] [2021-12-22 10:25:15,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:25:15,857 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 10:25:15,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 10:25:15,858 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 10:25:15,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-22 10:25:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:25:15,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-22 10:25:15,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:25:16,098 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-22 10:25:16,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 10:25:16,347 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-22 10:25:16,347 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 10:25:16,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [514909028] [2021-12-22 10:25:16,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [514909028] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 10:25:16,347 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-22 10:25:16,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2021-12-22 10:25:16,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087269101] [2021-12-22 10:25:16,348 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-22 10:25:16,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-22 10:25:16,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 10:25:16,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-22 10:25:16,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-12-22 10:25:16,349 INFO L87 Difference]: Start difference. First operand 86 states and 119 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-22 10:25:16,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:25:16,545 INFO L93 Difference]: Finished difference Result 101 states and 133 transitions. [2021-12-22 10:25:16,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 10:25:16,546 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) Word has length 48 [2021-12-22 10:25:16,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:25:16,546 INFO L225 Difference]: With dead ends: 101 [2021-12-22 10:25:16,546 INFO L226 Difference]: Without dead ends: 82 [2021-12-22 10:25:16,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2021-12-22 10:25:16,547 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 48 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 10:25:16,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 529 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 10:25:16,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-12-22 10:25:16,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 74. [2021-12-22 10:25:16,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 55 states have internal predecessors, (63), 13 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (24), 16 states have call predecessors, (24), 13 states have call successors, (24) [2021-12-22 10:25:16,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 100 transitions. [2021-12-22 10:25:16,552 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 100 transitions. Word has length 48 [2021-12-22 10:25:16,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:25:16,552 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 100 transitions. [2021-12-22 10:25:16,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-22 10:25:16,552 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 100 transitions. [2021-12-22 10:25:16,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-22 10:25:16,553 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:25:16,553 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:25:16,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-12-22 10:25:16,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 10:25:16,759 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:25:16,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:25:16,760 INFO L85 PathProgramCache]: Analyzing trace with hash 113915812, now seen corresponding path program 1 times [2021-12-22 10:25:16,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 10:25:16,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [277568374] [2021-12-22 10:25:16,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:25:16,760 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 10:25:16,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 10:25:16,761 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 10:25:16,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-12-22 10:25:16,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:25:16,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-22 10:25:16,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:25:17,288 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-22 10:25:17,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 10:25:17,506 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-22 10:25:17,506 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 10:25:17,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [277568374] [2021-12-22 10:25:17,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [277568374] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 10:25:17,506 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-22 10:25:17,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-12-22 10:25:17,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566492137] [2021-12-22 10:25:17,507 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-22 10:25:17,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-22 10:25:17,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 10:25:17,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-22 10:25:17,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2021-12-22 10:25:17,508 INFO L87 Difference]: Start difference. First operand 74 states and 100 transitions. Second operand has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 17 states have internal predecessors, (44), 5 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2021-12-22 10:25:17,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:25:17,855 INFO L93 Difference]: Finished difference Result 84 states and 111 transitions. [2021-12-22 10:25:17,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-22 10:25:17,860 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 17 states have internal predecessors, (44), 5 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) Word has length 49 [2021-12-22 10:25:17,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:25:17,861 INFO L225 Difference]: With dead ends: 84 [2021-12-22 10:25:17,861 INFO L226 Difference]: Without dead ends: 72 [2021-12-22 10:25:17,861 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=495, Unknown=0, NotChecked=0, Total=650 [2021-12-22 10:25:17,861 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 81 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 10:25:17,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 330 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 10:25:17,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-12-22 10:25:17,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2021-12-22 10:25:17,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.16) internal successors, (58), 51 states have internal predecessors, (58), 13 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (20), 15 states have call predecessors, (20), 13 states have call successors, (20) [2021-12-22 10:25:17,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2021-12-22 10:25:17,866 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 49 [2021-12-22 10:25:17,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:25:17,866 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2021-12-22 10:25:17,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 17 states have internal predecessors, (44), 5 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2021-12-22 10:25:17,866 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2021-12-22 10:25:17,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-22 10:25:17,867 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:25:17,867 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:25:17,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-12-22 10:25:18,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 10:25:18,079 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:25:18,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:25:18,080 INFO L85 PathProgramCache]: Analyzing trace with hash -552676772, now seen corresponding path program 1 times [2021-12-22 10:25:18,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 10:25:18,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [839510279] [2021-12-22 10:25:18,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:25:18,080 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 10:25:18,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 10:25:18,082 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 10:25:18,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-12-22 10:25:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:25:18,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-22 10:25:18,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:25:18,198 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-22 10:25:18,198 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 10:25:18,198 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 10:25:18,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [839510279] [2021-12-22 10:25:18,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [839510279] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 10:25:18,199 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 10:25:18,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 10:25:18,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970901212] [2021-12-22 10:25:18,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 10:25:18,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 10:25:18,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 10:25:18,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 10:25:18,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 10:25:18,200 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-22 10:25:18,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:25:18,232 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2021-12-22 10:25:18,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 10:25:18,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 49 [2021-12-22 10:25:18,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:25:18,235 INFO L225 Difference]: With dead ends: 96 [2021-12-22 10:25:18,235 INFO L226 Difference]: Without dead ends: 70 [2021-12-22 10:25:18,235 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 10:25:18,235 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 10:25:18,236 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 201 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 10:25:18,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-12-22 10:25:18,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2021-12-22 10:25:18,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 49 states have (on average 1.163265306122449) internal successors, (57), 49 states have internal predecessors, (57), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (16), 15 states have call predecessors, (16), 13 states have call successors, (16) [2021-12-22 10:25:18,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2021-12-22 10:25:18,239 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 49 [2021-12-22 10:25:18,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:25:18,240 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2021-12-22 10:25:18,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-22 10:25:18,240 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2021-12-22 10:25:18,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-22 10:25:18,240 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:25:18,241 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:25:18,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-12-22 10:25:18,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 10:25:18,442 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:25:18,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:25:18,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1549749125, now seen corresponding path program 1 times [2021-12-22 10:25:18,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 10:25:18,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [92413463] [2021-12-22 10:25:18,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:25:18,443 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 10:25:18,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 10:25:18,444 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 10:25:18,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-12-22 10:25:18,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:25:18,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-22 10:25:18,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:25:19,148 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-22 10:25:19,148 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 10:25:19,148 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 10:25:19,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [92413463] [2021-12-22 10:25:19,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [92413463] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 10:25:19,149 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 10:25:19,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-22 10:25:19,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673709685] [2021-12-22 10:25:19,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 10:25:19,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-22 10:25:19,149 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 10:25:19,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-22 10:25:19,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-12-22 10:25:19,150 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-22 10:25:19,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:25:19,765 INFO L93 Difference]: Finished difference Result 90 states and 116 transitions. [2021-12-22 10:25:19,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-22 10:25:19,765 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 49 [2021-12-22 10:25:19,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:25:19,766 INFO L225 Difference]: With dead ends: 90 [2021-12-22 10:25:19,766 INFO L226 Difference]: Without dead ends: 69 [2021-12-22 10:25:19,767 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2021-12-22 10:25:19,767 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 42 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 10:25:19,767 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 607 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 378 Invalid, 0 Unknown, 36 Unchecked, 0.4s Time] [2021-12-22 10:25:19,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-12-22 10:25:19,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 49. [2021-12-22 10:25:19,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 36 states have internal predecessors, (44), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2021-12-22 10:25:19,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2021-12-22 10:25:19,771 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 49 [2021-12-22 10:25:19,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:25:19,771 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2021-12-22 10:25:19,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-22 10:25:19,771 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2021-12-22 10:25:19,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-22 10:25:19,772 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:25:19,772 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:25:19,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2021-12-22 10:25:19,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 10:25:19,982 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:25:19,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:25:19,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1451512262, now seen corresponding path program 1 times [2021-12-22 10:25:19,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 10:25:19,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [862088342] [2021-12-22 10:25:19,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:25:19,983 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 10:25:19,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 10:25:19,984 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 10:25:19,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-12-22 10:25:20,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:25:20,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-22 10:25:20,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:25:20,603 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-22 10:25:20,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 10:25:21,687 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-22 10:25:21,688 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 10:25:21,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [862088342] [2021-12-22 10:25:21,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [862088342] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 10:25:21,688 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-22 10:25:21,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2021-12-22 10:25:21,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743114154] [2021-12-22 10:25:21,688 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-22 10:25:21,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-22 10:25:21,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 10:25:21,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-22 10:25:21,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2021-12-22 10:25:21,690 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 4 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2021-12-22 10:25:22,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:25:22,453 INFO L93 Difference]: Finished difference Result 88 states and 111 transitions. [2021-12-22 10:25:22,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-22 10:25:22,455 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 4 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 55 [2021-12-22 10:25:22,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:25:22,456 INFO L225 Difference]: With dead ends: 88 [2021-12-22 10:25:22,456 INFO L226 Difference]: Without dead ends: 55 [2021-12-22 10:25:22,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=161, Invalid=709, Unknown=0, NotChecked=0, Total=870 [2021-12-22 10:25:22,457 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 131 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-22 10:25:22,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 289 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 282 Invalid, 0 Unknown, 21 Unchecked, 0.5s Time] [2021-12-22 10:25:22,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-12-22 10:25:22,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2021-12-22 10:25:22,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2021-12-22 10:25:22,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2021-12-22 10:25:22,461 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 55 [2021-12-22 10:25:22,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:25:22,461 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2021-12-22 10:25:22,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 4 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2021-12-22 10:25:22,461 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2021-12-22 10:25:22,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-22 10:25:22,462 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:25:22,462 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:25:22,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-12-22 10:25:22,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 10:25:22,673 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:25:22,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:25:22,673 INFO L85 PathProgramCache]: Analyzing trace with hash 2059347801, now seen corresponding path program 1 times [2021-12-22 10:25:22,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 10:25:22,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [524273194] [2021-12-22 10:25:22,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:25:22,674 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 10:25:22,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 10:25:22,675 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 10:25:22,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-12-22 10:25:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:25:22,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-22 10:25:22,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:25:22,913 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-22 10:25:22,913 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 10:25:22,913 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 10:25:22,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [524273194] [2021-12-22 10:25:22,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [524273194] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 10:25:22,913 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 10:25:22,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 10:25:22,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043418800] [2021-12-22 10:25:22,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 10:25:22,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 10:25:22,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 10:25:22,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 10:25:22,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-22 10:25:22,915 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-22 10:25:23,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:25:23,010 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2021-12-22 10:25:23,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 10:25:23,010 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 62 [2021-12-22 10:25:23,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:25:23,010 INFO L225 Difference]: With dead ends: 65 [2021-12-22 10:25:23,010 INFO L226 Difference]: Without dead ends: 48 [2021-12-22 10:25:23,011 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-22 10:25:23,011 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 15 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 10:25:23,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 237 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 10:25:23,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-12-22 10:25:23,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2021-12-22 10:25:23,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2021-12-22 10:25:23,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2021-12-22 10:25:23,014 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 62 [2021-12-22 10:25:23,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:25:23,015 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2021-12-22 10:25:23,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-22 10:25:23,015 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2021-12-22 10:25:23,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-22 10:25:23,016 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:25:23,016 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:25:23,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Ended with exit code 0 [2021-12-22 10:25:23,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 10:25:23,219 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:25:23,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:25:23,220 INFO L85 PathProgramCache]: Analyzing trace with hash 253909467, now seen corresponding path program 1 times [2021-12-22 10:25:23,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 10:25:23,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1062561285] [2021-12-22 10:25:23,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:25:23,220 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 10:25:23,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 10:25:23,221 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 10:25:23,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-12-22 10:25:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:25:23,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-22 10:25:23,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:25:23,477 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-22 10:25:23,478 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 10:25:23,478 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 10:25:23,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1062561285] [2021-12-22 10:25:23,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1062561285] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 10:25:23,478 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 10:25:23,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-22 10:25:23,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357083277] [2021-12-22 10:25:23,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 10:25:23,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 10:25:23,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 10:25:23,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 10:25:23,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-22 10:25:23,479 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-22 10:25:23,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:25:23,744 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2021-12-22 10:25:23,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 10:25:23,745 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 62 [2021-12-22 10:25:23,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:25:23,745 INFO L225 Difference]: With dead ends: 69 [2021-12-22 10:25:23,745 INFO L226 Difference]: Without dead ends: 50 [2021-12-22 10:25:23,746 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-12-22 10:25:23,746 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 38 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 10:25:23,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 262 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 10:25:23,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-12-22 10:25:23,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2021-12-22 10:25:23,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 37 states have (on average 1.135135135135135) internal successors, (42), 38 states have internal predecessors, (42), 8 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2021-12-22 10:25:23,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2021-12-22 10:25:23,749 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 62 [2021-12-22 10:25:23,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:25:23,749 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2021-12-22 10:25:23,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-22 10:25:23,750 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2021-12-22 10:25:23,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-22 10:25:23,750 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:25:23,750 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:25:23,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2021-12-22 10:25:23,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 10:25:23,960 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:25:23,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:25:23,961 INFO L85 PathProgramCache]: Analyzing trace with hash 647887735, now seen corresponding path program 1 times [2021-12-22 10:25:23,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 10:25:23,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1059188377] [2021-12-22 10:25:23,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:25:23,962 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 10:25:23,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 10:25:23,963 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 10:25:23,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-12-22 10:25:24,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:25:24,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-22 10:25:24,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:25:24,320 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-22 10:25:24,320 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 10:25:24,320 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 10:25:24,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1059188377] [2021-12-22 10:25:24,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1059188377] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 10:25:24,320 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 10:25:24,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-22 10:25:24,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253504355] [2021-12-22 10:25:24,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 10:25:24,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 10:25:24,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 10:25:24,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 10:25:24,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-22 10:25:24,321 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-22 10:25:24,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:25:24,625 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2021-12-22 10:25:24,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 10:25:24,625 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 63 [2021-12-22 10:25:24,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:25:24,626 INFO L225 Difference]: With dead ends: 71 [2021-12-22 10:25:24,626 INFO L226 Difference]: Without dead ends: 52 [2021-12-22 10:25:24,626 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-12-22 10:25:24,627 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 35 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 10:25:24,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 268 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 24 Unchecked, 0.2s Time] [2021-12-22 10:25:24,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-12-22 10:25:24,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2021-12-22 10:25:24,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 37 states have (on average 1.135135135135135) internal successors, (42), 38 states have internal predecessors, (42), 8 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2021-12-22 10:25:24,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2021-12-22 10:25:24,630 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 63 [2021-12-22 10:25:24,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:25:24,630 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2021-12-22 10:25:24,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-22 10:25:24,631 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2021-12-22 10:25:24,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-22 10:25:24,632 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:25:24,632 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:25:24,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2021-12-22 10:25:24,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 10:25:24,839 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:25:24,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:25:24,840 INFO L85 PathProgramCache]: Analyzing trace with hash -589254976, now seen corresponding path program 1 times [2021-12-22 10:25:24,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 10:25:24,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [281342586] [2021-12-22 10:25:24,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:25:24,840 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 10:25:24,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 10:25:24,841 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 10:25:24,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-12-22 10:25:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:25:24,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-22 10:25:24,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:25:25,187 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-12-22 10:25:25,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 10:25:25,626 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-12-22 10:25:25,627 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 10:25:25,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [281342586] [2021-12-22 10:25:25,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [281342586] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 10:25:25,627 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-22 10:25:25,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-12-22 10:25:25,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612823066] [2021-12-22 10:25:25,628 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-22 10:25:25,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-22 10:25:25,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 10:25:25,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-22 10:25:25,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-12-22 10:25:25,630 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 15 states, 13 states have (on average 4.0) internal successors, (52), 15 states have internal predecessors, (52), 7 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) [2021-12-22 10:25:25,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:25:25,999 INFO L93 Difference]: Finished difference Result 84 states and 101 transitions. [2021-12-22 10:25:25,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 10:25:25,999 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 15 states have internal predecessors, (52), 7 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) Word has length 63 [2021-12-22 10:25:25,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:25:26,000 INFO L225 Difference]: With dead ends: 84 [2021-12-22 10:25:26,000 INFO L226 Difference]: Without dead ends: 71 [2021-12-22 10:25:26,000 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2021-12-22 10:25:26,001 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 72 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 10:25:26,001 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 603 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 10:25:26,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-12-22 10:25:26,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 54. [2021-12-22 10:25:26,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 41 states have internal predecessors, (44), 9 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (13), 10 states have call predecessors, (13), 9 states have call successors, (13) [2021-12-22 10:25:26,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2021-12-22 10:25:26,005 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 63 [2021-12-22 10:25:26,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:25:26,005 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2021-12-22 10:25:26,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 15 states have internal predecessors, (52), 7 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) [2021-12-22 10:25:26,006 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2021-12-22 10:25:26,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-22 10:25:26,006 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:25:26,006 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:25:26,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Ended with exit code 0 [2021-12-22 10:25:26,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 10:25:26,216 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:25:26,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:25:26,217 INFO L85 PathProgramCache]: Analyzing trace with hash -472199073, now seen corresponding path program 1 times [2021-12-22 10:25:26,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 10:25:26,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2108161239] [2021-12-22 10:25:26,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:25:26,218 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 10:25:26,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 10:25:26,219 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 10:25:26,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2021-12-22 10:25:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:25:26,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-22 10:25:26,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:25:26,547 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-22 10:25:26,547 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 10:25:26,547 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 10:25:26,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2108161239] [2021-12-22 10:25:26,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2108161239] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 10:25:26,548 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 10:25:26,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-22 10:25:26,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015017729] [2021-12-22 10:25:26,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 10:25:26,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 10:25:26,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 10:25:26,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 10:25:26,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-22 10:25:26,549 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-22 10:25:26,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:25:26,910 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2021-12-22 10:25:26,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 10:25:26,911 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 64 [2021-12-22 10:25:26,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:25:26,912 INFO L225 Difference]: With dead ends: 75 [2021-12-22 10:25:26,912 INFO L226 Difference]: Without dead ends: 56 [2021-12-22 10:25:26,912 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-12-22 10:25:26,912 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 34 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 10:25:26,913 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 268 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 24 Unchecked, 0.2s Time] [2021-12-22 10:25:26,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-12-22 10:25:26,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2021-12-22 10:25:26,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 41 states have internal predecessors, (44), 9 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (13), 10 states have call predecessors, (13), 9 states have call successors, (13) [2021-12-22 10:25:26,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2021-12-22 10:25:26,916 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 64 [2021-12-22 10:25:26,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:25:26,916 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2021-12-22 10:25:26,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-22 10:25:26,916 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2021-12-22 10:25:26,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-22 10:25:26,917 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:25:26,917 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:25:26,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Ended with exit code 0 [2021-12-22 10:25:27,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 10:25:27,123 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:25:27,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:25:27,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1512938488, now seen corresponding path program 1 times [2021-12-22 10:25:27,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 10:25:27,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [333271885] [2021-12-22 10:25:27,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:25:27,124 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 10:25:27,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 10:25:27,125 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 10:25:27,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2021-12-22 10:25:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:25:27,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-22 10:25:27,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:25:27,686 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-12-22 10:25:27,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 10:25:27,877 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-12-22 10:25:27,877 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 10:25:27,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [333271885] [2021-12-22 10:25:27,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [333271885] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 10:25:27,877 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-22 10:25:27,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-12-22 10:25:27,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567967023] [2021-12-22 10:25:27,878 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-22 10:25:27,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-22 10:25:27,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 10:25:27,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-22 10:25:27,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-12-22 10:25:27,880 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (13), 1 states have call predecessors, (13), 3 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2021-12-22 10:25:28,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:25:28,075 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2021-12-22 10:25:28,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 10:25:28,076 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (13), 1 states have call predecessors, (13), 3 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) Word has length 64 [2021-12-22 10:25:28,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:25:28,076 INFO L225 Difference]: With dead ends: 68 [2021-12-22 10:25:28,077 INFO L226 Difference]: Without dead ends: 55 [2021-12-22 10:25:28,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2021-12-22 10:25:28,077 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 112 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 10:25:28,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 258 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 10:25:28,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-12-22 10:25:28,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2021-12-22 10:25:28,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 8 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2021-12-22 10:25:28,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2021-12-22 10:25:28,081 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 64 [2021-12-22 10:25:28,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:25:28,081 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2021-12-22 10:25:28,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (13), 1 states have call predecessors, (13), 3 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2021-12-22 10:25:28,082 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2021-12-22 10:25:28,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-22 10:25:28,082 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:25:28,082 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:25:28,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2021-12-22 10:25:28,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 10:25:28,293 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:25:28,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:25:28,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1283662981, now seen corresponding path program 1 times [2021-12-22 10:25:28,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 10:25:28,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [798740370] [2021-12-22 10:25:28,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:25:28,294 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 10:25:28,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 10:25:28,295 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 10:25:28,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2021-12-22 10:25:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:25:28,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-22 10:25:28,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:25:28,604 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-22 10:25:28,604 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 10:25:28,604 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 10:25:28,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [798740370] [2021-12-22 10:25:28,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [798740370] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 10:25:28,604 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 10:25:28,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-22 10:25:28,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252876179] [2021-12-22 10:25:28,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 10:25:28,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 10:25:28,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 10:25:28,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 10:25:28,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-22 10:25:28,606 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-22 10:25:28,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:25:28,889 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2021-12-22 10:25:28,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 10:25:28,890 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 65 [2021-12-22 10:25:28,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:25:28,890 INFO L225 Difference]: With dead ends: 68 [2021-12-22 10:25:28,890 INFO L226 Difference]: Without dead ends: 49 [2021-12-22 10:25:28,891 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-12-22 10:25:28,895 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 32 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 10:25:28,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 260 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 10:25:28,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-12-22 10:25:28,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2021-12-22 10:25:28,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-22 10:25:28,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2021-12-22 10:25:28,898 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 65 [2021-12-22 10:25:28,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:25:28,899 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2021-12-22 10:25:28,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-22 10:25:28,899 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2021-12-22 10:25:28,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-22 10:25:28,899 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:25:28,900 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:25:28,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2021-12-22 10:25:29,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 10:25:29,103 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:25:29,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:25:29,104 INFO L85 PathProgramCache]: Analyzing trace with hash -322048964, now seen corresponding path program 1 times [2021-12-22 10:25:29,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 10:25:29,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1298007300] [2021-12-22 10:25:29,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:25:29,105 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 10:25:29,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 10:25:29,106 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 10:25:29,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2021-12-22 10:25:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:25:29,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-22 10:25:29,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:25:29,264 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-22 10:25:29,265 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 10:25:29,265 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 10:25:29,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1298007300] [2021-12-22 10:25:29,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1298007300] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 10:25:29,265 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 10:25:29,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 10:25:29,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349198686] [2021-12-22 10:25:29,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 10:25:29,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 10:25:29,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 10:25:29,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 10:25:29,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 10:25:29,267 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-22 10:25:29,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:25:29,299 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2021-12-22 10:25:29,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 10:25:29,300 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 65 [2021-12-22 10:25:29,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:25:29,300 INFO L225 Difference]: With dead ends: 50 [2021-12-22 10:25:29,300 INFO L226 Difference]: Without dead ends: 0 [2021-12-22 10:25:29,301 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 10:25:29,301 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 10:25:29,301 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 10:25:29,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-22 10:25:29,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-22 10:25:29,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:25:29,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-22 10:25:29,302 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2021-12-22 10:25:29,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:25:29,302 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-22 10:25:29,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-22 10:25:29,302 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-22 10:25:29,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-22 10:25:29,304 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-12-22 10:25:29,305 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-12-22 10:25:29,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2021-12-22 10:25:29,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 10:25:29,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-22 10:25:30,229 INFO L858 garLoopResultBuilder]: For program point isnan_floatFINAL(line 57) no Hoare annotation was computed. [2021-12-22 10:25:30,229 INFO L861 garLoopResultBuilder]: At program point isnan_floatENTRY(line 57) the Hoare annotation is: true [2021-12-22 10:25:30,230 INFO L858 garLoopResultBuilder]: For program point isnan_floatEXIT(line 57) no Hoare annotation was computed. [2021-12-22 10:25:30,230 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 82) no Hoare annotation was computed. [2021-12-22 10:25:30,230 INFO L854 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_fmax_float_~y#1| |ULTIMATE.start_main_~y~0#1|))) (or (and .cse0 (not (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|))) (and (= |ULTIMATE.start_fmax_float_#res#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~res~0#1| |ULTIMATE.start_main_~x~0#1|) .cse0 (= |ULTIMATE.start_fmax_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (not (fp.eq |ULTIMATE.start_fmax_float_~y#1| |ULTIMATE.start_fmax_float_~y#1|))))) [2021-12-22 10:25:30,230 INFO L858 garLoopResultBuilder]: For program point L81-1(line 81) no Hoare annotation was computed. [2021-12-22 10:25:30,230 INFO L858 garLoopResultBuilder]: For program point L81-2(line 81) no Hoare annotation was computed. [2021-12-22 10:25:30,230 INFO L854 garLoopResultBuilder]: At program point L81-3(line 81) the Hoare annotation is: (and (= |ULTIMATE.start_fmax_float_#res#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~res~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_fmax_float_~y#1| |ULTIMATE.start_main_~y~0#1|) (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_fmax_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (not (fp.eq |ULTIMATE.start_fmax_float_~y#1| |ULTIMATE.start_fmax_float_~y#1|))) [2021-12-22 10:25:30,230 INFO L858 garLoopResultBuilder]: For program point L81-4(line 81) no Hoare annotation was computed. [2021-12-22 10:25:30,230 INFO L858 garLoopResultBuilder]: For program point L81-6(lines 81 84) no Hoare annotation was computed. [2021-12-22 10:25:30,230 INFO L861 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: true [2021-12-22 10:25:30,230 INFO L858 garLoopResultBuilder]: For program point L69-1(line 69) no Hoare annotation was computed. [2021-12-22 10:25:30,230 INFO L858 garLoopResultBuilder]: For program point L69-2(line 69) no Hoare annotation was computed. [2021-12-22 10:25:30,230 INFO L854 garLoopResultBuilder]: At program point L69-3(line 69) the Hoare annotation is: (and (= |ULTIMATE.start_main_#t~ret10#1| (_ bv1 32)) |ULTIMATE.start_main_#t~short12#1| (not (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|))) [2021-12-22 10:25:30,231 INFO L858 garLoopResultBuilder]: For program point L69-4(line 69) no Hoare annotation was computed. [2021-12-22 10:25:30,231 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-22 10:25:30,231 INFO L858 garLoopResultBuilder]: For program point L69-6(line 69) no Hoare annotation was computed. [2021-12-22 10:25:30,231 INFO L858 garLoopResultBuilder]: For program point L69-7(lines 69 70) no Hoare annotation was computed. [2021-12-22 10:25:30,231 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-22 10:25:30,231 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-22 10:25:30,231 INFO L858 garLoopResultBuilder]: For program point L69-9(lines 69 85) no Hoare annotation was computed. [2021-12-22 10:25:30,231 INFO L858 garLoopResultBuilder]: For program point L69-11(lines 69 85) no Hoare annotation was computed. [2021-12-22 10:25:30,231 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 76) no Hoare annotation was computed. [2021-12-22 10:25:30,231 INFO L858 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2021-12-22 10:25:30,231 INFO L858 garLoopResultBuilder]: For program point L53-2(line 53) no Hoare annotation was computed. [2021-12-22 10:25:30,231 INFO L854 garLoopResultBuilder]: At program point L53-3(lines 45 54) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_fmax_float_~y#1| |ULTIMATE.start_main_~y~0#1|)) (.cse1 (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|))) (or (and .cse0 (not (fp.eq |ULTIMATE.start_fmax_float_~x#1| |ULTIMATE.start_fmax_float_~x#1|)) (not .cse1) (= |ULTIMATE.start_fmax_float_#res#1| |ULTIMATE.start_main_~y~0#1|) (fp.eq |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (and (= |ULTIMATE.start_fmax_float_#res#1| |ULTIMATE.start_main_~x~0#1|) .cse0 .cse1 (= |ULTIMATE.start_fmax_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (not (fp.eq |ULTIMATE.start_fmax_float_~y#1| |ULTIMATE.start_fmax_float_~y#1|))))) [2021-12-22 10:25:30,231 INFO L858 garLoopResultBuilder]: For program point L82(line 82) no Hoare annotation was computed. [2021-12-22 10:25:30,231 INFO L854 garLoopResultBuilder]: At program point L70(line 70) the Hoare annotation is: (let ((.cse0 (not |ULTIMATE.start_main_#t~short12#1|)) (.cse1 (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse2 (not |ULTIMATE.start_main_#t~short16#1|))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ret10#1| (_ bv1 32)) (= |ULTIMATE.start_main_#t~ret11#1| (_ bv1 32)) (not (fp.eq |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (not .cse1) .cse2) (and .cse0 (= |ULTIMATE.start_main_#t~ret10#1| (_ bv0 32)) .cse1 .cse2))) [2021-12-22 10:25:30,231 INFO L858 garLoopResultBuilder]: For program point L70-1(line 70) no Hoare annotation was computed. [2021-12-22 10:25:30,232 INFO L858 garLoopResultBuilder]: For program point L70-2(line 70) no Hoare annotation was computed. [2021-12-22 10:25:30,232 INFO L854 garLoopResultBuilder]: At program point L70-3(line 70) the Hoare annotation is: (and (not |ULTIMATE.start_main_#t~short12#1|) |ULTIMATE.start_main_#t~short15#1| (= |ULTIMATE.start_main_#t~ret13#1| (_ bv0 32)) (= |ULTIMATE.start_main_#t~ret10#1| (_ bv0 32)) (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|) (not |ULTIMATE.start_main_#t~short16#1|)) [2021-12-22 10:25:30,232 INFO L858 garLoopResultBuilder]: For program point L70-4(line 70) no Hoare annotation was computed. [2021-12-22 10:25:30,232 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-22 10:25:30,232 INFO L858 garLoopResultBuilder]: For program point L70-6(line 70) no Hoare annotation was computed. [2021-12-22 10:25:30,232 INFO L861 garLoopResultBuilder]: At program point L87(lines 59 88) the Hoare annotation is: true [2021-12-22 10:25:30,232 INFO L854 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_fmax_float_~y#1| |ULTIMATE.start_main_~y~0#1|)) (.cse1 (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse2 (fp.eq |ULTIMATE.start_fmax_float_~y#1| |ULTIMATE.start_fmax_float_~y#1|))) (or (and .cse0 (not (fp.eq |ULTIMATE.start_fmax_float_~x#1| |ULTIMATE.start_fmax_float_~x#1|)) (not .cse1) .cse2) (and .cse0 .cse1 (= |ULTIMATE.start_fmax_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (not .cse2)))) [2021-12-22 10:25:30,232 INFO L858 garLoopResultBuilder]: For program point L50-1(lines 50 52) no Hoare annotation was computed. [2021-12-22 10:25:30,232 INFO L854 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_fmax_float_~y#1| |ULTIMATE.start_main_~y~0#1|)) (.cse1 (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse2 (fp.eq |ULTIMATE.start_fmax_float_~y#1| |ULTIMATE.start_fmax_float_~y#1|))) (or (and .cse0 (not (fp.eq |ULTIMATE.start_fmax_float_~x#1| |ULTIMATE.start_fmax_float_~x#1|)) (not .cse1) .cse2) (and .cse0 .cse1 (= |ULTIMATE.start_fmax_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (not .cse2)))) [2021-12-22 10:25:30,232 INFO L858 garLoopResultBuilder]: For program point L46-1(lines 46 48) no Hoare annotation was computed. [2021-12-22 10:25:30,233 INFO L854 garLoopResultBuilder]: At program point L75(line 75) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_fmax_float_~y#1| |ULTIMATE.start_main_~y~0#1|)) (.cse1 (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|))) (or (and (= |ULTIMATE.start_fmax_float_#res#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~res~0#1| |ULTIMATE.start_main_~x~0#1|) .cse0 .cse1 (= |ULTIMATE.start_fmax_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (not (fp.eq |ULTIMATE.start_fmax_float_~y#1| |ULTIMATE.start_fmax_float_~y#1|))) (and .cse0 (not (fp.eq |ULTIMATE.start_fmax_float_~x#1| |ULTIMATE.start_fmax_float_~x#1|)) (= |ULTIMATE.start_main_~res~0#1| |ULTIMATE.start_main_~y~0#1|) (not .cse1) (= |ULTIMATE.start_fmax_float_#res#1| |ULTIMATE.start_main_~y~0#1|) (fp.eq |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))) [2021-12-22 10:25:30,233 INFO L858 garLoopResultBuilder]: For program point L75-1(line 75) no Hoare annotation was computed. [2021-12-22 10:25:30,233 INFO L858 garLoopResultBuilder]: For program point L75-2(line 75) no Hoare annotation was computed. [2021-12-22 10:25:30,233 INFO L854 garLoopResultBuilder]: At program point L75-3(line 75) the Hoare annotation is: (and |ULTIMATE.start_main_#t~short20#1| (= |ULTIMATE.start_fmax_float_~y#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~res~0#1| |ULTIMATE.start_main_~y~0#1|) (not (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|)) (= |ULTIMATE.start_fmax_float_#res#1| |ULTIMATE.start_main_~y~0#1|) (fp.eq |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) [2021-12-22 10:25:30,233 INFO L858 garLoopResultBuilder]: For program point L75-4(line 75) no Hoare annotation was computed. [2021-12-22 10:25:30,233 INFO L858 garLoopResultBuilder]: For program point L75-6(lines 75 78) no Hoare annotation was computed. [2021-12-22 10:25:30,233 INFO L858 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2021-12-22 10:25:30,233 INFO L858 garLoopResultBuilder]: For program point L33(lines 33 42) no Hoare annotation was computed. [2021-12-22 10:25:30,233 INFO L858 garLoopResultBuilder]: For program point __fpclassify_floatFINAL(lines 22 43) no Hoare annotation was computed. [2021-12-22 10:25:30,233 INFO L858 garLoopResultBuilder]: For program point L25-1(lines 25 29) no Hoare annotation was computed. [2021-12-22 10:25:30,233 INFO L854 garLoopResultBuilder]: At program point L25-2(lines 25 29) the Hoare annotation is: (= |__fpclassify_float_#in~x| __fpclassify_float_~x) [2021-12-22 10:25:30,233 INFO L858 garLoopResultBuilder]: For program point L25-3(lines 22 43) no Hoare annotation was computed. [2021-12-22 10:25:30,233 INFO L858 garLoopResultBuilder]: For program point L36(lines 36 42) no Hoare annotation was computed. [2021-12-22 10:25:30,233 INFO L861 garLoopResultBuilder]: At program point __fpclassify_floatENTRY(lines 22 43) the Hoare annotation is: true [2021-12-22 10:25:30,234 INFO L858 garLoopResultBuilder]: For program point __fpclassify_floatEXIT(lines 22 43) no Hoare annotation was computed. [2021-12-22 10:25:30,234 INFO L858 garLoopResultBuilder]: For program point L39(lines 39 42) no Hoare annotation was computed. [2021-12-22 10:25:30,236 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:25:30,237 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-22 10:25:30,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 10:25:30 BoogieIcfgContainer [2021-12-22 10:25:30,250 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-22 10:25:30,250 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-22 10:25:30,250 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-22 10:25:30,250 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-22 10:25:30,251 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 10:25:01" (3/4) ... [2021-12-22 10:25:30,256 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-22 10:25:30,261 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure isnan_float [2021-12-22 10:25:30,261 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_float [2021-12-22 10:25:30,265 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2021-12-22 10:25:30,266 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-12-22 10:25:30,266 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-22 10:25:30,266 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-22 10:25:30,284 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2021-12-22 10:25:30,285 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((y == y && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && \result == y) && ~fp.eq~FLOAT(y, y)) || ((((\result == x && y == y) && ~fp.eq~FLOAT(x, x)) && x == x) && !~fp.eq~FLOAT(y, y)) [2021-12-22 10:25:30,297 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-22 10:25:30,297 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-22 10:25:30,297 INFO L158 Benchmark]: Toolchain (without parser) took 29102.19ms. Allocated memory was 56.6MB in the beginning and 88.1MB in the end (delta: 31.5MB). Free memory was 35.5MB in the beginning and 34.6MB in the end (delta: 889.2kB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. [2021-12-22 10:25:30,298 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 56.6MB. Free memory is still 38.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 10:25:30,298 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.54ms. Allocated memory was 56.6MB in the beginning and 73.4MB in the end (delta: 16.8MB). Free memory was 35.3MB in the beginning and 56.2MB in the end (delta: -20.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-22 10:25:30,298 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.32ms. Allocated memory is still 73.4MB. Free memory was 56.0MB in the beginning and 54.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 10:25:30,298 INFO L158 Benchmark]: Boogie Preprocessor took 52.22ms. Allocated memory is still 73.4MB. Free memory was 54.4MB in the beginning and 52.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 10:25:30,299 INFO L158 Benchmark]: RCFGBuilder took 366.65ms. Allocated memory is still 73.4MB. Free memory was 52.8MB in the beginning and 40.0MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-22 10:25:30,299 INFO L158 Benchmark]: TraceAbstraction took 28284.99ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 39.4MB in the beginning and 38.8MB in the end (delta: 611.4kB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. [2021-12-22 10:25:30,299 INFO L158 Benchmark]: Witness Printer took 46.95ms. Allocated memory is still 88.1MB. Free memory was 38.8MB in the beginning and 34.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-22 10:25:30,300 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 56.6MB. Free memory is still 38.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 298.54ms. Allocated memory was 56.6MB in the beginning and 73.4MB in the end (delta: 16.8MB). Free memory was 35.3MB in the beginning and 56.2MB in the end (delta: -20.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.32ms. Allocated memory is still 73.4MB. Free memory was 56.0MB in the beginning and 54.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.22ms. Allocated memory is still 73.4MB. Free memory was 54.4MB in the beginning and 52.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 366.65ms. Allocated memory is still 73.4MB. Free memory was 52.8MB in the beginning and 40.0MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 28284.99ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 39.4MB in the beginning and 38.8MB in the end (delta: 611.4kB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. * Witness Printer took 46.95ms. Allocated memory is still 88.1MB. Free memory was 38.8MB in the beginning and 34.6MB in the end (delta: 4.2MB). 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 - PositiveResult [Line: 76]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 82]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 55 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 28.2s, OverallIterations: 30, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1332 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1257 mSDsluCounter, 9686 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 105 IncrementalHoareTripleChecker+Unchecked, 7868 mSDsCounter, 334 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3637 IncrementalHoareTripleChecker+Invalid, 4076 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 334 mSolverCounterUnsat, 1818 mSDtfsCounter, 3637 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2044 GetRequests, 1738 SyntacticMatches, 2 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=14, InterpolantAutomatonStates: 243, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 30 MinimizatonAttempts, 209 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 137 PreInvPairs, 163 NumberOfFragments, 264 HoareAnnotationTreeSize, 137 FomulaSimplifications, 1064 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 1513 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 1490 NumberOfCodeBlocks, 1490 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1902 ConstructedInterpolants, 9 QuantifiedInterpolants, 5667 SizeOfPredicates, 152 NumberOfNonLiveVariables, 3436 ConjunctsInSsa, 301 ConjunctsInUnsatCore, 40 InterpolantComputations, 20 PerfectInterpolantSequences, 1033/1145 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 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: ((((y == y && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && \result == y) && ~fp.eq~FLOAT(y, y)) || ((((\result == x && y == y) && ~fp.eq~FLOAT(x, x)) && x == x) && !~fp.eq~FLOAT(y, y)) - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: \old(x) == x RESULT: Ultimate proved your program to be correct! [2021-12-22 10:25:30,342 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 Result: TRUE