./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1231b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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_1231b.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 b9ce4e199e47d30d5336dd9ca9dceb5f51006e4e1d59090b80d072b498beba7b --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:03:56,398 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:03:56,432 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:03:56,463 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:03:56,464 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:03:56,465 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:03:56,466 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:03:56,467 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:03:56,469 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:03:56,469 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:03:56,470 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:03:56,471 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:03:56,472 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:03:56,473 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:03:56,474 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:03:56,475 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:03:56,475 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:03:56,476 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:03:56,478 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:03:56,480 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:03:56,481 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:03:56,482 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:03:56,483 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:03:56,484 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:03:56,485 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:03:56,487 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:03:56,488 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:03:56,488 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:03:56,489 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:03:56,489 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:03:56,490 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:03:56,491 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:03:56,491 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:03:56,492 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:03:56,493 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:03:56,494 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:03:56,494 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:03:56,495 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:03:56,495 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:03:56,495 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:03:56,496 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:03:56,497 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:03:56,497 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 03:03:56,516 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:03:56,516 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:03:56,517 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:03:56,517 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:03:56,518 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:03:56,518 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:03:56,518 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:03:56,519 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:03:56,519 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:03:56,519 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:03:56,519 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:03:56,519 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 03:03:56,520 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:03:56,520 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:03:56,520 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:03:56,520 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:03:56,521 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:03:56,521 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:03:56,521 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:03:56,521 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:03:56,521 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:03:56,522 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:03:56,522 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:03:56,522 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:03:56,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:03:56,522 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:03:56,523 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:03:56,523 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:03:56,523 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 03:03:56,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 03:03:56,524 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:03:56,524 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:03:56,524 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:03:56,524 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 -> b9ce4e199e47d30d5336dd9ca9dceb5f51006e4e1d59090b80d072b498beba7b [2022-07-12 03:03:56,731 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:03:56,748 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:03:56,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:03:56,751 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:03:56,752 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:03:56,753 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2022-07-12 03:03:56,804 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f1f5ea60/ce5bec17a3f946faacc649681cab4ead/FLAG48096b4be [2022-07-12 03:03:57,217 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:03:57,218 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2022-07-12 03:03:57,225 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f1f5ea60/ce5bec17a3f946faacc649681cab4ead/FLAG48096b4be [2022-07-12 03:03:57,237 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f1f5ea60/ce5bec17a3f946faacc649681cab4ead [2022-07-12 03:03:57,240 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:03:57,241 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:03:57,243 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:03:57,243 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:03:57,245 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:03:57,246 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:03:57" (1/1) ... [2022-07-12 03:03:57,247 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1db22139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:57, skipping insertion in model container [2022-07-12 03:03:57,247 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:03:57" (1/1) ... [2022-07-12 03:03:57,252 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:03:57,266 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:03:57,428 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_1231b.c[1765,1778] [2022-07-12 03:03:57,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:03:57,440 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:03:57,469 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_1231b.c[1765,1778] [2022-07-12 03:03:57,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:03:57,485 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:03:57,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:57 WrapperNode [2022-07-12 03:03:57,486 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:03:57,487 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:03:57,488 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:03:57,488 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:03:57,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:57" (1/1) ... [2022-07-12 03:03:57,500 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:57" (1/1) ... [2022-07-12 03:03:57,514 INFO L137 Inliner]: procedures = 18, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 52 [2022-07-12 03:03:57,514 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:03:57,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:03:57,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:03:57,515 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:03:57,521 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:57" (1/1) ... [2022-07-12 03:03:57,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:57" (1/1) ... [2022-07-12 03:03:57,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:57" (1/1) ... [2022-07-12 03:03:57,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:57" (1/1) ... [2022-07-12 03:03:57,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:57" (1/1) ... [2022-07-12 03:03:57,531 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:57" (1/1) ... [2022-07-12 03:03:57,532 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:57" (1/1) ... [2022-07-12 03:03:57,534 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:03:57,534 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:03:57,534 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:03:57,535 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:03:57,535 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:57" (1/1) ... [2022-07-12 03:03:57,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:03:57,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:03:57,563 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-12 03:03:57,569 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-12 03:03:57,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:03:57,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 03:03:57,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 03:03:57,593 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2022-07-12 03:03:57,593 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2022-07-12 03:03:57,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-07-12 03:03:57,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:03:57,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:03:57,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 03:03:57,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 03:03:57,683 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:03:57,684 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:03:57,870 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:03:57,880 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:03:57,881 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-12 03:03:57,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:03:57 BoogieIcfgContainer [2022-07-12 03:03:57,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:03:57,884 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:03:57,884 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:03:57,887 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:03:57,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:03:57" (1/3) ... [2022-07-12 03:03:57,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4833db78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:03:57, skipping insertion in model container [2022-07-12 03:03:57,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:57" (2/3) ... [2022-07-12 03:03:57,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4833db78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:03:57, skipping insertion in model container [2022-07-12 03:03:57,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:03:57" (3/3) ... [2022-07-12 03:03:57,889 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1231b.c [2022-07-12 03:03:57,900 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:03:57,900 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 03:03:57,945 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:03:57,952 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@7e4299a5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@70d3f8e5 [2022-07-12 03:03:57,952 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 03:03:57,956 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 24 states have (on average 1.5) internal successors, (36), 25 states have internal predecessors, (36), 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-12 03:03:57,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 03:03:57,961 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:03:57,962 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:03:57,962 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:03:57,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:03:57,967 INFO L85 PathProgramCache]: Analyzing trace with hash 87468236, now seen corresponding path program 1 times [2022-07-12 03:03:57,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:03:57,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490231447] [2022-07-12 03:03:57,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:03:57,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:03:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:03:58,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 03:03:58,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:03:58,154 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-12 03:03:58,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:03:58,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490231447] [2022-07-12 03:03:58,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490231447] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:03:58,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:03:58,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:03:58,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394991549] [2022-07-12 03:03:58,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:03:58,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:03:58,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:03:58,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:03:58,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:03:58,201 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.5) internal successors, (36), 25 states have internal predecessors, (36), 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.333333333333333) internal successors, (13), 2 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-12 03:03:58,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:03:58,240 INFO L93 Difference]: Finished difference Result 53 states and 75 transitions. [2022-07-12 03:03:58,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:03:58,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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-12 03:03:58,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:03:58,250 INFO L225 Difference]: With dead ends: 53 [2022-07-12 03:03:58,250 INFO L226 Difference]: Without dead ends: 25 [2022-07-12 03:03:58,253 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-12 03:03:58,258 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:03:58,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 68 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:03:58,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-12 03:03:58,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-07-12 03:03:58,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 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-12 03:03:58,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-07-12 03:03:58,304 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 15 [2022-07-12 03:03:58,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:03:58,304 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-07-12 03:03:58,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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-12 03:03:58,305 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-07-12 03:03:58,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 03:03:58,307 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:03:58,307 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:03:58,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 03:03:58,309 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:03:58,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:03:58,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1072117413, now seen corresponding path program 1 times [2022-07-12 03:03:58,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:03:58,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722523058] [2022-07-12 03:03:58,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:03:58,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:03:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:03:58,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 03:03:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:03:58,488 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-12 03:03:58,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:03:58,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722523058] [2022-07-12 03:03:58,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722523058] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:03:58,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:03:58,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:03:58,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681844066] [2022-07-12 03:03:58,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:03:58,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:03:58,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:03:58,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:03:58,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:03:58,494 INFO L87 Difference]: Start difference. First operand 25 states and 32 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-12 03:03:58,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:03:58,537 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-07-12 03:03:58,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:03:58,538 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-12 03:03:58,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:03:58,540 INFO L225 Difference]: With dead ends: 33 [2022-07-12 03:03:58,541 INFO L226 Difference]: Without dead ends: 29 [2022-07-12 03:03:58,547 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-12 03:03:58,548 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:03:58,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 103 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:03:58,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-12 03:03:58,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-07-12 03:03:58,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 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-12 03:03:58,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-07-12 03:03:58,565 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 16 [2022-07-12 03:03:58,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:03:58,567 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-07-12 03:03:58,567 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-12 03:03:58,567 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-07-12 03:03:58,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 03:03:58,568 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:03:58,572 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:03:58,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 03:03:58,573 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:03:58,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:03:58,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1361378825, now seen corresponding path program 1 times [2022-07-12 03:03:58,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:03:58,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237520687] [2022-07-12 03:03:58,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:03:58,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:03:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:03:58,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 03:03:58,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:03:58,684 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-12 03:03:58,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:03:58,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237520687] [2022-07-12 03:03:58,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237520687] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:03:58,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:03:58,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:03:58,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941950116] [2022-07-12 03:03:58,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:03:58,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:03:58,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:03:58,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:03:58,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:03:58,687 INFO L87 Difference]: Start difference. First operand 29 states and 37 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-12 03:03:58,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:03:58,729 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-07-12 03:03:58,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:03:58,730 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-12 03:03:58,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:03:58,731 INFO L225 Difference]: With dead ends: 37 [2022-07-12 03:03:58,731 INFO L226 Difference]: Without dead ends: 33 [2022-07-12 03:03:58,731 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-12 03:03:58,732 INFO L413 NwaCegarLoop]: 34 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, 119 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-12 03:03:58,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 119 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:03:58,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-12 03:03:58,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2022-07-12 03:03:58,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 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-12 03:03:58,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-07-12 03:03:58,737 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 17 [2022-07-12 03:03:58,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:03:58,738 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-07-12 03:03:58,738 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-12 03:03:58,738 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-07-12 03:03:58,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 03:03:58,739 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:03:58,739 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-12 03:03:58,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 03:03:58,739 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:03:58,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:03:58,739 INFO L85 PathProgramCache]: Analyzing trace with hash -2128342377, now seen corresponding path program 1 times [2022-07-12 03:03:58,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:03:58,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003236095] [2022-07-12 03:03:58,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:03:58,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:03:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:03:58,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 03:03:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:03:58,852 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-12 03:03:58,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:03:58,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003236095] [2022-07-12 03:03:58,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003236095] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:03:58,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:03:58,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:03:58,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287727419] [2022-07-12 03:03:58,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:03:58,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:03:58,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:03:58,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:03:58,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:03:58,858 INFO L87 Difference]: Start difference. First operand 29 states and 37 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-12 03:03:58,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:03:58,896 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-07-12 03:03:58,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:03:58,897 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-12 03:03:58,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:03:58,898 INFO L225 Difference]: With dead ends: 37 [2022-07-12 03:03:58,898 INFO L226 Difference]: Without dead ends: 33 [2022-07-12 03:03:58,898 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-12 03:03:58,899 INFO L413 NwaCegarLoop]: 34 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, 119 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-12 03:03:58,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 119 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:03:58,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-12 03:03:58,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2022-07-12 03:03:58,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 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-12 03:03:58,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-07-12 03:03:58,905 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 18 [2022-07-12 03:03:58,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:03:58,905 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-07-12 03:03:58,905 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-12 03:03:58,906 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-07-12 03:03:58,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 03:03:58,906 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:03:58,906 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:03:58,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 03:03:58,907 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:03:58,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:03:58,907 INFO L85 PathProgramCache]: Analyzing trace with hash -259243195, now seen corresponding path program 1 times [2022-07-12 03:03:58,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:03:58,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405621520] [2022-07-12 03:03:58,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:03:58,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:03:58,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:03:58,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 03:03:58,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:03:58,972 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-12 03:03:58,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:03:58,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405621520] [2022-07-12 03:03:58,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405621520] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:03:58,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:03:58,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:03:58,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476720303] [2022-07-12 03:03:58,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:03:58,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:03:58,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:03:58,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:03:58,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:03:58,975 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-12 03:03:58,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:03:58,998 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-07-12 03:03:58,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:03:58,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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 19 [2022-07-12 03:03:58,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:03:58,999 INFO L225 Difference]: With dead ends: 37 [2022-07-12 03:03:59,000 INFO L226 Difference]: Without dead ends: 33 [2022-07-12 03:03:59,000 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-12 03:03:59,001 INFO L413 NwaCegarLoop]: 34 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, 119 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-12 03:03:59,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 119 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:03:59,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-12 03:03:59,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2022-07-12 03:03:59,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 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-12 03:03:59,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-07-12 03:03:59,006 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 19 [2022-07-12 03:03:59,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:03:59,007 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-07-12 03:03:59,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-12 03:03:59,007 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-07-12 03:03:59,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 03:03:59,008 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:03:59,008 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:03:59,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 03:03:59,008 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:03:59,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:03:59,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1483567140, now seen corresponding path program 1 times [2022-07-12 03:03:59,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:03:59,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998774833] [2022-07-12 03:03:59,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:03:59,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:03:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 03:03:59,035 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 03:03:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 03:03:59,078 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 03:03:59,078 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 03:03:59,079 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 03:03:59,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 03:03:59,084 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-07-12 03:03:59,086 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 03:03:59,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 03:03:59 BoogieIcfgContainer [2022-07-12 03:03:59,120 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 03:03:59,120 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 03:03:59,120 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 03:03:59,121 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 03:03:59,121 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:03:57" (3/4) ... [2022-07-12 03:03:59,123 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-12 03:03:59,123 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 03:03:59,124 INFO L158 Benchmark]: Toolchain (without parser) took 1882.83ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 72.3MB in the beginning and 86.9MB in the end (delta: -14.6MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2022-07-12 03:03:59,124 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 100.7MB. Free memory was 56.0MB in the beginning and 55.9MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:03:59,125 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.69ms. Allocated memory is still 100.7MB. Free memory was 72.1MB in the beginning and 76.2MB in the end (delta: -4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 03:03:59,125 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.44ms. Allocated memory is still 100.7MB. Free memory was 75.9MB in the beginning and 74.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:03:59,125 INFO L158 Benchmark]: Boogie Preprocessor took 18.53ms. Allocated memory is still 100.7MB. Free memory was 74.4MB in the beginning and 73.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:03:59,125 INFO L158 Benchmark]: RCFGBuilder took 348.03ms. Allocated memory is still 100.7MB. Free memory was 73.1MB in the beginning and 61.9MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 03:03:59,126 INFO L158 Benchmark]: TraceAbstraction took 1236.02ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 61.2MB in the beginning and 86.9MB in the end (delta: -25.6MB). Peak memory consumption was 924.5kB. Max. memory is 16.1GB. [2022-07-12 03:03:59,126 INFO L158 Benchmark]: Witness Printer took 2.88ms. Allocated memory is still 125.8MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:03:59,128 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 100.7MB. Free memory was 56.0MB in the beginning and 55.9MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 243.69ms. Allocated memory is still 100.7MB. Free memory was 72.1MB in the beginning and 76.2MB in the end (delta: -4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.44ms. Allocated memory is still 100.7MB. Free memory was 75.9MB in the beginning and 74.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.53ms. Allocated memory is still 100.7MB. Free memory was 74.4MB in the beginning and 73.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 348.03ms. Allocated memory is still 100.7MB. Free memory was 73.1MB in the beginning and 61.9MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1236.02ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 61.2MB in the beginning and 86.9MB in the end (delta: -25.6MB). Peak memory consumption was 924.5kB. Max. memory is 16.1GB. * Witness Printer took 2.88ms. Allocated memory is still 125.8MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 70]: 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 69, overapproximation of someBinaryArithmeticDOUBLEoperation at line 63. Possible FailurePath: [L62] double x = __VERIFIER_nondet_double(); [L63] double y = 0.0 / 0.0; [L64] CALL, EXPR isnan_double(x) [L18] return x != x; VAL [\old(x)=4294967298, \result=0, x=4294967298] [L64] RET, EXPR isnan_double(x) [L64] COND TRUE !isnan_double(x) [L66] CALL, EXPR fmin_double(x, y) [L47] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=4294967298] [L20] __uint32_t msw, lsw; VAL [\old(x)=4294967298, x=4294967298] [L23] ieee_double_shape_type ew_u; [L24] ew_u.value = (x) [L25] EXPR ew_u.parts.msw [L25] (msw) = ew_u.parts.msw [L26] EXPR ew_u.parts.lsw [L26] (lsw) = ew_u.parts.lsw [L29-L30] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=4294967298, lsw=4294967297, msw=4293918721, x=4294967298] [L32-L33] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=4294967298, lsw=4294967297, msw=4293918721, x=4294967298] [L35-L36] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=4294967298, lsw=4294967297, msw=4293918721, x=4294967298] [L39-L40] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L43] return 0; VAL [\old(x)=4294967298, \result=0, lsw=4294967297, msw=4293918721, x=4294967298] [L47] RET, EXPR __fpclassify_double(x) VAL [\old(x)=4294967298, \old(y)=4294967299, __fpclassify_double(x)=0, x=4294967298, y=4294967299] [L47] COND TRUE __fpclassify_double(x) == 0 [L48] return y; VAL [\old(x)=4294967298, \old(y)=4294967299, \result=4294967299, x=4294967298, y=4294967299] [L66] RET, EXPR fmin_double(x, y) [L66] double res = fmin_double(x, y); [L69] COND TRUE res != x VAL [res=4294967299, x=4294967298, y=4294967299] [L70] reach_error() VAL [res=4294967299, x=4294967298, y=4294967299] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 528 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 361 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 90 IncrementalHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 167 mSDtfsCounter, 90 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=29occurred in iteration=0, 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.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 104 NumberOfCodeBlocks, 104 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 212 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-12 03:03:59,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1231b.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 b9ce4e199e47d30d5336dd9ca9dceb5f51006e4e1d59090b80d072b498beba7b --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:04:01,066 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:04:01,069 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:04:01,108 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:04:01,109 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:04:01,110 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:04:01,114 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:04:01,117 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:04:01,119 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:04:01,123 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:04:01,124 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:04:01,128 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:04:01,128 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:04:01,131 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:04:01,132 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:04:01,135 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:04:01,136 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:04:01,137 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:04:01,139 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:04:01,145 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:04:01,146 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:04:01,147 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:04:01,149 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:04:01,150 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:04:01,151 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:04:01,156 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:04:01,158 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:04:01,158 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:04:01,159 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:04:01,159 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:04:01,160 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:04:01,160 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:04:01,162 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:04:01,162 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:04:01,163 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:04:01,164 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:04:01,164 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:04:01,166 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:04:01,166 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:04:01,167 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:04:01,167 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:04:01,168 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:04:01,171 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-12 03:04:01,203 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:04:01,203 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:04:01,204 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:04:01,204 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:04:01,205 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:04:01,205 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:04:01,206 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:04:01,206 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:04:01,206 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:04:01,207 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:04:01,207 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:04:01,207 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:04:01,208 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:04:01,208 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:04:01,208 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:04:01,208 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:04:01,208 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 03:04:01,209 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 03:04:01,209 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 03:04:01,209 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:04:01,209 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:04:01,209 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:04:01,210 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:04:01,210 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:04:01,210 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:04:01,210 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:04:01,211 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:04:01,211 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:04:01,211 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:04:01,211 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:04:01,212 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 03:04:01,212 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 03:04:01,212 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:04:01,212 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:04:01,213 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:04:01,213 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 03:04:01,213 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 -> b9ce4e199e47d30d5336dd9ca9dceb5f51006e4e1d59090b80d072b498beba7b [2022-07-12 03:04:01,530 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:04:01,550 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:04:01,552 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:04:01,553 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:04:01,553 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:04:01,555 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2022-07-12 03:04:01,611 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f77084ac3/c085c6de7c6f4e23af724b1c7c3cb3bd/FLAGd808564a3 [2022-07-12 03:04:02,065 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:04:02,066 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2022-07-12 03:04:02,076 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f77084ac3/c085c6de7c6f4e23af724b1c7c3cb3bd/FLAGd808564a3 [2022-07-12 03:04:02,096 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f77084ac3/c085c6de7c6f4e23af724b1c7c3cb3bd [2022-07-12 03:04:02,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:04:02,100 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:04:02,103 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:04:02,103 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:04:02,106 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:04:02,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:04:02" (1/1) ... [2022-07-12 03:04:02,108 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fa9f23e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:04:02, skipping insertion in model container [2022-07-12 03:04:02,108 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:04:02" (1/1) ... [2022-07-12 03:04:02,115 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:04:02,129 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:04:02,267 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_1231b.c[1765,1778] [2022-07-12 03:04:02,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:04:02,316 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:04:02,353 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_1231b.c[1765,1778] [2022-07-12 03:04:02,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:04:02,371 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:04:02,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:04:02 WrapperNode [2022-07-12 03:04:02,372 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:04:02,373 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:04:02,373 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:04:02,373 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:04:02,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:04:02" (1/1) ... [2022-07-12 03:04:02,397 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:04:02" (1/1) ... [2022-07-12 03:04:02,414 INFO L137 Inliner]: procedures = 21, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 50 [2022-07-12 03:04:02,414 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:04:02,416 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:04:02,416 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:04:02,416 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:04:02,422 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:04:02" (1/1) ... [2022-07-12 03:04:02,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:04:02" (1/1) ... [2022-07-12 03:04:02,433 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:04:02" (1/1) ... [2022-07-12 03:04:02,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:04:02" (1/1) ... [2022-07-12 03:04:02,451 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:04:02" (1/1) ... [2022-07-12 03:04:02,454 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:04:02" (1/1) ... [2022-07-12 03:04:02,463 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:04:02" (1/1) ... [2022-07-12 03:04:02,466 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:04:02,467 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:04:02,467 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:04:02,467 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:04:02,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:04:02" (1/1) ... [2022-07-12 03:04:02,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:04:02,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:04:02,506 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-12 03:04:02,507 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-12 03:04:02,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:04:02,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-07-12 03:04:02,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 03:04:02,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 03:04:02,542 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2022-07-12 03:04:02,542 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2022-07-12 03:04:02,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-12 03:04:02,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:04:02,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:04:02,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 03:04:02,650 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:04:02,651 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:04:02,900 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:04:02,909 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:04:02,911 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-12 03:04:02,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:04:02 BoogieIcfgContainer [2022-07-12 03:04:02,913 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:04:02,914 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:04:02,916 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:04:02,918 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:04:02,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:04:02" (1/3) ... [2022-07-12 03:04:02,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@763edacb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:04:02, skipping insertion in model container [2022-07-12 03:04:02,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:04:02" (2/3) ... [2022-07-12 03:04:02,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@763edacb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:04:02, skipping insertion in model container [2022-07-12 03:04:02,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:04:02" (3/3) ... [2022-07-12 03:04:02,923 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1231b.c [2022-07-12 03:04:02,935 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:04:02,936 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 03:04:03,010 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:04:03,021 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@6988be3e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@59d57203 [2022-07-12 03:04:03,022 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 03:04:03,028 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 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-12 03:04:03,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 03:04:03,034 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:04:03,035 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:04:03,036 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:04:03,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:04:03,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1684133472, now seen corresponding path program 1 times [2022-07-12 03:04:03,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:04:03,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [144986990] [2022-07-12 03:04:03,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:04:03,052 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:04:03,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:04:03,063 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-12 03:04:03,100 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-12 03:04:03,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:04:03,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-12 03:04:03,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:04:03,174 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-12 03:04:03,174 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:04:03,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:04:03,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [144986990] [2022-07-12 03:04:03,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [144986990] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:04:03,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:04:03,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 03:04:03,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834097071] [2022-07-12 03:04:03,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:04:03,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 03:04:03,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:04:03,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 03:04:03,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:04:03,213 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 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 6.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-12 03:04:03,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:04:03,232 INFO L93 Difference]: Finished difference Result 49 states and 71 transitions. [2022-07-12 03:04:03,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 03:04:03,233 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.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-12 03:04:03,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:04:03,239 INFO L225 Difference]: With dead ends: 49 [2022-07-12 03:04:03,239 INFO L226 Difference]: Without dead ends: 23 [2022-07-12 03:04:03,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 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-12 03:04:03,244 INFO L413 NwaCegarLoop]: 35 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, 35 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-12 03:04:03,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:04:03,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-12 03:04:03,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-07-12 03:04:03,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 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-12 03:04:03,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2022-07-12 03:04:03,277 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 14 [2022-07-12 03:04:03,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:04:03,278 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2022-07-12 03:04:03,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.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-12 03:04:03,278 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-07-12 03:04:03,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 03:04:03,279 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:04:03,279 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:04:03,290 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-12 03:04:03,488 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-12 03:04:03,489 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:04:03,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:04:03,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1014515731, now seen corresponding path program 1 times [2022-07-12 03:04:03,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:04:03,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1184615661] [2022-07-12 03:04:03,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:04:03,491 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:04:03,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:04:03,492 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-12 03:04:03,494 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-12 03:04:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:04:03,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 03:04:03,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:04:03,625 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-12 03:04:03,625 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:04:03,626 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:04:03,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1184615661] [2022-07-12 03:04:03,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1184615661] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:04:03,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:04:03,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:04:03,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559885393] [2022-07-12 03:04:03,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:04:03,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:04:03,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:04:03,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:04:03,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:04:03,629 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-12 03:04:03,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:04:03,710 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-07-12 03:04:03,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:04:03,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-12 03:04:03,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:04:03,713 INFO L225 Difference]: With dead ends: 30 [2022-07-12 03:04:03,713 INFO L226 Difference]: Without dead ends: 26 [2022-07-12 03:04:03,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 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-12 03:04:03,715 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 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.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:04:03,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:04:03,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-12 03:04:03,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-07-12 03:04:03,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 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-12 03:04:03,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2022-07-12 03:04:03,724 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 15 [2022-07-12 03:04:03,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:04:03,724 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2022-07-12 03:04:03,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-12 03:04:03,725 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2022-07-12 03:04:03,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 03:04:03,725 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:04:03,725 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:04:03,742 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-12 03:04:03,938 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-12 03:04:03,939 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:04:03,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:04:03,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1185853373, now seen corresponding path program 1 times [2022-07-12 03:04:03,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:04:03,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2105293022] [2022-07-12 03:04:03,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:04:03,940 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:04:03,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:04:03,942 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-12 03:04:03,959 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-12 03:04:04,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:04:04,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 03:04:04,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:04:04,030 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-12 03:04:04,030 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:04:04,031 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:04:04,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2105293022] [2022-07-12 03:04:04,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2105293022] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:04:04,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:04:04,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:04:04,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562521080] [2022-07-12 03:04:04,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:04:04,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:04:04,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:04:04,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:04:04,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:04:04,033 INFO L87 Difference]: Start difference. First operand 26 states and 34 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-12 03:04:04,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:04:04,096 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2022-07-12 03:04:04,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:04:04,096 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-12 03:04:04,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:04:04,097 INFO L225 Difference]: With dead ends: 33 [2022-07-12 03:04:04,097 INFO L226 Difference]: Without dead ends: 29 [2022-07-12 03:04:04,097 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-12 03:04:04,098 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 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.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:04:04,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:04:04,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-12 03:04:04,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2022-07-12 03:04:04,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 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-12 03:04:04,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2022-07-12 03:04:04,103 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 16 [2022-07-12 03:04:04,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:04:04,104 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2022-07-12 03:04:04,104 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-12 03:04:04,104 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2022-07-12 03:04:04,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 03:04:04,105 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:04:04,105 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:04:04,117 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-12 03:04:04,315 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-12 03:04:04,316 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:04:04,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:04:04,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1347661745, now seen corresponding path program 1 times [2022-07-12 03:04:04,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:04:04,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1041420012] [2022-07-12 03:04:04,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:04:04,317 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:04:04,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:04:04,319 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-12 03:04:04,322 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-12 03:04:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:04:04,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 03:04:04,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:04:04,420 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-12 03:04:04,420 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:04:04,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:04:04,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1041420012] [2022-07-12 03:04:04,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1041420012] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:04:04,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:04:04,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:04:04,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350891447] [2022-07-12 03:04:04,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:04:04,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:04:04,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:04:04,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:04:04,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:04:04,422 INFO L87 Difference]: Start difference. First operand 26 states and 34 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, (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-12 03:04:04,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:04:04,443 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2022-07-12 03:04:04,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:04:04,445 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, (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-12 03:04:04,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:04:04,446 INFO L225 Difference]: With dead ends: 33 [2022-07-12 03:04:04,446 INFO L226 Difference]: Without dead ends: 29 [2022-07-12 03:04:04,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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-12 03:04:04,447 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 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.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:04:04,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:04:04,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-12 03:04:04,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2022-07-12 03:04:04,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 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-12 03:04:04,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2022-07-12 03:04:04,452 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 17 [2022-07-12 03:04:04,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:04:04,452 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2022-07-12 03:04:04,452 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, (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-12 03:04:04,453 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2022-07-12 03:04:04,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 03:04:04,453 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:04:04,453 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-12 03:04:04,463 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-12 03:04:04,658 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-12 03:04:04,658 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:04:04,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:04:04,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1832266503, now seen corresponding path program 1 times [2022-07-12 03:04:04,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:04:04,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2038411276] [2022-07-12 03:04:04,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:04:04,660 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:04:04,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:04:04,661 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-12 03:04:04,663 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-12 03:04:04,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:04:04,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 03:04:04,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:04:04,754 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-12 03:04:04,754 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:04:04,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:04:04,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2038411276] [2022-07-12 03:04:04,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2038411276] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:04:04,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:04:04,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:04:04,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271076666] [2022-07-12 03:04:04,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:04:04,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:04:04,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:04:04,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:04:04,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:04:04,756 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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-12 03:04:04,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:04:04,782 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2022-07-12 03:04:04,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:04:04,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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-12 03:04:04,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:04:04,784 INFO L225 Difference]: With dead ends: 33 [2022-07-12 03:04:04,784 INFO L226 Difference]: Without dead ends: 29 [2022-07-12 03:04:04,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 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-12 03:04:04,785 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 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.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:04:04,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:04:04,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-12 03:04:04,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2022-07-12 03:04:04,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 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-12 03:04:04,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2022-07-12 03:04:04,790 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 18 [2022-07-12 03:04:04,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:04:04,791 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2022-07-12 03:04:04,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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-12 03:04:04,791 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2022-07-12 03:04:04,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 03:04:04,791 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:04:04,792 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-12 03:04:04,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-12 03:04:05,003 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-12 03:04:05,004 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:04:05,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:04:05,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1575197112, now seen corresponding path program 1 times [2022-07-12 03:04:05,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:04:05,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [468516159] [2022-07-12 03:04:05,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:04:05,006 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:04:05,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:04:05,008 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-12 03:04:05,010 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-12 03:04:05,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:04:05,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-12 03:04:05,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:04:05,772 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-12 03:04:05,773 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:04:05,773 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:04:05,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [468516159] [2022-07-12 03:04:05,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [468516159] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:04:05,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:04:05,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 03:04:05,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314651066] [2022-07-12 03:04:05,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:04:05,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 03:04:05,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:04:05,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 03:04:05,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-12 03:04:05,776 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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-12 03:04:05,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:04:05,961 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-07-12 03:04:05,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 03:04:05,963 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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-12 03:04:05,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:04:05,964 INFO L225 Difference]: With dead ends: 45 [2022-07-12 03:04:05,964 INFO L226 Difference]: Without dead ends: 25 [2022-07-12 03:04:05,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-07-12 03:04:05,965 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 21 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:04:05,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 96 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 29 Unchecked, 0.1s Time] [2022-07-12 03:04:05,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-12 03:04:05,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-07-12 03:04:05,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 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-12 03:04:05,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2022-07-12 03:04:05,970 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 18 [2022-07-12 03:04:05,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:04:05,970 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-07-12 03:04:05,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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-12 03:04:05,970 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-07-12 03:04:05,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 03:04:05,971 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:04:05,975 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:04:06,000 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-12 03:04:06,186 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-12 03:04:06,187 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:04:06,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:04:06,187 INFO L85 PathProgramCache]: Analyzing trace with hash 789982401, now seen corresponding path program 1 times [2022-07-12 03:04:06,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:04:06,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [184457487] [2022-07-12 03:04:06,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:04:06,188 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:04:06,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:04:06,192 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-12 03:04:06,195 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-12 03:04:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:04:06,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 03:04:06,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:04:06,305 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-12 03:04:06,305 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:04:06,305 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:04:06,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [184457487] [2022-07-12 03:04:06,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [184457487] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:04:06,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:04:06,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:04:06,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046796152] [2022-07-12 03:04:06,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:04:06,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:04:06,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:04:06,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:04:06,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:04:06,307 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-12 03:04:06,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:04:06,419 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-07-12 03:04:06,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:04:06,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-12 03:04:06,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:04:06,424 INFO L225 Difference]: With dead ends: 32 [2022-07-12 03:04:06,424 INFO L226 Difference]: Without dead ends: 28 [2022-07-12 03:04:06,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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-12 03:04:06,425 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 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.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:04:06,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:04:06,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-12 03:04:06,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-07-12 03:04:06,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 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-12 03:04:06,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2022-07-12 03:04:06,430 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 23 [2022-07-12 03:04:06,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:04:06,430 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-07-12 03:04:06,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-12 03:04:06,430 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-07-12 03:04:06,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 03:04:06,431 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:04:06,431 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-12 03:04:06,445 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-12 03:04:06,632 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-12 03:04:06,632 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:04:06,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:04:06,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1141759769, now seen corresponding path program 1 times [2022-07-12 03:04:06,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:04:06,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272939682] [2022-07-12 03:04:06,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:04:06,633 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:04:06,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:04:06,634 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-12 03:04:06,635 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-12 03:04:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:04:06,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 03:04:06,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:04:06,749 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-12 03:04:06,749 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:04:06,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:04:06,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1272939682] [2022-07-12 03:04:06,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1272939682] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:04:06,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:04:06,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:04:06,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335315965] [2022-07-12 03:04:06,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:04:06,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:04:06,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:04:06,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:04:06,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:04:06,752 INFO L87 Difference]: Start difference. First operand 28 states and 35 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-12 03:04:06,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:04:06,801 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-07-12 03:04:06,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:04:06,801 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-12 03:04:06,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:04:06,802 INFO L225 Difference]: With dead ends: 35 [2022-07-12 03:04:06,802 INFO L226 Difference]: Without dead ends: 31 [2022-07-12 03:04:06,803 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-12 03:04:06,803 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 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.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:04:06,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:04:06,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-12 03:04:06,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-07-12 03:04:06,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 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-12 03:04:06,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2022-07-12 03:04:06,808 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 24 [2022-07-12 03:04:06,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:04:06,809 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-07-12 03:04:06,809 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-12 03:04:06,809 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-07-12 03:04:06,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 03:04:06,809 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:04:06,809 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-12 03:04:06,823 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-12 03:04:07,019 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-12 03:04:07,020 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:04:07,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:04:07,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1641177467, now seen corresponding path program 1 times [2022-07-12 03:04:07,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:04:07,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [743678655] [2022-07-12 03:04:07,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:04:07,021 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:04:07,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:04:07,022 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-12 03:04:07,022 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-12 03:04:07,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:04:07,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 03:04:07,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:04:07,121 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-12 03:04:07,121 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:04:07,121 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:04:07,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [743678655] [2022-07-12 03:04:07,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [743678655] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:04:07,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:04:07,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:04:07,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199721857] [2022-07-12 03:04:07,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:04:07,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:04:07,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:04:07,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:04:07,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:04:07,123 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-12 03:04:07,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:04:07,146 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-07-12 03:04:07,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:04:07,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-12 03:04:07,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:04:07,148 INFO L225 Difference]: With dead ends: 35 [2022-07-12 03:04:07,148 INFO L226 Difference]: Without dead ends: 31 [2022-07-12 03:04:07,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 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-12 03:04:07,149 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 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.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:04:07,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:04:07,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-12 03:04:07,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-07-12 03:04:07,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 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-12 03:04:07,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2022-07-12 03:04:07,155 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 25 [2022-07-12 03:04:07,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:04:07,156 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-07-12 03:04:07,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-12 03:04:07,156 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-07-12 03:04:07,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 03:04:07,156 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:04:07,156 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] [2022-07-12 03:04:07,168 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-12 03:04:07,363 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-12 03:04:07,364 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:04:07,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:04:07,364 INFO L85 PathProgramCache]: Analyzing trace with hash -984557701, now seen corresponding path program 1 times [2022-07-12 03:04:07,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:04:07,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1584131663] [2022-07-12 03:04:07,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:04:07,365 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:04:07,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:04:07,366 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-12 03:04:07,369 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-12 03:04:07,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:04:07,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 03:04:07,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:04:07,512 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-12 03:04:07,512 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:04:07,512 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:04:07,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1584131663] [2022-07-12 03:04:07,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1584131663] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:04:07,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:04:07,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:04:07,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284233804] [2022-07-12 03:04:07,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:04:07,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:04:07,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:04:07,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:04:07,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:04:07,513 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-12 03:04:07,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:04:07,516 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-07-12 03:04:07,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:04:07,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 25 [2022-07-12 03:04:07,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:04:07,517 INFO L225 Difference]: With dead ends: 37 [2022-07-12 03:04:07,517 INFO L226 Difference]: Without dead ends: 32 [2022-07-12 03:04:07,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 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-12 03:04:07,518 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 4 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:04:07,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 75 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 4 Unchecked, 0.0s Time] [2022-07-12 03:04:07,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-12 03:04:07,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2022-07-12 03:04:07,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 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-12 03:04:07,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-07-12 03:04:07,523 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 25 [2022-07-12 03:04:07,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:04:07,523 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-07-12 03:04:07,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-12 03:04:07,523 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-07-12 03:04:07,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 03:04:07,524 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:04:07,524 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] [2022-07-12 03:04:07,535 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-12 03:04:07,736 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-12 03:04:07,736 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:04:07,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:04:07,737 INFO L85 PathProgramCache]: Analyzing trace with hash -982710659, now seen corresponding path program 1 times [2022-07-12 03:04:07,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:04:07,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [699588603] [2022-07-12 03:04:07,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:04:07,737 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:04:07,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:04:07,738 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-12 03:04:07,739 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-12 03:04:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:04:07,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 03:04:07,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:04:07,993 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-12 03:04:07,993 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:04:07,993 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:04:07,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [699588603] [2022-07-12 03:04:07,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [699588603] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:04:07,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:04:07,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 03:04:07,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268666153] [2022-07-12 03:04:07,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:04:07,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 03:04:07,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:04:07,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 03:04:07,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:04:07,995 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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-12 03:04:08,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:04:08,023 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-07-12 03:04:08,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 03:04:08,023 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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-12 03:04:08,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:04:08,023 INFO L225 Difference]: With dead ends: 41 [2022-07-12 03:04:08,024 INFO L226 Difference]: Without dead ends: 34 [2022-07-12 03:04:08,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 03:04:08,024 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 7 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:04:08,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 122 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 24 Unchecked, 0.0s Time] [2022-07-12 03:04:08,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-12 03:04:08,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2022-07-12 03:04:08,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 03:04:08,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-07-12 03:04:08,029 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 25 [2022-07-12 03:04:08,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:04:08,029 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-07-12 03:04:08,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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-12 03:04:08,030 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-07-12 03:04:08,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 03:04:08,030 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:04:08,030 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, 1] [2022-07-12 03:04:08,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-12 03:04:08,242 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-12 03:04:08,242 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:04:08,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:04:08,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1961064157, now seen corresponding path program 1 times [2022-07-12 03:04:08,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:04:08,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1914399347] [2022-07-12 03:04:08,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:04:08,244 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:04:08,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:04:08,245 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-12 03:04:08,247 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-12 03:04:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:04:08,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 03:04:08,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:04:08,520 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-12 03:04:08,520 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:04:08,520 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:04:08,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1914399347] [2022-07-12 03:04:08,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1914399347] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:04:08,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:04:08,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 03:04:08,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692114609] [2022-07-12 03:04:08,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:04:08,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 03:04:08,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:04:08,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 03:04:08,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:04:08,522 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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-12 03:04:08,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:04:08,550 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-07-12 03:04:08,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 03:04:08,550 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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 26 [2022-07-12 03:04:08,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:04:08,551 INFO L225 Difference]: With dead ends: 43 [2022-07-12 03:04:08,551 INFO L226 Difference]: Without dead ends: 36 [2022-07-12 03:04:08,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 03:04:08,552 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 7 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:04:08,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 122 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 28 Unchecked, 0.0s Time] [2022-07-12 03:04:08,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-12 03:04:08,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2022-07-12 03:04:08,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 03:04:08,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-07-12 03:04:08,556 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 26 [2022-07-12 03:04:08,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:04:08,556 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-07-12 03:04:08,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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-12 03:04:08,557 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-07-12 03:04:08,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 03:04:08,557 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:04:08,557 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, 1] [2022-07-12 03:04:08,570 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-12 03:04:08,758 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-12 03:04:08,758 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:04:08,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:04:08,759 INFO L85 PathProgramCache]: Analyzing trace with hash -688209493, now seen corresponding path program 1 times [2022-07-12 03:04:08,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:04:08,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [405497828] [2022-07-12 03:04:08,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:04:08,759 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:04:08,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:04:08,760 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:04:08,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-12 03:04:08,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:04:08,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 03:04:08,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:04:08,859 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-12 03:04:08,859 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:04:08,859 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:04:08,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [405497828] [2022-07-12 03:04:08,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [405497828] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:04:08,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:04:08,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:04:08,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790751643] [2022-07-12 03:04:08,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:04:08,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:04:08,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:04:08,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:04:08,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:04:08,861 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 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-12 03:04:08,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:04:08,889 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-07-12 03:04:08,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:04:08,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 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 26 [2022-07-12 03:04:08,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:04:08,890 INFO L225 Difference]: With dead ends: 35 [2022-07-12 03:04:08,890 INFO L226 Difference]: Without dead ends: 31 [2022-07-12 03:04:08,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 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-12 03:04:08,891 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 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.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:04:08,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:04:08,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-12 03:04:08,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-07-12 03:04:08,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 03:04:08,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-07-12 03:04:08,895 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 26 [2022-07-12 03:04:08,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:04:08,896 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-07-12 03:04:08,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 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-12 03:04:08,896 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-07-12 03:04:08,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 03:04:08,896 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:04:08,897 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, 1] [2022-07-12 03:04:08,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-12 03:04:09,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:04:09,108 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:04:09,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:04:09,109 INFO L85 PathProgramCache]: Analyzing trace with hash 199294188, now seen corresponding path program 1 times [2022-07-12 03:04:09,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:04:09,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [686670164] [2022-07-12 03:04:09,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:04:09,109 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:04:09,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:04:09,111 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:04:09,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-12 03:04:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:04:09,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 03:04:09,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:04:09,775 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:04:09,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:04:10,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:04:10,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [686670164] [2022-07-12 03:04:10,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [686670164] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:04:10,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1251897080] [2022-07-12 03:04:10,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:04:10,111 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 03:04:10,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 03:04:10,119 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 03:04:10,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2022-07-12 03:04:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:04:10,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 03:04:10,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:04:10,811 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-12 03:04:10,811 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:04:10,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1251897080] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:04:10,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 03:04:10,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2022-07-12 03:04:10,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827091917] [2022-07-12 03:04:10,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:04:10,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 03:04:10,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:04:10,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 03:04:10,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-07-12 03:04:10,813 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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-12 03:04:11,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:04:11,650 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-07-12 03:04:11,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 03:04:11,651 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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 26 [2022-07-12 03:04:11,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:04:11,651 INFO L225 Difference]: With dead ends: 32 [2022-07-12 03:04:11,651 INFO L226 Difference]: Without dead ends: 28 [2022-07-12 03:04:11,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2022-07-12 03:04:11,652 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 17 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 03:04:11,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 105 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 03:04:11,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-12 03:04:11,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-07-12 03:04:11,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 03:04:11,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-07-12 03:04:11,656 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 26 [2022-07-12 03:04:11,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:04:11,656 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-12 03:04:11,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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-12 03:04:11,656 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-07-12 03:04:11,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 03:04:11,657 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:04:11,657 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, 1, 1] [2022-07-12 03:04:11,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Ended with exit code 0 [2022-07-12 03:04:11,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-12 03:04:12,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:04:12,062 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:04:12,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:04:12,063 INFO L85 PathProgramCache]: Analyzing trace with hash -865134783, now seen corresponding path program 1 times [2022-07-12 03:04:12,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:04:12,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [123926846] [2022-07-12 03:04:12,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:04:12,063 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:04:12,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:04:12,066 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:04:12,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-12 03:04:12,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:04:12,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 03:04:12,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:04:12,346 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-12 03:04:12,346 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:04:12,346 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:04:12,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [123926846] [2022-07-12 03:04:12,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [123926846] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:04:12,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:04:12,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 03:04:12,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34986319] [2022-07-12 03:04:12,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:04:12,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 03:04:12,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:04:12,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 03:04:12,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:04:12,348 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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-12 03:04:12,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:04:12,372 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-07-12 03:04:12,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 03:04:12,372 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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 27 [2022-07-12 03:04:12,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:04:12,373 INFO L225 Difference]: With dead ends: 36 [2022-07-12 03:04:12,373 INFO L226 Difference]: Without dead ends: 29 [2022-07-12 03:04:12,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 03:04:12,374 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 3 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:04:12,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 92 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 28 Unchecked, 0.0s Time] [2022-07-12 03:04:12,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-12 03:04:12,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-07-12 03:04:12,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 03:04:12,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-07-12 03:04:12,379 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 27 [2022-07-12 03:04:12,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:04:12,379 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-12 03:04:12,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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-12 03:04:12,380 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-07-12 03:04:12,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 03:04:12,380 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:04:12,380 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, 1, 1, 1] [2022-07-12 03:04:12,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-12 03:04:12,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:04:12,581 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:04:12,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:04:12,581 INFO L85 PathProgramCache]: Analyzing trace with hash 109054183, now seen corresponding path program 1 times [2022-07-12 03:04:12,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:04:12,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1036790303] [2022-07-12 03:04:12,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:04:12,582 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:04:12,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:04:12,583 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:04:12,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-12 03:04:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:04:12,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 03:04:12,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:04:12,849 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-12 03:04:12,849 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:04:12,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:04:12,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1036790303] [2022-07-12 03:04:12,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1036790303] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:04:12,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:04:12,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 03:04:12,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641765521] [2022-07-12 03:04:12,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:04:12,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 03:04:12,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:04:12,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 03:04:12,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:04:12,851 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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-12 03:04:12,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:04:12,876 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-07-12 03:04:12,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 03:04:12,876 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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 28 [2022-07-12 03:04:12,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:04:12,877 INFO L225 Difference]: With dead ends: 34 [2022-07-12 03:04:12,877 INFO L226 Difference]: Without dead ends: 27 [2022-07-12 03:04:12,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 03:04:12,878 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 3 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:04:12,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 82 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 28 Unchecked, 0.0s Time] [2022-07-12 03:04:12,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-12 03:04:12,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-07-12 03:04:12,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 03:04:12,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-07-12 03:04:12,881 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 28 [2022-07-12 03:04:12,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:04:12,881 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-07-12 03:04:12,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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-12 03:04:12,881 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-07-12 03:04:12,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 03:04:12,882 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:04:12,882 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, 1, 1, 1] [2022-07-12 03:04:12,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-12 03:04:13,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:04:13,096 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:04:13,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:04:13,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1698400280, now seen corresponding path program 1 times [2022-07-12 03:04:13,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:04:13,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1441318606] [2022-07-12 03:04:13,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:04:13,097 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:04:13,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:04:13,099 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:04:13,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-12 03:04:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:04:13,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 03:04:13,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:04:13,202 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-12 03:04:13,202 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:04:13,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:04:13,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1441318606] [2022-07-12 03:04:13,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1441318606] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:04:13,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:04:13,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:04:13,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2812492] [2022-07-12 03:04:13,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:04:13,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:04:13,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:04:13,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:04:13,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:04:13,208 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 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-12 03:04:13,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:04:13,229 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-07-12 03:04:13,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:04:13,229 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 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 28 [2022-07-12 03:04:13,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:04:13,230 INFO L225 Difference]: With dead ends: 25 [2022-07-12 03:04:13,230 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 03:04:13,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 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-12 03:04:13,231 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:04:13,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:04:13,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 03:04:13,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 03:04:13,231 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-12 03:04:13,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 03:04:13,232 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2022-07-12 03:04:13,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:04:13,232 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 03:04:13,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 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-12 03:04:13,232 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 03:04:13,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 03:04:13,234 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 03:04:13,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-12 03:04:13,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:04:13,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-12 03:04:13,676 INFO L899 garLoopResultBuilder]: For program point __fpclassify_doubleFINAL(lines 19 44) no Hoare annotation was computed. [2022-07-12 03:04:13,677 INFO L902 garLoopResultBuilder]: At program point __fpclassify_doubleENTRY(lines 19 44) the Hoare annotation is: true [2022-07-12 03:04:13,677 INFO L899 garLoopResultBuilder]: For program point L32(lines 32 43) no Hoare annotation was computed. [2022-07-12 03:04:13,677 INFO L899 garLoopResultBuilder]: For program point __fpclassify_doubleEXIT(lines 19 44) no Hoare annotation was computed. [2022-07-12 03:04:13,677 INFO L899 garLoopResultBuilder]: For program point L22-1(lines 22 27) no Hoare annotation was computed. [2022-07-12 03:04:13,677 INFO L895 garLoopResultBuilder]: At program point L22-2(lines 22 27) the Hoare annotation is: (= |__fpclassify_double_#in~x| __fpclassify_double_~x) [2022-07-12 03:04:13,677 INFO L899 garLoopResultBuilder]: For program point L22-3(lines 19 44) no Hoare annotation was computed. [2022-07-12 03:04:13,677 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 43) no Hoare annotation was computed. [2022-07-12 03:04:13,677 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 43) no Hoare annotation was computed. [2022-07-12 03:04:13,677 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-12 03:04:13,677 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 73) no Hoare annotation was computed. [2022-07-12 03:04:13,677 INFO L899 garLoopResultBuilder]: For program point L64-2(lines 64 73) no Hoare annotation was computed. [2022-07-12 03:04:13,677 INFO L899 garLoopResultBuilder]: For program point L52(line 52) no Hoare annotation was computed. [2022-07-12 03:04:13,677 INFO L899 garLoopResultBuilder]: For program point L52-2(line 52) no Hoare annotation was computed. [2022-07-12 03:04:13,677 INFO L895 garLoopResultBuilder]: At program point L52-3(lines 46 53) the Hoare annotation is: (and (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res#1|) (= |ULTIMATE.start_fmin_double_#res#1| |ULTIMATE.start_main_~x~0#1|) (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_fmin_double_~x#1| |ULTIMATE.start_main_~x~0#1|)) [2022-07-12 03:04:13,678 INFO L902 garLoopResultBuilder]: At program point L75(lines 55 76) the Hoare annotation is: true [2022-07-12 03:04:13,678 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 72) no Hoare annotation was computed. [2022-07-12 03:04:13,678 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-12 03:04:13,678 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-12 03:04:13,678 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-12 03:04:13,678 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 70) no Hoare annotation was computed. [2022-07-12 03:04:13,678 INFO L895 garLoopResultBuilder]: At program point L18(line 18) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_main_~y~0#1|)) (let ((.cse0 (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|))) (or (and (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res#1|) .cse0) (and (= (_ bv1 32) |ULTIMATE.start_isnan_double_#res#1|) (not .cse0))))) [2022-07-12 03:04:13,678 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (and (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res#1|) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~y#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)))) (fp.eq |ULTIMATE.start_fmin_double_~x#1| |ULTIMATE.start_fmin_double_~x#1|) (= |ULTIMATE.start_fmin_double_~x#1| |ULTIMATE.start_main_~x~0#1|)) [2022-07-12 03:04:13,678 INFO L899 garLoopResultBuilder]: For program point L49-1(lines 49 50) no Hoare annotation was computed. [2022-07-12 03:04:13,678 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (and (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res#1|) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~y#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)))) (fp.eq |ULTIMATE.start_fmin_double_~x#1| |ULTIMATE.start_fmin_double_~x#1|) (= |ULTIMATE.start_fmin_double_~x#1| |ULTIMATE.start_main_~x~0#1|)) [2022-07-12 03:04:13,678 INFO L899 garLoopResultBuilder]: For program point L47-1(lines 47 48) no Hoare annotation was computed. [2022-07-12 03:04:13,678 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2022-07-12 03:04:13,681 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:04:13,683 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 03:04:13,687 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:04:13,693 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:04:13,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 03:04:13 BoogieIcfgContainer [2022-07-12 03:04:13,700 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 03:04:13,701 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 03:04:13,701 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 03:04:13,701 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 03:04:13,702 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:04:02" (3/4) ... [2022-07-12 03:04:13,704 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-12 03:04:13,709 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_double [2022-07-12 03:04:13,714 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-07-12 03:04:13,715 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-07-12 03:04:13,715 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-12 03:04:13,715 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-12 03:04:13,737 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) && ((0bv32 == \result && ~fp.eq~DOUBLE(x, x)) || (1bv32 == \result && !~fp.eq~DOUBLE(x, x))) [2022-07-12 03:04:13,737 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2022-07-12 03:04:13,738 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0bv32 == \result && \result == x) && ~fp.eq~DOUBLE(x, x)) && x == x [2022-07-12 03:04:13,750 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 03:04:13,750 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 03:04:13,751 INFO L158 Benchmark]: Toolchain (without parser) took 11650.60ms. Allocated memory was 54.5MB in the beginning and 86.0MB in the end (delta: 31.5MB). Free memory was 32.0MB in the beginning and 29.4MB in the end (delta: 2.6MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. [2022-07-12 03:04:13,752 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 54.5MB. Free memory was 36.3MB in the beginning and 36.3MB in the end (delta: 46.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:04:13,752 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.41ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 31.8MB in the beginning and 50.0MB in the end (delta: -18.3MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2022-07-12 03:04:13,753 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.47ms. Allocated memory is still 67.1MB. Free memory was 49.8MB in the beginning and 48.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:04:13,753 INFO L158 Benchmark]: Boogie Preprocessor took 50.41ms. Allocated memory is still 67.1MB. Free memory was 48.4MB in the beginning and 47.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:04:13,753 INFO L158 Benchmark]: RCFGBuilder took 445.95ms. Allocated memory is still 67.1MB. Free memory was 46.8MB in the beginning and 35.6MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 03:04:13,754 INFO L158 Benchmark]: TraceAbstraction took 10785.85ms. Allocated memory was 67.1MB in the beginning and 86.0MB in the end (delta: 18.9MB). Free memory was 34.9MB in the beginning and 32.3MB in the end (delta: 2.6MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2022-07-12 03:04:13,754 INFO L158 Benchmark]: Witness Printer took 49.48ms. Allocated memory is still 86.0MB. Free memory was 32.3MB in the beginning and 29.4MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 03:04:13,758 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 54.5MB. Free memory was 36.3MB in the beginning and 36.3MB in the end (delta: 46.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 269.41ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 31.8MB in the beginning and 50.0MB in the end (delta: -18.3MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.47ms. Allocated memory is still 67.1MB. Free memory was 49.8MB in the beginning and 48.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.41ms. Allocated memory is still 67.1MB. Free memory was 48.4MB in the beginning and 47.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 445.95ms. Allocated memory is still 67.1MB. Free memory was 46.8MB in the beginning and 35.6MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10785.85ms. Allocated memory was 67.1MB in the beginning and 86.0MB in the end (delta: 18.9MB). Free memory was 34.9MB in the beginning and 32.3MB in the end (delta: 2.6MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. * Witness Printer took 49.48ms. Allocated memory is still 86.0MB. Free memory was 32.3MB in the beginning and 29.4MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] * 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: 70]: 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, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.7s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 66 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 62 mSDsluCounter, 1449 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 141 IncrementalHoareTripleChecker+Unchecked, 988 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 173 IncrementalHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 461 mSDtfsCounter, 173 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 416 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=11, InterpolantAutomatonStates: 91, 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, 17 MinimizatonAttempts, 37 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 13 PreInvPairs, 18 NumberOfFragments, 76 HoareAnnotationTreeSize, 13 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 254 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 407 NumberOfCodeBlocks, 407 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 389 ConstructedInterpolants, 65 QuantifiedInterpolants, 1643 SizeOfPredicates, 62 NumberOfNonLiveVariables, 1424 ConjunctsInSsa, 123 ConjunctsInUnsatCore, 18 InterpolantComputations, 17 PerfectInterpolantSequences, 67/72 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: 18]: Loop Invariant [2022-07-12 03:04:13,776 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:04:13,777 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) && ((0bv32 == \result && ~fp.eq~DOUBLE(x, x)) || (1bv32 == \result && !~fp.eq~DOUBLE(x, x))) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((0bv32 == \result && \result == x) && ~fp.eq~DOUBLE(x, x)) && x == x - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: \old(x) == x RESULT: Ultimate proved your program to be correct! [2022-07-12 03:04:13,819 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