./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1252a.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 2743c9c1eae15f6a9812481781d831b3850f89be91644ec8a207d83f9a71b29e --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 14:47:06,424 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 14:47:06,426 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 14:47:06,474 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 14:47:06,474 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 14:47:06,475 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 14:47:06,477 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 14:47:06,479 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 14:47:06,480 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 14:47:06,483 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 14:47:06,484 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 14:47:06,486 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 14:47:06,486 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 14:47:06,487 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 14:47:06,488 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 14:47:06,491 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 14:47:06,491 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 14:47:06,492 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 14:47:06,493 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 14:47:06,497 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 14:47:06,499 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 14:47:06,500 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 14:47:06,500 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 14:47:06,501 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 14:47:06,502 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 14:47:06,507 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 14:47:06,507 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 14:47:06,507 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 14:47:06,508 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 14:47:06,509 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 14:47:06,509 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 14:47:06,510 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 14:47:06,512 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 14:47:06,512 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 14:47:06,512 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 14:47:06,513 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 14:47:06,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 14:47:06,514 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 14:47:06,514 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 14:47:06,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 14:47:06,515 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 14:47:06,516 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 14:47:06,517 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 14:47:06,540 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 14:47:06,541 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 14:47:06,541 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 14:47:06,541 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 14:47:06,542 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 14:47:06,542 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 14:47:06,542 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 14:47:06,543 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 14:47:06,543 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 14:47:06,543 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 14:47:06,544 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 14:47:06,544 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 14:47:06,544 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 14:47:06,544 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 14:47:06,544 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 14:47:06,544 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 14:47:06,545 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 14:47:06,545 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 14:47:06,545 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 14:47:06,545 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 14:47:06,545 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 14:47:06,545 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 14:47:06,545 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 14:47:06,546 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 14:47:06,547 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:47:06,547 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 14:47:06,547 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 14:47:06,547 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 14:47:06,547 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 14:47:06,547 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 14:47:06,548 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 14:47:06,548 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 14:47:06,548 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 14:47:06,548 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 -> 2743c9c1eae15f6a9812481781d831b3850f89be91644ec8a207d83f9a71b29e [2022-07-13 14:47:06,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 14:47:06,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 14:47:06,768 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 14:47:06,769 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 14:47:06,769 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 14:47:06,770 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2022-07-13 14:47:06,809 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9a427212/2b429f44346e494687c1b520393a5b03/FLAG0f7999d38 [2022-07-13 14:47:07,171 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 14:47:07,172 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2022-07-13 14:47:07,176 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9a427212/2b429f44346e494687c1b520393a5b03/FLAG0f7999d38 [2022-07-13 14:47:07,200 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9a427212/2b429f44346e494687c1b520393a5b03 [2022-07-13 14:47:07,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 14:47:07,204 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 14:47:07,211 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 14:47:07,212 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 14:47:07,214 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 14:47:07,215 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:47:07" (1/1) ... [2022-07-13 14:47:07,215 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a255793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:47:07, skipping insertion in model container [2022-07-13 14:47:07,216 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:47:07" (1/1) ... [2022-07-13 14:47:07,220 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 14:47:07,234 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 14:47:07,433 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/double_req_bl_1252a.c[2154,2167] [2022-07-13 14:47:07,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:47:07,440 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 14:47:07,495 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/double_req_bl_1252a.c[2154,2167] [2022-07-13 14:47:07,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:47:07,504 INFO L208 MainTranslator]: Completed translation [2022-07-13 14:47:07,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:47:07 WrapperNode [2022-07-13 14:47:07,505 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 14:47:07,505 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 14:47:07,506 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 14:47:07,506 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 14:47:07,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:47:07" (1/1) ... [2022-07-13 14:47:07,525 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:47:07" (1/1) ... [2022-07-13 14:47:07,539 INFO L137 Inliner]: procedures = 18, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 67 [2022-07-13 14:47:07,540 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 14:47:07,540 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 14:47:07,541 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 14:47:07,541 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 14:47:07,546 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:47:07" (1/1) ... [2022-07-13 14:47:07,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:47:07" (1/1) ... [2022-07-13 14:47:07,548 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:47:07" (1/1) ... [2022-07-13 14:47:07,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:47:07" (1/1) ... [2022-07-13 14:47:07,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:47:07" (1/1) ... [2022-07-13 14:47:07,555 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:47:07" (1/1) ... [2022-07-13 14:47:07,556 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:47:07" (1/1) ... [2022-07-13 14:47:07,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 14:47:07,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 14:47:07,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 14:47:07,558 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 14:47:07,564 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:47:07" (1/1) ... [2022-07-13 14:47:07,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:47:07,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 14:47:07,589 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 14:47:07,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 14:47:07,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 14:47:07,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 14:47:07,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 14:47:07,615 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2022-07-13 14:47:07,615 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2022-07-13 14:47:07,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-07-13 14:47:07,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 14:47:07,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 14:47:07,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 14:47:07,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 14:47:07,661 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 14:47:07,662 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 14:47:07,777 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 14:47:07,781 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 14:47:07,782 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-13 14:47:07,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:47:07 BoogieIcfgContainer [2022-07-13 14:47:07,783 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 14:47:07,784 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 14:47:07,785 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 14:47:07,787 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 14:47:07,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 02:47:07" (1/3) ... [2022-07-13 14:47:07,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45db5bfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:47:07, skipping insertion in model container [2022-07-13 14:47:07,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:47:07" (2/3) ... [2022-07-13 14:47:07,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45db5bfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:47:07, skipping insertion in model container [2022-07-13 14:47:07,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:47:07" (3/3) ... [2022-07-13 14:47:07,789 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252a.c [2022-07-13 14:47:07,799 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 14:47:07,800 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 14:47:07,834 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 14:47:07,839 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5d37b074, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7318b2fe [2022-07-13 14:47:07,839 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 14:47:07,842 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 27 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 14:47:07,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-13 14:47:07,847 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:47:07,847 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:47:07,848 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:47:07,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:47:07,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1634587165, now seen corresponding path program 1 times [2022-07-13 14:47:07,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:47:07,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647755008] [2022-07-13 14:47:07,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:47:07,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:47:07,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:47:07,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 14:47:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:47:07,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:47:07,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:47:07,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647755008] [2022-07-13 14:47:07,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647755008] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:47:07,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:47:07,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 14:47:07,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928210494] [2022-07-13 14:47:07,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:47:07,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 14:47:07,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:47:07,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 14:47:07,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 14:47:07,994 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 27 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:47:08,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:47:08,026 INFO L93 Difference]: Finished difference Result 59 states and 86 transitions. [2022-07-13 14:47:08,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 14:47:08,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-07-13 14:47:08,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:47:08,037 INFO L225 Difference]: With dead ends: 59 [2022-07-13 14:47:08,037 INFO L226 Difference]: Without dead ends: 28 [2022-07-13 14:47:08,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 14:47:08,042 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:47:08,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 71 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 14:47:08,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-13 14:47:08,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-07-13 14:47:08,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 14:47:08,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-07-13 14:47:08,072 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 14 [2022-07-13 14:47:08,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:47:08,072 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-07-13 14:47:08,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:47:08,072 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-07-13 14:47:08,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-13 14:47:08,074 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:47:08,074 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:47:08,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 14:47:08,074 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:47:08,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:47:08,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1992797582, now seen corresponding path program 1 times [2022-07-13 14:47:08,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:47:08,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069113544] [2022-07-13 14:47:08,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:47:08,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:47:08,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:47:08,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 14:47:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:47:08,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:47:08,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:47:08,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069113544] [2022-07-13 14:47:08,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069113544] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:47:08,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:47:08,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 14:47:08,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244369615] [2022-07-13 14:47:08,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:47:08,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 14:47:08,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:47:08,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 14:47:08,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:47:08,191 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:47:08,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:47:08,218 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-07-13 14:47:08,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 14:47:08,218 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-07-13 14:47:08,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:47:08,220 INFO L225 Difference]: With dead ends: 41 [2022-07-13 14:47:08,220 INFO L226 Difference]: Without dead ends: 32 [2022-07-13 14:47:08,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:47:08,222 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:47:08,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 118 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 14:47:08,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-13 14:47:08,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-07-13 14:47:08,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 14:47:08,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-07-13 14:47:08,229 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 15 [2022-07-13 14:47:08,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:47:08,229 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-07-13 14:47:08,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:47:08,230 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-07-13 14:47:08,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 14:47:08,230 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:47:08,230 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:47:08,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 14:47:08,231 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:47:08,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:47:08,232 INFO L85 PathProgramCache]: Analyzing trace with hash -118167546, now seen corresponding path program 1 times [2022-07-13 14:47:08,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:47:08,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603868896] [2022-07-13 14:47:08,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:47:08,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:47:08,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:47:08,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 14:47:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:47:08,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:47:08,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:47:08,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603868896] [2022-07-13 14:47:08,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603868896] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:47:08,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:47:08,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 14:47:08,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807873128] [2022-07-13 14:47:08,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:47:08,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 14:47:08,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:47:08,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 14:47:08,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:47:08,314 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:47:08,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:47:08,339 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-07-13 14:47:08,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 14:47:08,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-07-13 14:47:08,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:47:08,341 INFO L225 Difference]: With dead ends: 45 [2022-07-13 14:47:08,341 INFO L226 Difference]: Without dead ends: 36 [2022-07-13 14:47:08,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:47:08,342 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:47:08,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 134 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 14:47:08,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-13 14:47:08,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2022-07-13 14:47:08,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 14:47:08,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-07-13 14:47:08,348 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 16 [2022-07-13 14:47:08,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:47:08,348 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-07-13 14:47:08,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:47:08,349 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-07-13 14:47:08,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 14:47:08,349 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:47:08,349 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:47:08,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 14:47:08,350 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:47:08,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:47:08,351 INFO L85 PathProgramCache]: Analyzing trace with hash -774061834, now seen corresponding path program 1 times [2022-07-13 14:47:08,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:47:08,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542160296] [2022-07-13 14:47:08,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:47:08,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:47:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:47:08,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 14:47:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:47:08,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:47:08,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:47:08,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542160296] [2022-07-13 14:47:08,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542160296] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:47:08,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:47:08,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 14:47:08,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681378247] [2022-07-13 14:47:08,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:47:08,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 14:47:08,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:47:08,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 14:47:08,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:47:08,412 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:47:08,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:47:08,464 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-07-13 14:47:08,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 14:47:08,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-07-13 14:47:08,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:47:08,465 INFO L225 Difference]: With dead ends: 45 [2022-07-13 14:47:08,465 INFO L226 Difference]: Without dead ends: 36 [2022-07-13 14:47:08,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:47:08,466 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:47:08,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 134 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 14:47:08,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-13 14:47:08,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2022-07-13 14:47:08,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 14:47:08,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-07-13 14:47:08,471 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 17 [2022-07-13 14:47:08,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:47:08,471 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-07-13 14:47:08,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:47:08,471 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-07-13 14:47:08,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 14:47:08,472 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:47:08,472 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:47:08,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 14:47:08,472 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:47:08,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:47:08,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1728168458, now seen corresponding path program 1 times [2022-07-13 14:47:08,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:47:08,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654403788] [2022-07-13 14:47:08,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:47:08,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:47:08,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:47:08,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 14:47:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:47:08,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:47:08,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:47:08,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654403788] [2022-07-13 14:47:08,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654403788] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:47:08,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:47:08,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 14:47:08,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455851282] [2022-07-13 14:47:08,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:47:08,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 14:47:08,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:47:08,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 14:47:08,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:47:08,552 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:47:08,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:47:08,573 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-07-13 14:47:08,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 14:47:08,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-07-13 14:47:08,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:47:08,575 INFO L225 Difference]: With dead ends: 45 [2022-07-13 14:47:08,575 INFO L226 Difference]: Without dead ends: 36 [2022-07-13 14:47:08,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:47:08,576 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:47:08,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 134 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 14:47:08,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-13 14:47:08,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2022-07-13 14:47:08,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 14:47:08,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-07-13 14:47:08,580 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 18 [2022-07-13 14:47:08,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:47:08,580 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-07-13 14:47:08,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:47:08,580 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-07-13 14:47:08,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 14:47:08,581 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:47:08,581 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:47:08,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 14:47:08,581 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:47:08,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:47:08,582 INFO L85 PathProgramCache]: Analyzing trace with hash -79286005, now seen corresponding path program 1 times [2022-07-13 14:47:08,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:47:08,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3800542] [2022-07-13 14:47:08,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:47:08,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:47:08,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 14:47:08,596 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 14:47:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 14:47:08,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 14:47:08,626 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 14:47:08,626 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 14:47:08,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 14:47:08,630 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-07-13 14:47:08,632 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 14:47:08,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 02:47:08 BoogieIcfgContainer [2022-07-13 14:47:08,653 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 14:47:08,654 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 14:47:08,654 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 14:47:08,654 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 14:47:08,655 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:47:07" (3/4) ... [2022-07-13 14:47:08,657 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-13 14:47:08,657 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 14:47:08,657 INFO L158 Benchmark]: Toolchain (without parser) took 1453.75ms. Allocated memory was 142.6MB in the beginning and 178.3MB in the end (delta: 35.7MB). Free memory was 112.1MB in the beginning and 120.8MB in the end (delta: -8.6MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. [2022-07-13 14:47:08,657 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 98.0MB in the end (delta: 120.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 14:47:08,658 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.59ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 115.5MB in the end (delta: -3.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-13 14:47:08,658 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.13ms. Allocated memory is still 142.6MB. Free memory was 115.5MB in the beginning and 114.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 14:47:08,658 INFO L158 Benchmark]: Boogie Preprocessor took 17.34ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 112.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 14:47:08,659 INFO L158 Benchmark]: RCFGBuilder took 225.34ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 99.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 14:47:08,659 INFO L158 Benchmark]: TraceAbstraction took 869.05ms. Allocated memory was 142.6MB in the beginning and 178.3MB in the end (delta: 35.7MB). Free memory was 99.3MB in the beginning and 121.8MB in the end (delta: -22.5MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2022-07-13 14:47:08,659 INFO L158 Benchmark]: Witness Printer took 2.60ms. Allocated memory is still 178.3MB. Free memory was 121.8MB in the beginning and 120.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 14:47:08,661 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.18ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 98.0MB in the end (delta: 120.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 293.59ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 115.5MB in the end (delta: -3.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.13ms. Allocated memory is still 142.6MB. Free memory was 115.5MB in the beginning and 114.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.34ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 112.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 225.34ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 99.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 869.05ms. Allocated memory was 142.6MB in the beginning and 178.3MB in the end (delta: 35.7MB). Free memory was 99.3MB in the beginning and 121.8MB in the end (delta: -22.5MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * Witness Printer took 2.60ms. Allocated memory is still 178.3MB. Free memory was 121.8MB in the beginning and 120.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 87]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someUnaryDOUBLEoperation at line 81. Possible FailurePath: [L81] double x = -0.0; [L82] double y = 0.0; [L83] CALL, EXPR fmax_double(x, y) [L54] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=4294967298] [L26] __uint32_t msw, lsw; VAL [\old(x)=4294967298, x=4294967298] [L29] ieee_double_shape_type ew_u; [L30] ew_u.value = (x) [L31] EXPR ew_u.parts.msw [L31] (msw) = ew_u.parts.msw [L32] EXPR ew_u.parts.lsw [L32] (lsw) = ew_u.parts.lsw [L35-L36] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=4294967298, lsw=4294967297, msw=4293918721, x=4294967298] [L38-L39] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=4294967298, lsw=4294967297, msw=4293918721, x=4294967298] [L41-L42] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=4294967298, lsw=4294967297, msw=4293918721, x=4294967298] [L45-L46] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L49] return 0; VAL [\old(x)=4294967298, \result=0, lsw=4294967297, msw=4293918721, x=4294967298] [L54] RET, EXPR __fpclassify_double(x) VAL [\old(x)=4294967298, \old(y)=0, __fpclassify_double(x)=0, x=4294967298, y=0] [L54] COND TRUE __fpclassify_double(x) == 0 [L55] return y; VAL [\old(x)=4294967298, \old(y)=0, \result=0, x=4294967298, y=0] [L83] RET, EXPR fmax_double(x, y) [L83] double res = fmax_double(x, y); [L86] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [res=0, res == 0.0 && __signbit_double(res) == 0=0, x=4294967298, y=0] [L86] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L87] reach_error() VAL [res=0, x=4294967298, y=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 591 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 406 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 95 IncrementalHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 185 mSDtfsCounter, 95 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=2, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 207 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-13 14:47:08,708 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/double_req_bl_1252a.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 2743c9c1eae15f6a9812481781d831b3850f89be91644ec8a207d83f9a71b29e --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 14:47:10,479 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 14:47:10,481 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 14:47:10,506 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 14:47:10,507 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 14:47:10,508 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 14:47:10,513 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 14:47:10,515 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 14:47:10,517 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 14:47:10,521 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 14:47:10,522 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 14:47:10,525 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 14:47:10,526 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 14:47:10,528 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 14:47:10,529 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 14:47:10,530 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 14:47:10,530 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 14:47:10,532 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 14:47:10,535 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 14:47:10,539 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 14:47:10,540 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 14:47:10,541 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 14:47:10,543 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 14:47:10,543 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 14:47:10,544 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 14:47:10,558 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 14:47:10,559 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 14:47:10,559 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 14:47:10,560 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 14:47:10,560 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 14:47:10,561 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 14:47:10,561 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 14:47:10,562 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 14:47:10,563 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 14:47:10,564 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 14:47:10,565 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 14:47:10,565 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 14:47:10,565 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 14:47:10,566 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 14:47:10,566 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 14:47:10,566 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 14:47:10,567 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 14:47:10,573 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-13 14:47:10,599 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 14:47:10,599 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 14:47:10,600 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 14:47:10,600 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 14:47:10,600 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 14:47:10,601 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 14:47:10,601 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 14:47:10,601 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 14:47:10,601 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 14:47:10,602 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 14:47:10,602 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 14:47:10,602 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 14:47:10,603 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 14:47:10,603 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 14:47:10,603 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 14:47:10,603 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 14:47:10,603 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 14:47:10,603 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 14:47:10,604 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 14:47:10,604 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 14:47:10,604 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 14:47:10,604 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 14:47:10,604 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 14:47:10,604 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 14:47:10,604 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 14:47:10,604 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 14:47:10,605 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:47:10,605 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 14:47:10,605 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 14:47:10,605 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 14:47:10,605 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 14:47:10,605 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 14:47:10,606 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 14:47:10,606 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 14:47:10,606 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 14:47:10,606 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 14:47:10,606 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 -> 2743c9c1eae15f6a9812481781d831b3850f89be91644ec8a207d83f9a71b29e [2022-07-13 14:47:10,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 14:47:10,877 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 14:47:10,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 14:47:10,879 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 14:47:10,880 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 14:47:10,881 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2022-07-13 14:47:10,919 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b163dfd14/8a758bb256e14ba9b73d3e7aa33244c0/FLAG91434e359 [2022-07-13 14:47:11,307 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 14:47:11,308 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2022-07-13 14:47:11,313 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b163dfd14/8a758bb256e14ba9b73d3e7aa33244c0/FLAG91434e359 [2022-07-13 14:47:11,328 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b163dfd14/8a758bb256e14ba9b73d3e7aa33244c0 [2022-07-13 14:47:11,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 14:47:11,331 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 14:47:11,334 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 14:47:11,334 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 14:47:11,337 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 14:47:11,337 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:47:11" (1/1) ... [2022-07-13 14:47:11,340 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48f7a178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:47:11, skipping insertion in model container [2022-07-13 14:47:11,340 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:47:11" (1/1) ... [2022-07-13 14:47:11,344 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 14:47:11,360 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 14:47:11,509 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/double_req_bl_1252a.c[2154,2167] [2022-07-13 14:47:11,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:47:11,536 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 14:47:11,579 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/double_req_bl_1252a.c[2154,2167] [2022-07-13 14:47:11,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:47:11,592 INFO L208 MainTranslator]: Completed translation [2022-07-13 14:47:11,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:47:11 WrapperNode [2022-07-13 14:47:11,593 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 14:47:11,594 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 14:47:11,594 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 14:47:11,594 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 14:47:11,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:47:11" (1/1) ... [2022-07-13 14:47:11,613 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:47:11" (1/1) ... [2022-07-13 14:47:11,629 INFO L137 Inliner]: procedures = 21, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 65 [2022-07-13 14:47:11,629 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 14:47:11,630 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 14:47:11,630 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 14:47:11,631 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 14:47:11,637 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:47:11" (1/1) ... [2022-07-13 14:47:11,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:47:11" (1/1) ... [2022-07-13 14:47:11,646 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:47:11" (1/1) ... [2022-07-13 14:47:11,646 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:47:11" (1/1) ... [2022-07-13 14:47:11,662 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:47:11" (1/1) ... [2022-07-13 14:47:11,668 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:47:11" (1/1) ... [2022-07-13 14:47:11,670 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:47:11" (1/1) ... [2022-07-13 14:47:11,675 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 14:47:11,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 14:47:11,678 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 14:47:11,678 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 14:47:11,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:47:11" (1/1) ... [2022-07-13 14:47:11,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:47:11,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 14:47:11,716 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 14:47:11,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 14:47:11,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 14:47:11,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-07-13 14:47:11,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 14:47:11,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 14:47:11,748 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2022-07-13 14:47:11,748 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2022-07-13 14:47:11,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-13 14:47:11,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 14:47:11,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 14:47:11,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 14:47:11,818 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 14:47:11,820 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 14:47:11,935 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 14:47:11,941 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 14:47:11,942 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-13 14:47:11,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:47:11 BoogieIcfgContainer [2022-07-13 14:47:11,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 14:47:11,944 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 14:47:11,945 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 14:47:11,946 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 14:47:11,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 02:47:11" (1/3) ... [2022-07-13 14:47:11,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b6fcbbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:47:11, skipping insertion in model container [2022-07-13 14:47:11,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:47:11" (2/3) ... [2022-07-13 14:47:11,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b6fcbbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:47:11, skipping insertion in model container [2022-07-13 14:47:11,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:47:11" (3/3) ... [2022-07-13 14:47:11,948 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252a.c [2022-07-13 14:47:11,957 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 14:47:11,958 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 14:47:11,984 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 14:47:11,988 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@602379e2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@df879fc [2022-07-13 14:47:11,989 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 14:47:11,991 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 25 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 14:47:11,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 14:47:11,996 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:47:11,996 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:47:11,997 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:47:12,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:47:12,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1130952206, now seen corresponding path program 1 times [2022-07-13 14:47:12,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:47:12,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [306508833] [2022-07-13 14:47:12,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:47:12,010 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:47:12,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:47:12,012 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:47:12,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-13 14:47:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:47:12,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-13 14:47:12,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:47:12,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:47:12,090 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:47:12,091 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:47:12,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [306508833] [2022-07-13 14:47:12,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [306508833] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:47:12,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:47:12,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 14:47:12,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177724592] [2022-07-13 14:47:12,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:47:12,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 14:47:12,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:47:12,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 14:47:12,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 14:47:12,116 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 25 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:47:12,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:47:12,130 INFO L93 Difference]: Finished difference Result 55 states and 82 transitions. [2022-07-13 14:47:12,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 14:47:12,131 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-07-13 14:47:12,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:47:12,136 INFO L225 Difference]: With dead ends: 55 [2022-07-13 14:47:12,137 INFO L226 Difference]: Without dead ends: 26 [2022-07-13 14:47:12,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 14:47:12,142 INFO L413 NwaCegarLoop]: 37 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, 37 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 [2022-07-13 14:47:12,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 14:47:12,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-13 14:47:12,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-07-13 14:47:12,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 14:47:12,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2022-07-13 14:47:12,167 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 13 [2022-07-13 14:47:12,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:47:12,168 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2022-07-13 14:47:12,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:47:12,168 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2022-07-13 14:47:12,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-13 14:47:12,169 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:47:12,170 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:47:12,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-13 14:47:12,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:47:12,379 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:47:12,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:47:12,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1285201507, now seen corresponding path program 1 times [2022-07-13 14:47:12,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:47:12,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [986129207] [2022-07-13 14:47:12,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:47:12,383 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:47:12,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:47:12,385 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:47:12,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-13 14:47:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:47:12,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 14:47:12,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:47:12,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:47:12,479 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:47:12,480 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:47:12,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [986129207] [2022-07-13 14:47:12,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [986129207] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:47:12,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:47:12,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 14:47:12,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081981903] [2022-07-13 14:47:12,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:47:12,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 14:47:12,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:47:12,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 14:47:12,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 14:47:12,483 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:47:12,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:47:12,500 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-07-13 14:47:12,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 14:47:12,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-07-13 14:47:12,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:47:12,502 INFO L225 Difference]: With dead ends: 38 [2022-07-13 14:47:12,502 INFO L226 Difference]: Without dead ends: 29 [2022-07-13 14:47:12,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 14:47:12,504 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:47:12,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 14:47:12,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-13 14:47:12,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-07-13 14:47:12,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 14:47:12,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2022-07-13 14:47:12,509 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 14 [2022-07-13 14:47:12,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:47:12,510 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2022-07-13 14:47:12,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:47:12,510 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2022-07-13 14:47:12,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-13 14:47:12,510 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:47:12,511 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:47:12,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-13 14:47:12,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:47:12,719 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:47:12,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:47:12,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1497908235, now seen corresponding path program 1 times [2022-07-13 14:47:12,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:47:12,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [239881116] [2022-07-13 14:47:12,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:47:12,721 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:47:12,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:47:12,733 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:47:12,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-13 14:47:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:47:12,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 14:47:12,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:47:12,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:47:12,919 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:47:12,919 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:47:12,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [239881116] [2022-07-13 14:47:12,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [239881116] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:47:12,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:47:12,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 14:47:12,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909883574] [2022-07-13 14:47:12,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:47:12,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 14:47:12,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:47:12,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 14:47:12,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 14:47:12,921 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:47:12,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:47:12,964 INFO L93 Difference]: Finished difference Result 56 states and 73 transitions. [2022-07-13 14:47:12,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 14:47:12,965 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-07-13 14:47:12,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:47:12,965 INFO L225 Difference]: With dead ends: 56 [2022-07-13 14:47:12,966 INFO L226 Difference]: Without dead ends: 31 [2022-07-13 14:47:12,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 14:47:12,967 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 18 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:47:12,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 102 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 25 Unchecked, 0.0s Time] [2022-07-13 14:47:12,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-13 14:47:12,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-13 14:47:12,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 14:47:12,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2022-07-13 14:47:12,972 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 15 [2022-07-13 14:47:12,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:47:12,972 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2022-07-13 14:47:12,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:47:12,973 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2022-07-13 14:47:12,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 14:47:12,973 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:47:12,973 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:47:12,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-13 14:47:13,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:47:13,182 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:47:13,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:47:13,183 INFO L85 PathProgramCache]: Analyzing trace with hash -2116811041, now seen corresponding path program 1 times [2022-07-13 14:47:13,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:47:13,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [915790579] [2022-07-13 14:47:13,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:47:13,184 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:47:13,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:47:13,185 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:47:13,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-13 14:47:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:47:13,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 14:47:13,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:47:13,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:47:13,241 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:47:13,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:47:13,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [915790579] [2022-07-13 14:47:13,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [915790579] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:47:13,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:47:13,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 14:47:13,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223679375] [2022-07-13 14:47:13,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:47:13,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 14:47:13,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:47:13,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 14:47:13,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 14:47:13,244 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:47:13,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:47:13,603 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-07-13 14:47:13,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 14:47:13,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-07-13 14:47:13,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:47:13,605 INFO L225 Difference]: With dead ends: 43 [2022-07-13 14:47:13,605 INFO L226 Difference]: Without dead ends: 34 [2022-07-13 14:47:13,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 14:47:13,606 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 14:47:13,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 14:47:13,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-13 14:47:13,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2022-07-13 14:47:13,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 14:47:13,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2022-07-13 14:47:13,611 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 16 [2022-07-13 14:47:13,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:47:13,611 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2022-07-13 14:47:13,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:47:13,611 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2022-07-13 14:47:13,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 14:47:13,612 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:47:13,612 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:47:13,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-13 14:47:13,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:47:13,813 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:47:13,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:47:13,817 INFO L85 PathProgramCache]: Analyzing trace with hash 172315143, now seen corresponding path program 1 times [2022-07-13 14:47:13,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:47:13,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [99640134] [2022-07-13 14:47:13,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:47:13,818 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:47:13,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:47:13,821 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:47:13,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-13 14:47:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:47:13,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 14:47:13,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:47:13,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:47:13,991 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:47:13,991 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:47:13,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [99640134] [2022-07-13 14:47:13,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [99640134] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:47:13,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:47:13,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 14:47:13,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356834660] [2022-07-13 14:47:13,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:47:13,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 14:47:13,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:47:13,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 14:47:13,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 14:47:13,993 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:47:14,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:47:14,080 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-07-13 14:47:14,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 14:47:14,082 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-07-13 14:47:14,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:47:14,083 INFO L225 Difference]: With dead ends: 57 [2022-07-13 14:47:14,083 INFO L226 Difference]: Without dead ends: 30 [2022-07-13 14:47:14,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 14:47:14,084 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 18 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 14:47:14,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 88 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 25 Unchecked, 0.1s Time] [2022-07-13 14:47:14,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-13 14:47:14,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-07-13 14:47:14,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 14:47:14,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2022-07-13 14:47:14,087 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 17 [2022-07-13 14:47:14,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:47:14,087 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-07-13 14:47:14,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:47:14,087 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-07-13 14:47:14,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 14:47:14,088 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:47:14,088 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:47:14,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-13 14:47:14,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:47:14,296 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:47:14,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:47:14,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1943218574, now seen corresponding path program 1 times [2022-07-13 14:47:14,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:47:14,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1930528939] [2022-07-13 14:47:14,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:47:14,297 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:47:14,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:47:14,298 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:47:14,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-13 14:47:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:47:14,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 14:47:14,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:47:14,369 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 14:47:14,369 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:47:14,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:47:14,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1930528939] [2022-07-13 14:47:14,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1930528939] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:47:14,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:47:14,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 14:47:14,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513568188] [2022-07-13 14:47:14,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:47:14,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 14:47:14,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:47:14,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 14:47:14,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 14:47:14,371 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 14:47:14,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:47:14,402 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-07-13 14:47:14,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 14:47:14,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-07-13 14:47:14,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:47:14,405 INFO L225 Difference]: With dead ends: 40 [2022-07-13 14:47:14,405 INFO L226 Difference]: Without dead ends: 31 [2022-07-13 14:47:14,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 14:47:14,409 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:47:14,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 14:47:14,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-13 14:47:14,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-13 14:47:14,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 14:47:14,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-07-13 14:47:14,420 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 22 [2022-07-13 14:47:14,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:47:14,420 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-07-13 14:47:14,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 14:47:14,421 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-07-13 14:47:14,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-13 14:47:14,422 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:47:14,422 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:47:14,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-13 14:47:14,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:47:14,631 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:47:14,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:47:14,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1682849308, now seen corresponding path program 1 times [2022-07-13 14:47:14,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:47:14,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [415435540] [2022-07-13 14:47:14,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:47:14,634 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:47:14,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:47:14,635 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:47:14,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-13 14:47:14,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:47:14,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 14:47:14,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:47:14,787 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 14:47:14,787 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:47:14,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:47:14,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [415435540] [2022-07-13 14:47:14,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [415435540] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:47:14,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:47:14,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 14:47:14,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980940840] [2022-07-13 14:47:14,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:47:14,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 14:47:14,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:47:14,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 14:47:14,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 14:47:14,789 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 14:47:14,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:47:14,820 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-07-13 14:47:14,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 14:47:14,821 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-07-13 14:47:14,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:47:14,821 INFO L225 Difference]: With dead ends: 45 [2022-07-13 14:47:14,821 INFO L226 Difference]: Without dead ends: 31 [2022-07-13 14:47:14,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 14:47:14,822 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 16 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:47:14,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 102 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 19 Unchecked, 0.0s Time] [2022-07-13 14:47:14,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-13 14:47:14,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-13 14:47:14,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 14:47:14,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2022-07-13 14:47:14,825 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 23 [2022-07-13 14:47:14,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:47:14,825 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-07-13 14:47:14,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 14:47:14,826 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-07-13 14:47:14,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-13 14:47:14,826 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:47:14,826 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:47:14,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-13 14:47:15,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:47:15,034 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:47:15,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:47:15,034 INFO L85 PathProgramCache]: Analyzing trace with hash 474937390, now seen corresponding path program 1 times [2022-07-13 14:47:15,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:47:15,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2094769921] [2022-07-13 14:47:15,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:47:15,035 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:47:15,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:47:15,036 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:47:15,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-13 14:47:15,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:47:15,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 14:47:15,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:47:15,108 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 14:47:15,108 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:47:15,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:47:15,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2094769921] [2022-07-13 14:47:15,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2094769921] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:47:15,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:47:15,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 14:47:15,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242487084] [2022-07-13 14:47:15,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:47:15,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 14:47:15,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:47:15,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 14:47:15,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 14:47:15,110 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 14:47:15,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:47:15,359 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2022-07-13 14:47:15,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 14:47:15,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-07-13 14:47:15,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:47:15,360 INFO L225 Difference]: With dead ends: 41 [2022-07-13 14:47:15,361 INFO L226 Difference]: Without dead ends: 32 [2022-07-13 14:47:15,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 14:47:15,361 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 14:47:15,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 14:47:15,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-13 14:47:15,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2022-07-13 14:47:15,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 14:47:15,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-07-13 14:47:15,364 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 24 [2022-07-13 14:47:15,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:47:15,364 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-07-13 14:47:15,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 14:47:15,364 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-07-13 14:47:15,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-13 14:47:15,364 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:47:15,365 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:47:15,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-13 14:47:15,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:47:15,565 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:47:15,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:47:15,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1777787178, now seen corresponding path program 1 times [2022-07-13 14:47:15,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:47:15,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [113961828] [2022-07-13 14:47:15,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:47:15,567 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:47:15,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:47:15,584 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:47:15,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-13 14:47:15,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:47:15,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 14:47:15,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:47:15,719 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 14:47:15,719 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:47:15,719 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:47:15,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [113961828] [2022-07-13 14:47:15,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [113961828] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:47:15,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:47:15,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 14:47:15,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735227650] [2022-07-13 14:47:15,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:47:15,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 14:47:15,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:47:15,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 14:47:15,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 14:47:15,721 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 14:47:15,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:47:15,772 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-07-13 14:47:15,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 14:47:15,773 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-07-13 14:47:15,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:47:15,774 INFO L225 Difference]: With dead ends: 42 [2022-07-13 14:47:15,774 INFO L226 Difference]: Without dead ends: 39 [2022-07-13 14:47:15,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-07-13 14:47:15,774 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 34 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:47:15,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 114 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 14:47:15,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-13 14:47:15,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2022-07-13 14:47:15,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 14:47:15,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-07-13 14:47:15,777 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 24 [2022-07-13 14:47:15,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:47:15,777 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-07-13 14:47:15,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 14:47:15,777 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-07-13 14:47:15,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-13 14:47:15,778 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:47:15,778 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:47:15,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-13 14:47:15,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:47:15,986 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:47:15,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:47:15,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1835045480, now seen corresponding path program 1 times [2022-07-13 14:47:15,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:47:15,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2073572145] [2022-07-13 14:47:15,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:47:15,987 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:47:15,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:47:15,988 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:47:15,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-13 14:47:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:47:16,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 14:47:16,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:47:16,086 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 14:47:16,086 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:47:16,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:47:16,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2073572145] [2022-07-13 14:47:16,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2073572145] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:47:16,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:47:16,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 14:47:16,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587610456] [2022-07-13 14:47:16,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:47:16,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 14:47:16,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:47:16,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 14:47:16,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 14:47:16,088 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 14:47:16,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:47:16,108 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-07-13 14:47:16,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 14:47:16,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-07-13 14:47:16,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:47:16,109 INFO L225 Difference]: With dead ends: 41 [2022-07-13 14:47:16,109 INFO L226 Difference]: Without dead ends: 31 [2022-07-13 14:47:16,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 14:47:16,109 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 12 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:47:16,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 41 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 14:47:16,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-13 14:47:16,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-13 14:47:16,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 14:47:16,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-07-13 14:47:16,112 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 24 [2022-07-13 14:47:16,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:47:16,112 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-07-13 14:47:16,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 14:47:16,112 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-07-13 14:47:16,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-13 14:47:16,113 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:47:16,113 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:47:16,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-13 14:47:16,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:47:16,315 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:47:16,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:47:16,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1323122336, now seen corresponding path program 1 times [2022-07-13 14:47:16,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:47:16,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [494487582] [2022-07-13 14:47:16,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:47:16,316 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:47:16,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:47:16,331 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:47:16,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-13 14:47:16,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:47:16,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 14:47:16,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:47:16,467 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 14:47:16,467 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:47:16,467 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:47:16,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [494487582] [2022-07-13 14:47:16,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [494487582] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:47:16,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:47:16,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 14:47:16,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138635445] [2022-07-13 14:47:16,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:47:16,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 14:47:16,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:47:16,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 14:47:16,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 14:47:16,469 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 14:47:16,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:47:16,530 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-07-13 14:47:16,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 14:47:16,531 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-07-13 14:47:16,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:47:16,531 INFO L225 Difference]: With dead ends: 42 [2022-07-13 14:47:16,531 INFO L226 Difference]: Without dead ends: 25 [2022-07-13 14:47:16,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 14:47:16,532 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 14 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:47:16,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 84 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 16 Unchecked, 0.0s Time] [2022-07-13 14:47:16,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-13 14:47:16,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-07-13 14:47:16,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 14:47:16,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-07-13 14:47:16,534 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 25 [2022-07-13 14:47:16,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:47:16,534 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-07-13 14:47:16,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 14:47:16,535 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-07-13 14:47:16,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-13 14:47:16,535 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:47:16,535 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:47:16,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-07-13 14:47:16,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:47:16,743 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:47:16,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:47:16,743 INFO L85 PathProgramCache]: Analyzing trace with hash 2065734315, now seen corresponding path program 1 times [2022-07-13 14:47:16,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:47:16,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [276518230] [2022-07-13 14:47:16,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:47:16,743 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:47:16,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:47:16,744 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:47:16,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-13 14:47:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:47:16,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-13 14:47:16,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:47:16,977 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 14:47:16,977 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:47:16,977 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:47:16,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [276518230] [2022-07-13 14:47:16,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [276518230] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:47:16,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:47:16,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 14:47:16,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623273248] [2022-07-13 14:47:16,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:47:16,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 14:47:16,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:47:16,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 14:47:16,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-13 14:47:16,978 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 14:47:17,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:47:17,076 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-07-13 14:47:17,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 14:47:17,076 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-07-13 14:47:17,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:47:17,077 INFO L225 Difference]: With dead ends: 25 [2022-07-13 14:47:17,077 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 14:47:17,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-07-13 14:47:17,077 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 18 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:47:17,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 130 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 7 Unchecked, 0.0s Time] [2022-07-13 14:47:17,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 14:47:17,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 14:47:17,078 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) [2022-07-13 14:47:17,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 14:47:17,078 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2022-07-13 14:47:17,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:47:17,078 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 14:47:17,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 14:47:17,078 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 14:47:17,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 14:47:17,080 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 14:47:17,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-13 14:47:17,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:47:17,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-13 14:47:17,364 INFO L899 garLoopResultBuilder]: For program point __fpclassify_doubleFINAL(lines 25 50) no Hoare annotation was computed. [2022-07-13 14:47:17,365 INFO L902 garLoopResultBuilder]: At program point __fpclassify_doubleENTRY(lines 25 50) the Hoare annotation is: true [2022-07-13 14:47:17,365 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 49) no Hoare annotation was computed. [2022-07-13 14:47:17,365 INFO L899 garLoopResultBuilder]: For program point L28-1(lines 28 33) no Hoare annotation was computed. [2022-07-13 14:47:17,365 INFO L895 garLoopResultBuilder]: At program point L28-2(lines 28 33) the Hoare annotation is: (= |__fpclassify_double_#in~x| __fpclassify_double_~x) [2022-07-13 14:47:17,365 INFO L899 garLoopResultBuilder]: For program point L28-3(lines 25 50) no Hoare annotation was computed. [2022-07-13 14:47:17,365 INFO L899 garLoopResultBuilder]: For program point __fpclassify_doubleEXIT(lines 25 50) no Hoare annotation was computed. [2022-07-13 14:47:17,365 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 49) no Hoare annotation was computed. [2022-07-13 14:47:17,365 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 49) no Hoare annotation was computed. [2022-07-13 14:47:17,365 INFO L895 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: (and (= |ULTIMATE.start_fmax_double_~x#1| (fp.neg (_ +zero 11 53))) (= (_ +zero 11 53) |ULTIMATE.start_fmax_double_~y#1|)) [2022-07-13 14:47:17,365 INFO L899 garLoopResultBuilder]: For program point L56-1(lines 56 57) no Hoare annotation was computed. [2022-07-13 14:47:17,365 INFO L899 garLoopResultBuilder]: For program point L65-1(lines 65 69) no Hoare annotation was computed. [2022-07-13 14:47:17,365 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 14:47:17,365 INFO L895 garLoopResultBuilder]: At program point L65-2(lines 65 69) the Hoare annotation is: (and (= |ULTIMATE.start_fmax_double_~x#1| (fp.neg (_ +zero 11 53))) |ULTIMATE.start_main_#t~short12#1| (= (_ +zero 11 53) |ULTIMATE.start_fmax_double_~y#1|) (= |ULTIMATE.start_main_~res~0#1| (_ +zero 11 53)) (= (_ +zero 11 53) |ULTIMATE.start_fmax_double_#res#1|) (= (_ +zero 11 53) |ULTIMATE.start___signbit_double_~x#1|)) [2022-07-13 14:47:17,365 INFO L899 garLoopResultBuilder]: For program point L65-3(lines 65 69) no Hoare annotation was computed. [2022-07-13 14:47:17,365 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-13 14:47:17,365 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-13 14:47:17,366 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 87) no Hoare annotation was computed. [2022-07-13 14:47:17,366 INFO L899 garLoopResultBuilder]: For program point L86(line 86) no Hoare annotation was computed. [2022-07-13 14:47:17,366 INFO L899 garLoopResultBuilder]: For program point L86-2(lines 86 89) no Hoare annotation was computed. [2022-07-13 14:47:17,366 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-13 14:47:17,366 INFO L902 garLoopResultBuilder]: At program point L91(lines 74 92) the Hoare annotation is: true [2022-07-13 14:47:17,366 INFO L899 garLoopResultBuilder]: For program point L87(line 87) no Hoare annotation was computed. [2022-07-13 14:47:17,366 INFO L895 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: (and (= |ULTIMATE.start_fmax_double_~x#1| (fp.neg (_ +zero 11 53))) (= (_ +zero 11 53) |ULTIMATE.start_fmax_double_~y#1|)) [2022-07-13 14:47:17,366 INFO L899 garLoopResultBuilder]: For program point L54-1(lines 54 55) no Hoare annotation was computed. [2022-07-13 14:47:17,366 INFO L895 garLoopResultBuilder]: At program point L71(lines 62 72) the Hoare annotation is: (and (= |ULTIMATE.start_fmax_double_~x#1| (fp.neg (_ +zero 11 53))) |ULTIMATE.start_main_#t~short12#1| (= (_ +zero 11 53) |ULTIMATE.start_fmax_double_~y#1|) (= (_ bv0 32) |ULTIMATE.start___signbit_double_#res#1|)) [2022-07-13 14:47:17,366 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2022-07-13 14:47:17,366 INFO L899 garLoopResultBuilder]: For program point L59-2(line 59) no Hoare annotation was computed. [2022-07-13 14:47:17,366 INFO L895 garLoopResultBuilder]: At program point L59-3(lines 52 60) the Hoare annotation is: (and (= |ULTIMATE.start_fmax_double_~x#1| (fp.neg (_ +zero 11 53))) (= (_ +zero 11 53) |ULTIMATE.start_fmax_double_~y#1|) (= (_ +zero 11 53) |ULTIMATE.start_fmax_double_#res#1|)) [2022-07-13 14:47:17,368 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:47:17,369 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 14:47:17,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 02:47:17 BoogieIcfgContainer [2022-07-13 14:47:17,378 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 14:47:17,379 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 14:47:17,379 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 14:47:17,379 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 14:47:17,379 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:47:11" (3/4) ... [2022-07-13 14:47:17,381 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-13 14:47:17,385 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_double [2022-07-13 14:47:17,387 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-07-13 14:47:17,387 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-07-13 14:47:17,387 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-13 14:47:17,388 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-13 14:47:17,402 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2022-07-13 14:47:17,402 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ~Pluszero~LONGDOUBLE() == y) && ~Pluszero~LONGDOUBLE() == \result [2022-07-13 14:47:17,403 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && ~Pluszero~LONGDOUBLE() == y) && res == ~Pluszero~LONGDOUBLE()) && ~Pluszero~LONGDOUBLE() == \result) && ~Pluszero~LONGDOUBLE() == x [2022-07-13 14:47:17,403 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && ~Pluszero~LONGDOUBLE() == y) && 0bv32 == \result [2022-07-13 14:47:17,409 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 14:47:17,409 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 14:47:17,409 INFO L158 Benchmark]: Toolchain (without parser) took 6078.45ms. Allocated memory was 71.3MB in the beginning and 96.5MB in the end (delta: 25.2MB). Free memory was 53.7MB in the beginning and 58.7MB in the end (delta: -4.9MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2022-07-13 14:47:17,409 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 71.3MB. Free memory was 52.0MB in the beginning and 51.9MB in the end (delta: 94.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 14:47:17,410 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.43ms. Allocated memory is still 71.3MB. Free memory was 53.5MB in the beginning and 52.7MB in the end (delta: 797.5kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 14:47:17,410 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.71ms. Allocated memory is still 71.3MB. Free memory was 52.7MB in the beginning and 51.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 14:47:17,410 INFO L158 Benchmark]: Boogie Preprocessor took 46.43ms. Allocated memory is still 71.3MB. Free memory was 51.2MB in the beginning and 49.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 14:47:17,410 INFO L158 Benchmark]: RCFGBuilder took 265.86ms. Allocated memory is still 71.3MB. Free memory was 49.7MB in the beginning and 37.7MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 14:47:17,411 INFO L158 Benchmark]: TraceAbstraction took 5433.75ms. Allocated memory was 71.3MB in the beginning and 96.5MB in the end (delta: 25.2MB). Free memory was 37.1MB in the beginning and 62.0MB in the end (delta: -24.9MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. [2022-07-13 14:47:17,411 INFO L158 Benchmark]: Witness Printer took 30.37ms. Allocated memory is still 96.5MB. Free memory was 61.1MB in the beginning and 58.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 14:47:17,412 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.19ms. Allocated memory is still 71.3MB. Free memory was 52.0MB in the beginning and 51.9MB in the end (delta: 94.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 259.43ms. Allocated memory is still 71.3MB. Free memory was 53.5MB in the beginning and 52.7MB in the end (delta: 797.5kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.71ms. Allocated memory is still 71.3MB. Free memory was 52.7MB in the beginning and 51.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.43ms. Allocated memory is still 71.3MB. Free memory was 51.2MB in the beginning and 49.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 265.86ms. Allocated memory is still 71.3MB. Free memory was 49.7MB in the beginning and 37.7MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5433.75ms. Allocated memory was 71.3MB in the beginning and 96.5MB in the end (delta: 25.2MB). Free memory was 37.1MB in the beginning and 62.0MB in the end (delta: -24.9MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. * Witness Printer took 30.37ms. Allocated memory is still 96.5MB. Free memory was 61.1MB in the beginning and 58.7MB in the end (delta: 2.4MB). 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 - PositiveResult [Line: 87]: 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 2 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 136 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 130 mSDsluCounter, 1068 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 92 IncrementalHoareTripleChecker+Unchecked, 718 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 155 IncrementalHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 350 mSDtfsCounter, 155 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=9, InterpolantAutomatonStates: 66, 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, 12 MinimizatonAttempts, 15 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 16 PreInvPairs, 23 NumberOfFragments, 62 HoareAnnotationTreeSize, 16 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 43 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 245 NumberOfCodeBlocks, 245 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 233 ConstructedInterpolants, 26 QuantifiedInterpolants, 800 SizeOfPredicates, 46 NumberOfNonLiveVariables, 891 ConjunctsInSsa, 89 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 42/42 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 1 specifications checked. All of them hold - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: ((x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && ~Pluszero~LONGDOUBLE() == y) && 0bv32 == \result - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: ((((x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && ~Pluszero~LONGDOUBLE() == y) && res == ~Pluszero~LONGDOUBLE()) && ~Pluszero~LONGDOUBLE() == \result) && ~Pluszero~LONGDOUBLE() == x - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: (x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ~Pluszero~LONGDOUBLE() == y) && ~Pluszero~LONGDOUBLE() == \result - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: \old(x) == x RESULT: Ultimate proved your program to be correct! [2022-07-13 14:47:17,451 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 Writing output log to file Ultimate.log Result: TRUE