./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1251b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ae007674 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_1251b.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 0ddb7cbdb5243e0dc5a18ffa5957d423189625fe9ffc6441855806502cce15ab --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-27 23:38:12,220 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-27 23:38:12,222 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-27 23:38:12,249 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-27 23:38:12,250 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-27 23:38:12,251 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-27 23:38:12,252 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-27 23:38:12,253 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-27 23:38:12,254 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-27 23:38:12,255 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-27 23:38:12,255 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-27 23:38:12,256 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-27 23:38:12,257 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-27 23:38:12,258 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-27 23:38:12,259 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-27 23:38:12,259 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-27 23:38:12,260 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-27 23:38:12,261 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-27 23:38:12,262 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-27 23:38:12,263 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-27 23:38:12,264 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-27 23:38:12,265 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-27 23:38:12,266 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-27 23:38:12,267 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-27 23:38:12,268 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-27 23:38:12,269 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-27 23:38:12,269 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-27 23:38:12,274 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-27 23:38:12,275 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-27 23:38:12,275 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-27 23:38:12,275 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-27 23:38:12,276 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-27 23:38:12,276 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-27 23:38:12,277 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-27 23:38:12,278 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-27 23:38:12,278 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-27 23:38:12,278 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-27 23:38:12,279 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-27 23:38:12,279 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-27 23:38:12,279 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-27 23:38:12,280 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-27 23:38:12,281 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-27 23:38:12,294 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-27 23:38:12,295 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-27 23:38:12,295 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-27 23:38:12,295 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-27 23:38:12,296 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-27 23:38:12,296 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-27 23:38:12,296 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-27 23:38:12,297 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-27 23:38:12,297 INFO L138 SettingsManager]: * Use SBE=true [2021-12-27 23:38:12,297 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-27 23:38:12,297 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-27 23:38:12,297 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-27 23:38:12,298 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-27 23:38:12,298 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-27 23:38:12,298 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-27 23:38:12,298 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-27 23:38:12,298 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-27 23:38:12,298 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-27 23:38:12,299 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-27 23:38:12,299 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-27 23:38:12,299 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-27 23:38:12,299 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-27 23:38:12,299 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-27 23:38:12,300 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-27 23:38:12,300 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 23:38:12,300 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-27 23:38:12,300 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-27 23:38:12,300 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-27 23:38:12,300 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-27 23:38:12,301 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-27 23:38:12,301 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-27 23:38:12,301 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-27 23:38:12,301 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-27 23:38:12,301 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 -> 0ddb7cbdb5243e0dc5a18ffa5957d423189625fe9ffc6441855806502cce15ab [2021-12-27 23:38:12,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-27 23:38:12,645 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-27 23:38:12,647 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-27 23:38:12,648 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-27 23:38:12,656 INFO L275 PluginConnector]: CDTParser initialized [2021-12-27 23:38:12,658 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1251b.c [2021-12-27 23:38:12,709 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0084de3d3/75bef638b02d4cdfbf3fe89160f1a7c2/FLAG2658d72a9 [2021-12-27 23:38:13,106 INFO L306 CDTParser]: Found 1 translation units. [2021-12-27 23:38:13,106 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1251b.c [2021-12-27 23:38:13,112 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0084de3d3/75bef638b02d4cdfbf3fe89160f1a7c2/FLAG2658d72a9 [2021-12-27 23:38:13,125 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0084de3d3/75bef638b02d4cdfbf3fe89160f1a7c2 [2021-12-27 23:38:13,127 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-27 23:38:13,129 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-27 23:38:13,130 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-27 23:38:13,130 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-27 23:38:13,133 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-27 23:38:13,134 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:38:13" (1/1) ... [2021-12-27 23:38:13,135 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@576a819a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:38:13, skipping insertion in model container [2021-12-27 23:38:13,135 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:38:13" (1/1) ... [2021-12-27 23:38:13,139 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-27 23:38:13,154 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-27 23:38:13,327 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_1251b.c[2080,2093] [2021-12-27 23:38:13,334 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 23:38:13,345 INFO L203 MainTranslator]: Completed pre-run [2021-12-27 23:38:13,379 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_1251b.c[2080,2093] [2021-12-27 23:38:13,384 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 23:38:13,396 INFO L208 MainTranslator]: Completed translation [2021-12-27 23:38:13,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:38:13 WrapperNode [2021-12-27 23:38:13,397 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-27 23:38:13,398 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-27 23:38:13,399 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-27 23:38:13,399 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-27 23:38:13,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:38:13" (1/1) ... [2021-12-27 23:38:13,415 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:38:13" (1/1) ... [2021-12-27 23:38:13,432 INFO L137 Inliner]: procedures = 18, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 52 [2021-12-27 23:38:13,432 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-27 23:38:13,433 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-27 23:38:13,433 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-27 23:38:13,434 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-27 23:38:13,439 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:38:13" (1/1) ... [2021-12-27 23:38:13,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:38:13" (1/1) ... [2021-12-27 23:38:13,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:38:13" (1/1) ... [2021-12-27 23:38:13,444 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:38:13" (1/1) ... [2021-12-27 23:38:13,460 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:38:13" (1/1) ... [2021-12-27 23:38:13,462 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:38:13" (1/1) ... [2021-12-27 23:38:13,464 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:38:13" (1/1) ... [2021-12-27 23:38:13,472 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-27 23:38:13,473 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-27 23:38:13,473 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-27 23:38:13,473 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-27 23:38:13,474 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:38:13" (1/1) ... [2021-12-27 23:38:13,478 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 23:38:13,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 23:38:13,495 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-27 23:38:13,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-27 23:38:13,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-27 23:38:13,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-27 23:38:13,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-27 23:38:13,528 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2021-12-27 23:38:13,528 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2021-12-27 23:38:13,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2021-12-27 23:38:13,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-27 23:38:13,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-27 23:38:13,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-27 23:38:13,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-27 23:38:13,575 INFO L234 CfgBuilder]: Building ICFG [2021-12-27 23:38:13,577 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-27 23:38:13,673 INFO L275 CfgBuilder]: Performing block encoding [2021-12-27 23:38:13,677 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-27 23:38:13,677 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-27 23:38:13,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:38:13 BoogieIcfgContainer [2021-12-27 23:38:13,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-27 23:38:13,680 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-27 23:38:13,680 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-27 23:38:13,682 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-27 23:38:13,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 11:38:13" (1/3) ... [2021-12-27 23:38:13,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d952445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:38:13, skipping insertion in model container [2021-12-27 23:38:13,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:38:13" (2/3) ... [2021-12-27 23:38:13,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d952445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:38:13, skipping insertion in model container [2021-12-27 23:38:13,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:38:13" (3/3) ... [2021-12-27 23:38:13,684 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1251b.c [2021-12-27 23:38:13,688 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-27 23:38:13,688 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-27 23:38:13,739 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-27 23:38:13,744 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-27 23:38:13,744 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-27 23:38:13,780 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) [2021-12-27 23:38:13,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-27 23:38:13,784 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:38:13,784 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:38:13,785 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:38:13,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:38:13,791 INFO L85 PathProgramCache]: Analyzing trace with hash 87468236, now seen corresponding path program 1 times [2021-12-27 23:38:13,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:38:13,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116980732] [2021-12-27 23:38:13,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:38:13,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:38:13,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:38:13,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-27 23:38:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:38:13,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:38:13,959 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:38:13,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116980732] [2021-12-27 23:38:13,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116980732] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:38:13,967 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:38:13,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 23:38:13,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352474947] [2021-12-27 23:38:13,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:38:13,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 23:38:13,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:38:13,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 23:38:13,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 23:38:13,997 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) [2021-12-27 23:38:14,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:38:14,029 INFO L93 Difference]: Finished difference Result 53 states and 75 transitions. [2021-12-27 23:38:14,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 23:38:14,031 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 [2021-12-27 23:38:14,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:38:14,036 INFO L225 Difference]: With dead ends: 53 [2021-12-27 23:38:14,036 INFO L226 Difference]: Without dead ends: 25 [2021-12-27 23:38:14,039 INFO L932 BasicCegarLoop]: 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 [2021-12-27 23:38:14,042 INFO L933 BasicCegarLoop]: 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 [2021-12-27 23:38:14,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 68 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 23:38:14,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-27 23:38:14,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-12-27 23:38:14,069 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) [2021-12-27 23:38:14,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2021-12-27 23:38:14,071 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 15 [2021-12-27 23:38:14,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:38:14,071 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2021-12-27 23:38:14,071 INFO L471 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) [2021-12-27 23:38:14,071 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2021-12-27 23:38:14,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-27 23:38:14,073 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:38:14,073 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:38:14,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-27 23:38:14,075 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:38:14,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:38:14,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1072117413, now seen corresponding path program 1 times [2021-12-27 23:38:14,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:38:14,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540736864] [2021-12-27 23:38:14,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:38:14,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:38:14,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:38:14,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-27 23:38:14,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:38:14,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:38:14,231 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:38:14,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540736864] [2021-12-27 23:38:14,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540736864] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:38:14,231 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:38:14,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-27 23:38:14,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512854124] [2021-12-27 23:38:14,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:38:14,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-27 23:38:14,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:38:14,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-27 23:38:14,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-27 23:38:14,233 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) [2021-12-27 23:38:14,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:38:14,276 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2021-12-27 23:38:14,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-27 23:38:14,277 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 [2021-12-27 23:38:14,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:38:14,279 INFO L225 Difference]: With dead ends: 33 [2021-12-27 23:38:14,279 INFO L226 Difference]: Without dead ends: 29 [2021-12-27 23:38:14,279 INFO L932 BasicCegarLoop]: 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 [2021-12-27 23:38:14,280 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 23:38:14,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 105 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 23:38:14,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-27 23:38:14,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-12-27 23:38:14,301 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) [2021-12-27 23:38:14,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2021-12-27 23:38:14,302 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 16 [2021-12-27 23:38:14,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:38:14,302 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2021-12-27 23:38:14,302 INFO L471 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) [2021-12-27 23:38:14,302 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2021-12-27 23:38:14,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-27 23:38:14,303 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:38:14,303 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:38:14,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-27 23:38:14,304 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:38:14,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:38:14,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1361378825, now seen corresponding path program 1 times [2021-12-27 23:38:14,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:38:14,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814342696] [2021-12-27 23:38:14,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:38:14,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:38:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:38:14,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-27 23:38:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:38:14,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:38:14,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:38:14,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814342696] [2021-12-27 23:38:14,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814342696] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:38:14,393 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:38:14,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-27 23:38:14,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922389383] [2021-12-27 23:38:14,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:38:14,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-27 23:38:14,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:38:14,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-27 23:38:14,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-27 23:38:14,395 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) [2021-12-27 23:38:14,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:38:14,420 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2021-12-27 23:38:14,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-27 23:38:14,421 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 [2021-12-27 23:38:14,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:38:14,421 INFO L225 Difference]: With dead ends: 37 [2021-12-27 23:38:14,422 INFO L226 Difference]: Without dead ends: 33 [2021-12-27 23:38:14,422 INFO L932 BasicCegarLoop]: 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 [2021-12-27 23:38:14,423 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 23:38:14,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 121 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 23:38:14,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-12-27 23:38:14,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2021-12-27 23:38:14,433 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) [2021-12-27 23:38:14,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2021-12-27 23:38:14,434 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 17 [2021-12-27 23:38:14,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:38:14,434 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2021-12-27 23:38:14,435 INFO L471 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) [2021-12-27 23:38:14,435 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2021-12-27 23:38:14,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-27 23:38:14,437 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:38:14,437 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:38:14,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-27 23:38:14,437 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:38:14,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:38:14,438 INFO L85 PathProgramCache]: Analyzing trace with hash -2128342377, now seen corresponding path program 1 times [2021-12-27 23:38:14,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:38:14,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125042731] [2021-12-27 23:38:14,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:38:14,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:38:14,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:38:14,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-27 23:38:14,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:38:14,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:38:14,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:38:14,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125042731] [2021-12-27 23:38:14,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125042731] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:38:14,526 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:38:14,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-27 23:38:14,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725028225] [2021-12-27 23:38:14,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:38:14,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-27 23:38:14,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:38:14,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-27 23:38:14,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-27 23:38:14,527 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) [2021-12-27 23:38:14,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:38:14,551 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2021-12-27 23:38:14,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-27 23:38:14,551 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 [2021-12-27 23:38:14,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:38:14,552 INFO L225 Difference]: With dead ends: 37 [2021-12-27 23:38:14,552 INFO L226 Difference]: Without dead ends: 33 [2021-12-27 23:38:14,553 INFO L932 BasicCegarLoop]: 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 [2021-12-27 23:38:14,553 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 23:38:14,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 121 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 23:38:14,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-12-27 23:38:14,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2021-12-27 23:38:14,559 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) [2021-12-27 23:38:14,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2021-12-27 23:38:14,561 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 18 [2021-12-27 23:38:14,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:38:14,561 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2021-12-27 23:38:14,561 INFO L471 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) [2021-12-27 23:38:14,562 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2021-12-27 23:38:14,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-27 23:38:14,562 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:38:14,562 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:38:14,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-27 23:38:14,563 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:38:14,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:38:14,564 INFO L85 PathProgramCache]: Analyzing trace with hash -259243195, now seen corresponding path program 1 times [2021-12-27 23:38:14,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:38:14,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809959277] [2021-12-27 23:38:14,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:38:14,565 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:38:14,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:38:14,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-27 23:38:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:38:14,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:38:14,623 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:38:14,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809959277] [2021-12-27 23:38:14,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809959277] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:38:14,623 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:38:14,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-27 23:38:14,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361415017] [2021-12-27 23:38:14,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:38:14,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-27 23:38:14,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:38:14,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-27 23:38:14,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-27 23:38:14,625 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) [2021-12-27 23:38:14,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:38:14,642 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2021-12-27 23:38:14,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-27 23:38:14,642 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 [2021-12-27 23:38:14,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:38:14,643 INFO L225 Difference]: With dead ends: 37 [2021-12-27 23:38:14,643 INFO L226 Difference]: Without dead ends: 33 [2021-12-27 23:38:14,643 INFO L932 BasicCegarLoop]: 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 [2021-12-27 23:38:14,644 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 23:38:14,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 121 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 23:38:14,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-12-27 23:38:14,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2021-12-27 23:38:14,647 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) [2021-12-27 23:38:14,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2021-12-27 23:38:14,648 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 19 [2021-12-27 23:38:14,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:38:14,648 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2021-12-27 23:38:14,648 INFO L471 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) [2021-12-27 23:38:14,649 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2021-12-27 23:38:14,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-27 23:38:14,649 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:38:14,649 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:38:14,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-27 23:38:14,649 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:38:14,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:38:14,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1483567140, now seen corresponding path program 1 times [2021-12-27 23:38:14,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:38:14,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99928722] [2021-12-27 23:38:14,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:38:14,650 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:38:14,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-27 23:38:14,689 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-27 23:38:14,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-27 23:38:14,723 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-27 23:38:14,723 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-27 23:38:14,724 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-27 23:38:14,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-27 23:38:14,727 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2021-12-27 23:38:14,728 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-27 23:38:14,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 11:38:14 BoogieIcfgContainer [2021-12-27 23:38:14,743 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-27 23:38:14,744 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-27 23:38:14,744 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-27 23:38:14,745 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-27 23:38:14,751 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:38:13" (3/4) ... [2021-12-27 23:38:14,754 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-27 23:38:14,754 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-27 23:38:14,754 INFO L158 Benchmark]: Toolchain (without parser) took 1625.03ms. Allocated memory was 67.1MB in the beginning and 92.3MB in the end (delta: 25.2MB). Free memory was 47.7MB in the beginning and 67.2MB in the end (delta: -19.5MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2021-12-27 23:38:14,755 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 67.1MB. Free memory was 48.2MB in the beginning and 48.1MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-27 23:38:14,755 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.71ms. Allocated memory is still 67.1MB. Free memory was 47.5MB in the beginning and 48.8MB in the end (delta: -1.3MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2021-12-27 23:38:14,755 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.22ms. Allocated memory is still 67.1MB. Free memory was 48.8MB in the beginning and 47.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-27 23:38:14,756 INFO L158 Benchmark]: Boogie Preprocessor took 38.97ms. Allocated memory is still 67.1MB. Free memory was 47.3MB in the beginning and 46.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-27 23:38:14,756 INFO L158 Benchmark]: RCFGBuilder took 205.79ms. Allocated memory is still 67.1MB. Free memory was 45.8MB in the beginning and 34.8MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-27 23:38:14,756 INFO L158 Benchmark]: TraceAbstraction took 1063.63ms. Allocated memory was 67.1MB in the beginning and 92.3MB in the end (delta: 25.2MB). Free memory was 34.4MB in the beginning and 67.9MB in the end (delta: -33.5MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-27 23:38:14,757 INFO L158 Benchmark]: Witness Printer took 9.87ms. Allocated memory is still 92.3MB. Free memory was 67.9MB in the beginning and 67.2MB in the end (delta: 709.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-27 23:38:14,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.20ms. Allocated memory is still 67.1MB. Free memory was 48.2MB in the beginning and 48.1MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.71ms. Allocated memory is still 67.1MB. Free memory was 47.5MB in the beginning and 48.8MB in the end (delta: -1.3MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.22ms. Allocated memory is still 67.1MB. Free memory was 48.8MB in the beginning and 47.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.97ms. Allocated memory is still 67.1MB. Free memory was 47.3MB in the beginning and 46.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 205.79ms. Allocated memory is still 67.1MB. Free memory was 45.8MB in the beginning and 34.8MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1063.63ms. Allocated memory was 67.1MB in the beginning and 92.3MB in the end (delta: 25.2MB). Free memory was 34.4MB in the beginning and 67.9MB in the end (delta: -33.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 9.87ms. Allocated memory is still 92.3MB. Free memory was 67.9MB in the beginning and 67.2MB in the end (delta: 709.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 80]: 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 79, overapproximation of someBinaryArithmeticDOUBLEoperation at line 67. Possible FailurePath: [L66] double x = __VERIFIER_nondet_double(); [L67] double y = 0.0 / 0.0; [L74] CALL, EXPR isnan_double(x) [L18] return x != x; VAL [\old(x)=4294967299, \result=0, x=4294967299] [L74] RET, EXPR isnan_double(x) [L74] COND TRUE !isnan_double(x) [L76] CALL, EXPR fmax_double(x, y) [L57] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=4294967299] [L29] __uint32_t msw, lsw; VAL [\old(x)=4294967299, x=4294967299] [L32] ieee_double_shape_type ew_u; [L33] ew_u.value = (x) [L34] EXPR ew_u.parts.msw [L34] (msw) = ew_u.parts.msw [L35] EXPR ew_u.parts.lsw [L35] (lsw) = ew_u.parts.lsw [L38-L39] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=4294967299, lsw=4294967297, msw=4293918721, x=4294967299] [L41-L42] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=4294967299, lsw=4294967297, msw=4293918721, x=4294967299] [L44-L45] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=4294967299, lsw=4294967297, msw=4293918721, x=4294967299] [L48-L49] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L52] return 0; VAL [\old(x)=4294967299, \result=0, lsw=4294967297, msw=4293918721, x=4294967299] [L57] RET, EXPR __fpclassify_double(x) VAL [\old(x)=4294967299, \old(y)=4294967298, __fpclassify_double(x)=0, x=4294967299, y=4294967298] [L57] COND TRUE __fpclassify_double(x) == 0 [L58] return y; VAL [\old(x)=4294967299, \old(y)=4294967298, \result=4294967298, x=4294967299, y=4294967298] [L76] RET, EXPR fmax_double(x, y) [L76] double res = fmax_double(x, y); [L79] COND TRUE res != x VAL [res=4294967298, x=4294967299, y=4294967298] [L80] reach_error() VAL [res=4294967298, x=4294967299, y=4294967298] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 536 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 369 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 82 IncrementalHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 167 mSDtfsCounter, 82 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.0s 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 [2021-12-27 23:38:14,795 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_1251b.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 0ddb7cbdb5243e0dc5a18ffa5957d423189625fe9ffc6441855806502cce15ab --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-27 23:38:16,447 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-27 23:38:16,450 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-27 23:38:16,482 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-27 23:38:16,482 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-27 23:38:16,485 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-27 23:38:16,486 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-27 23:38:16,490 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-27 23:38:16,492 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-27 23:38:16,496 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-27 23:38:16,497 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-27 23:38:16,500 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-27 23:38:16,500 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-27 23:38:16,502 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-27 23:38:16,503 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-27 23:38:16,505 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-27 23:38:16,506 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-27 23:38:16,507 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-27 23:38:16,508 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-27 23:38:16,513 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-27 23:38:16,514 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-27 23:38:16,515 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-27 23:38:16,516 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-27 23:38:16,517 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-27 23:38:16,522 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-27 23:38:16,523 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-27 23:38:16,523 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-27 23:38:16,524 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-27 23:38:16,525 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-27 23:38:16,525 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-27 23:38:16,530 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-27 23:38:16,531 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-27 23:38:16,532 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-27 23:38:16,532 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-27 23:38:16,533 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-27 23:38:16,533 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-27 23:38:16,534 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-27 23:38:16,534 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-27 23:38:16,534 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-27 23:38:16,535 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-27 23:38:16,536 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-27 23:38:16,536 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-27 23:38:16,566 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-27 23:38:16,566 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-27 23:38:16,567 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-27 23:38:16,567 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-27 23:38:16,568 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-27 23:38:16,568 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-27 23:38:16,569 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-27 23:38:16,569 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-27 23:38:16,569 INFO L138 SettingsManager]: * Use SBE=true [2021-12-27 23:38:16,570 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-27 23:38:16,570 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-27 23:38:16,571 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-27 23:38:16,571 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-27 23:38:16,571 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-27 23:38:16,571 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-27 23:38:16,571 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-27 23:38:16,571 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-27 23:38:16,571 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-27 23:38:16,571 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-27 23:38:16,572 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-27 23:38:16,572 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-27 23:38:16,572 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-27 23:38:16,572 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-27 23:38:16,572 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-27 23:38:16,572 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-27 23:38:16,572 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-27 23:38:16,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 23:38:16,573 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-27 23:38:16,573 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-27 23:38:16,573 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-27 23:38:16,573 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-27 23:38:16,573 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-27 23:38:16,574 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-27 23:38:16,574 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-27 23:38:16,574 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-27 23:38:16,574 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-27 23:38:16,574 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 -> 0ddb7cbdb5243e0dc5a18ffa5957d423189625fe9ffc6441855806502cce15ab [2021-12-27 23:38:16,909 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-27 23:38:16,938 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-27 23:38:16,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-27 23:38:16,941 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-27 23:38:16,941 INFO L275 PluginConnector]: CDTParser initialized [2021-12-27 23:38:16,942 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1251b.c [2021-12-27 23:38:16,990 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d65a8983b/caa03999a4b343038c55e646dd91a537/FLAG009fab3b1 [2021-12-27 23:38:17,363 INFO L306 CDTParser]: Found 1 translation units. [2021-12-27 23:38:17,363 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1251b.c [2021-12-27 23:38:17,368 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d65a8983b/caa03999a4b343038c55e646dd91a537/FLAG009fab3b1 [2021-12-27 23:38:17,380 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d65a8983b/caa03999a4b343038c55e646dd91a537 [2021-12-27 23:38:17,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-27 23:38:17,383 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-27 23:38:17,385 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-27 23:38:17,385 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-27 23:38:17,388 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-27 23:38:17,388 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:38:17" (1/1) ... [2021-12-27 23:38:17,389 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@469607a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:38:17, skipping insertion in model container [2021-12-27 23:38:17,389 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:38:17" (1/1) ... [2021-12-27 23:38:17,393 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-27 23:38:17,404 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-27 23:38:17,528 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_1251b.c[2080,2093] [2021-12-27 23:38:17,533 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 23:38:17,549 INFO L203 MainTranslator]: Completed pre-run [2021-12-27 23:38:17,586 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_1251b.c[2080,2093] [2021-12-27 23:38:17,590 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 23:38:17,604 INFO L208 MainTranslator]: Completed translation [2021-12-27 23:38:17,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:38:17 WrapperNode [2021-12-27 23:38:17,605 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-27 23:38:17,606 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-27 23:38:17,606 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-27 23:38:17,606 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-27 23:38:17,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:38:17" (1/1) ... [2021-12-27 23:38:17,623 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:38:17" (1/1) ... [2021-12-27 23:38:17,636 INFO L137 Inliner]: procedures = 21, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 50 [2021-12-27 23:38:17,637 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-27 23:38:17,637 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-27 23:38:17,637 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-27 23:38:17,638 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-27 23:38:17,643 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:38:17" (1/1) ... [2021-12-27 23:38:17,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:38:17" (1/1) ... [2021-12-27 23:38:17,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:38:17" (1/1) ... [2021-12-27 23:38:17,649 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:38:17" (1/1) ... [2021-12-27 23:38:17,665 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:38:17" (1/1) ... [2021-12-27 23:38:17,669 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:38:17" (1/1) ... [2021-12-27 23:38:17,671 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:38:17" (1/1) ... [2021-12-27 23:38:17,675 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-27 23:38:17,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-27 23:38:17,678 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-27 23:38:17,678 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-27 23:38:17,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:38:17" (1/1) ... [2021-12-27 23:38:17,683 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 23:38:17,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 23:38:17,698 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-27 23:38:17,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-27 23:38:17,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-27 23:38:17,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2021-12-27 23:38:17,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-27 23:38:17,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-27 23:38:17,726 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2021-12-27 23:38:17,727 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2021-12-27 23:38:17,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-27 23:38:17,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-27 23:38:17,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-27 23:38:17,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-27 23:38:17,801 INFO L234 CfgBuilder]: Building ICFG [2021-12-27 23:38:17,802 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-27 23:38:17,942 INFO L275 CfgBuilder]: Performing block encoding [2021-12-27 23:38:17,946 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-27 23:38:17,946 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-27 23:38:17,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:38:17 BoogieIcfgContainer [2021-12-27 23:38:17,947 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-27 23:38:17,948 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-27 23:38:17,948 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-27 23:38:17,956 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-27 23:38:17,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 11:38:17" (1/3) ... [2021-12-27 23:38:17,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12aa2319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:38:17, skipping insertion in model container [2021-12-27 23:38:17,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:38:17" (2/3) ... [2021-12-27 23:38:17,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12aa2319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:38:17, skipping insertion in model container [2021-12-27 23:38:17,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:38:17" (3/3) ... [2021-12-27 23:38:17,973 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1251b.c [2021-12-27 23:38:17,976 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-27 23:38:17,977 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-27 23:38:18,031 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-27 23:38:18,062 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-27 23:38:18,062 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-27 23:38:18,084 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) [2021-12-27 23:38:18,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-27 23:38:18,087 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:38:18,088 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:38:18,089 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:38:18,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:38:18,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1684133472, now seen corresponding path program 1 times [2021-12-27 23:38:18,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:38:18,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899935652] [2021-12-27 23:38:18,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:38:18,103 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:38:18,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:38:18,105 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 23:38:18,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-27 23:38:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:38:18,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-27 23:38:18,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:38:18,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:38:18,238 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:38:18,239 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:38:18,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899935652] [2021-12-27 23:38:18,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [899935652] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:38:18,240 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:38:18,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-27 23:38:18,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013945461] [2021-12-27 23:38:18,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:38:18,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-27 23:38:18,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:38:18,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-27 23:38:18,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-27 23:38:18,269 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) [2021-12-27 23:38:18,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:38:18,286 INFO L93 Difference]: Finished difference Result 49 states and 71 transitions. [2021-12-27 23:38:18,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-27 23:38:18,288 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 [2021-12-27 23:38:18,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:38:18,292 INFO L225 Difference]: With dead ends: 49 [2021-12-27 23:38:18,292 INFO L226 Difference]: Without dead ends: 23 [2021-12-27 23:38:18,294 INFO L932 BasicCegarLoop]: 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 [2021-12-27 23:38:18,297 INFO L933 BasicCegarLoop]: 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 [2021-12-27 23:38:18,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 23:38:18,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-12-27 23:38:18,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-12-27 23:38:18,321 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) [2021-12-27 23:38:18,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2021-12-27 23:38:18,324 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 14 [2021-12-27 23:38:18,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:38:18,325 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2021-12-27 23:38:18,325 INFO L471 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) [2021-12-27 23:38:18,325 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2021-12-27 23:38:18,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-27 23:38:18,326 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:38:18,326 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:38:18,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-27 23:38:18,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 23:38:18,536 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:38:18,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:38:18,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1014515731, now seen corresponding path program 1 times [2021-12-27 23:38:18,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:38:18,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [101331190] [2021-12-27 23:38:18,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:38:18,539 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:38:18,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:38:18,540 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 23:38:18,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-27 23:38:18,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:38:18,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-27 23:38:18,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:38:18,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:38:18,700 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:38:18,700 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:38:18,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [101331190] [2021-12-27 23:38:18,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [101331190] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:38:18,702 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:38:18,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-27 23:38:18,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517622540] [2021-12-27 23:38:18,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:38:18,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 23:38:18,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:38:18,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 23:38:18,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-27 23:38:18,709 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) [2021-12-27 23:38:18,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:38:18,739 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2021-12-27 23:38:18,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-27 23:38:18,743 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 [2021-12-27 23:38:18,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:38:18,746 INFO L225 Difference]: With dead ends: 30 [2021-12-27 23:38:18,746 INFO L226 Difference]: Without dead ends: 26 [2021-12-27 23:38:18,746 INFO L932 BasicCegarLoop]: 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 [2021-12-27 23:38:18,748 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 23:38:18,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 23:38:18,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-12-27 23:38:18,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-12-27 23:38:18,763 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) [2021-12-27 23:38:18,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2021-12-27 23:38:18,764 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 15 [2021-12-27 23:38:18,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:38:18,764 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2021-12-27 23:38:18,764 INFO L471 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) [2021-12-27 23:38:18,765 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2021-12-27 23:38:18,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-27 23:38:18,765 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:38:18,765 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:38:18,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-27 23:38:18,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 23:38:18,974 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:38:18,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:38:18,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1185853373, now seen corresponding path program 1 times [2021-12-27 23:38:18,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:38:18,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1524810821] [2021-12-27 23:38:18,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:38:18,979 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:38:18,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:38:18,981 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 23:38:18,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-27 23:38:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:38:19,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-27 23:38:19,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:38:19,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:38:19,097 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:38:19,098 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:38:19,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1524810821] [2021-12-27 23:38:19,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1524810821] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:38:19,098 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:38:19,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-27 23:38:19,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674895352] [2021-12-27 23:38:19,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:38:19,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 23:38:19,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:38:19,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 23:38:19,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-27 23:38:19,101 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) [2021-12-27 23:38:19,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:38:19,117 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2021-12-27 23:38:19,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-27 23:38:19,118 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 [2021-12-27 23:38:19,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:38:19,119 INFO L225 Difference]: With dead ends: 33 [2021-12-27 23:38:19,119 INFO L226 Difference]: Without dead ends: 29 [2021-12-27 23:38:19,119 INFO L932 BasicCegarLoop]: 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 [2021-12-27 23:38:19,121 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 23:38:19,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 23:38:19,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-27 23:38:19,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2021-12-27 23:38:19,127 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) [2021-12-27 23:38:19,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2021-12-27 23:38:19,129 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 16 [2021-12-27 23:38:19,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:38:19,129 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2021-12-27 23:38:19,129 INFO L471 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) [2021-12-27 23:38:19,130 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2021-12-27 23:38:19,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-27 23:38:19,130 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:38:19,130 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:38:19,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-27 23:38:19,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 23:38:19,339 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:38:19,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:38:19,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1347661745, now seen corresponding path program 1 times [2021-12-27 23:38:19,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:38:19,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1804064760] [2021-12-27 23:38:19,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:38:19,340 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:38:19,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:38:19,341 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 23:38:19,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-27 23:38:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:38:19,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-27 23:38:19,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:38:19,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:38:19,431 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:38:19,432 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:38:19,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1804064760] [2021-12-27 23:38:19,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1804064760] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:38:19,432 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:38:19,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-27 23:38:19,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158676496] [2021-12-27 23:38:19,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:38:19,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 23:38:19,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:38:19,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 23:38:19,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-27 23:38:19,434 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) [2021-12-27 23:38:19,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:38:19,449 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2021-12-27 23:38:19,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-27 23:38:19,450 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 [2021-12-27 23:38:19,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:38:19,450 INFO L225 Difference]: With dead ends: 33 [2021-12-27 23:38:19,450 INFO L226 Difference]: Without dead ends: 29 [2021-12-27 23:38:19,451 INFO L932 BasicCegarLoop]: 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 [2021-12-27 23:38:19,451 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 23:38:19,467 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 23:38:19,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-27 23:38:19,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2021-12-27 23:38:19,470 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) [2021-12-27 23:38:19,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2021-12-27 23:38:19,471 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 17 [2021-12-27 23:38:19,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:38:19,471 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2021-12-27 23:38:19,471 INFO L471 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) [2021-12-27 23:38:19,471 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2021-12-27 23:38:19,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-27 23:38:19,472 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:38:19,472 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:38:19,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-27 23:38:19,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 23:38:19,672 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:38:19,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:38:19,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1832266503, now seen corresponding path program 1 times [2021-12-27 23:38:19,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:38:19,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1916314732] [2021-12-27 23:38:19,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:38:19,673 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:38:19,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:38:19,674 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 23:38:19,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-27 23:38:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:38:19,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-27 23:38:19,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:38:19,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:38:19,802 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:38:19,802 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:38:19,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1916314732] [2021-12-27 23:38:19,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1916314732] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:38:19,802 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:38:19,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-27 23:38:19,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075879701] [2021-12-27 23:38:19,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:38:19,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 23:38:19,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:38:19,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 23:38:19,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-27 23:38:19,804 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) [2021-12-27 23:38:19,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:38:19,822 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2021-12-27 23:38:19,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-27 23:38:19,822 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 [2021-12-27 23:38:19,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:38:19,823 INFO L225 Difference]: With dead ends: 33 [2021-12-27 23:38:19,823 INFO L226 Difference]: Without dead ends: 29 [2021-12-27 23:38:19,823 INFO L932 BasicCegarLoop]: 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 [2021-12-27 23:38:19,824 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 23:38:19,825 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 23:38:19,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-27 23:38:19,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2021-12-27 23:38:19,830 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) [2021-12-27 23:38:19,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2021-12-27 23:38:19,830 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 18 [2021-12-27 23:38:19,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:38:19,831 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2021-12-27 23:38:19,831 INFO L471 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) [2021-12-27 23:38:19,831 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2021-12-27 23:38:19,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-27 23:38:19,831 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:38:19,839 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:38:19,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-27 23:38:20,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 23:38:20,048 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:38:20,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:38:20,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1575197112, now seen corresponding path program 1 times [2021-12-27 23:38:20,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:38:20,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1450251701] [2021-12-27 23:38:20,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:38:20,049 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:38:20,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:38:20,050 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 23:38:20,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-27 23:38:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:38:20,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-27 23:38:20,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:38:20,268 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2021-12-27 23:38:21,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:38:21,284 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:38:21,284 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:38:21,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1450251701] [2021-12-27 23:38:21,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1450251701] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:38:21,285 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:38:21,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-27 23:38:21,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080247365] [2021-12-27 23:38:21,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:38:21,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-27 23:38:21,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:38:21,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-27 23:38:21,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-12-27 23:38:21,286 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) [2021-12-27 23:38:21,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:38:21,422 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2021-12-27 23:38:21,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-27 23:38:21,423 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 [2021-12-27 23:38:21,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:38:21,423 INFO L225 Difference]: With dead ends: 45 [2021-12-27 23:38:21,423 INFO L226 Difference]: Without dead ends: 25 [2021-12-27 23:38:21,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-12-27 23:38:21,424 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 21 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 23:38:21,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 99 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 29 Unchecked, 0.1s Time] [2021-12-27 23:38:21,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-27 23:38:21,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-12-27 23:38:21,428 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) [2021-12-27 23:38:21,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2021-12-27 23:38:21,429 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 18 [2021-12-27 23:38:21,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:38:21,429 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2021-12-27 23:38:21,429 INFO L471 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) [2021-12-27 23:38:21,429 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2021-12-27 23:38:21,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-27 23:38:21,430 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:38:21,430 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:38:21,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-27 23:38:21,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 23:38:21,646 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:38:21,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:38:21,647 INFO L85 PathProgramCache]: Analyzing trace with hash 789982401, now seen corresponding path program 1 times [2021-12-27 23:38:21,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:38:21,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1435390011] [2021-12-27 23:38:21,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:38:21,647 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:38:21,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:38:21,649 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 23:38:21,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-27 23:38:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:38:21,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-27 23:38:21,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:38:21,764 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-27 23:38:21,764 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:38:21,764 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:38:21,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1435390011] [2021-12-27 23:38:21,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1435390011] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:38:21,765 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:38:21,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-27 23:38:21,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907851572] [2021-12-27 23:38:21,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:38:21,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 23:38:21,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:38:21,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 23:38:21,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-27 23:38:21,766 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) [2021-12-27 23:38:21,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:38:21,783 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2021-12-27 23:38:21,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-27 23:38:21,784 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 [2021-12-27 23:38:21,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:38:21,784 INFO L225 Difference]: With dead ends: 32 [2021-12-27 23:38:21,784 INFO L226 Difference]: Without dead ends: 28 [2021-12-27 23:38:21,785 INFO L932 BasicCegarLoop]: 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 [2021-12-27 23:38:21,785 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 23:38:21,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 23:38:21,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-12-27 23:38:21,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-12-27 23:38:21,789 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) [2021-12-27 23:38:21,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2021-12-27 23:38:21,789 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 23 [2021-12-27 23:38:21,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:38:21,790 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2021-12-27 23:38:21,790 INFO L471 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) [2021-12-27 23:38:21,790 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2021-12-27 23:38:21,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-27 23:38:21,791 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:38:21,791 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:38:21,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-12-27 23:38:22,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 23:38:22,003 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:38:22,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:38:22,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1141759769, now seen corresponding path program 1 times [2021-12-27 23:38:22,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:38:22,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [54698786] [2021-12-27 23:38:22,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:38:22,005 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:38:22,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:38:22,006 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 23:38:22,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-27 23:38:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:38:22,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-27 23:38:22,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:38:22,126 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-27 23:38:22,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:38:22,127 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:38:22,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [54698786] [2021-12-27 23:38:22,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [54698786] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:38:22,127 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:38:22,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-27 23:38:22,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679041577] [2021-12-27 23:38:22,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:38:22,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 23:38:22,128 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:38:22,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 23:38:22,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-27 23:38:22,129 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) [2021-12-27 23:38:22,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:38:22,147 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2021-12-27 23:38:22,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-27 23:38:22,148 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 [2021-12-27 23:38:22,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:38:22,148 INFO L225 Difference]: With dead ends: 35 [2021-12-27 23:38:22,148 INFO L226 Difference]: Without dead ends: 31 [2021-12-27 23:38:22,149 INFO L932 BasicCegarLoop]: 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 [2021-12-27 23:38:22,149 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 23:38:22,150 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 23:38:22,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-27 23:38:22,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2021-12-27 23:38:22,153 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) [2021-12-27 23:38:22,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2021-12-27 23:38:22,153 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 24 [2021-12-27 23:38:22,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:38:22,154 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2021-12-27 23:38:22,154 INFO L471 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) [2021-12-27 23:38:22,154 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2021-12-27 23:38:22,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-27 23:38:22,167 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:38:22,168 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:38:22,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-27 23:38:22,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 23:38:22,379 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:38:22,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:38:22,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1641177467, now seen corresponding path program 1 times [2021-12-27 23:38:22,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:38:22,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1189282645] [2021-12-27 23:38:22,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:38:22,380 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:38:22,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:38:22,381 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 23:38:22,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-27 23:38:22,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:38:22,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-27 23:38:22,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:38:22,489 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-27 23:38:22,489 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:38:22,489 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:38:22,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1189282645] [2021-12-27 23:38:22,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1189282645] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:38:22,489 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:38:22,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-27 23:38:22,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986902073] [2021-12-27 23:38:22,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:38:22,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 23:38:22,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:38:22,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 23:38:22,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-27 23:38:22,490 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) [2021-12-27 23:38:22,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:38:22,501 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2021-12-27 23:38:22,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-27 23:38:22,501 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 [2021-12-27 23:38:22,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:38:22,502 INFO L225 Difference]: With dead ends: 35 [2021-12-27 23:38:22,502 INFO L226 Difference]: Without dead ends: 31 [2021-12-27 23:38:22,502 INFO L932 BasicCegarLoop]: 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 [2021-12-27 23:38:22,502 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 23:38:22,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 23:38:22,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-27 23:38:22,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2021-12-27 23:38:22,504 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) [2021-12-27 23:38:22,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2021-12-27 23:38:22,505 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 25 [2021-12-27 23:38:22,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:38:22,505 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2021-12-27 23:38:22,505 INFO L471 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) [2021-12-27 23:38:22,505 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2021-12-27 23:38:22,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-27 23:38:22,505 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:38:22,505 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:38:22,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-12-27 23:38:22,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 23:38:22,714 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:38:22,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:38:22,714 INFO L85 PathProgramCache]: Analyzing trace with hash -984557701, now seen corresponding path program 1 times [2021-12-27 23:38:22,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:38:22,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1651645114] [2021-12-27 23:38:22,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:38:22,715 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:38:22,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:38:22,716 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 23:38:22,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-27 23:38:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:38:22,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-27 23:38:22,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:38:22,881 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-27 23:38:22,881 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:38:22,881 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:38:22,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1651645114] [2021-12-27 23:38:22,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1651645114] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:38:22,881 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:38:22,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-27 23:38:22,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213692364] [2021-12-27 23:38:22,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:38:22,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 23:38:22,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:38:22,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 23:38:22,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-27 23:38:22,882 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) [2021-12-27 23:38:22,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:38:22,884 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2021-12-27 23:38:22,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-27 23:38:22,884 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 [2021-12-27 23:38:22,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:38:22,885 INFO L225 Difference]: With dead ends: 37 [2021-12-27 23:38:22,885 INFO L226 Difference]: Without dead ends: 32 [2021-12-27 23:38:22,885 INFO L932 BasicCegarLoop]: 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 [2021-12-27 23:38:22,885 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 4 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 23:38:22,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 77 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 2 Unchecked, 0.0s Time] [2021-12-27 23:38:22,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-12-27 23:38:22,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2021-12-27 23:38:22,888 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) [2021-12-27 23:38:22,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2021-12-27 23:38:22,888 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 25 [2021-12-27 23:38:22,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:38:22,888 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2021-12-27 23:38:22,888 INFO L471 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) [2021-12-27 23:38:22,888 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2021-12-27 23:38:22,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-27 23:38:22,889 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:38:22,889 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:38:22,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-27 23:38:23,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 23:38:23,097 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:38:23,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:38:23,098 INFO L85 PathProgramCache]: Analyzing trace with hash -982710659, now seen corresponding path program 1 times [2021-12-27 23:38:23,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:38:23,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [969373065] [2021-12-27 23:38:23,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:38:23,098 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:38:23,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:38:23,099 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 23:38:23,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-27 23:38:23,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:38:23,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-27 23:38:23,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:38:23,330 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-27 23:38:23,330 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:38:23,331 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:38:23,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [969373065] [2021-12-27 23:38:23,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [969373065] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:38:23,331 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:38:23,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-27 23:38:23,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12289616] [2021-12-27 23:38:23,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:38:23,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-27 23:38:23,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:38:23,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-27 23:38:23,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-27 23:38:23,332 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) [2021-12-27 23:38:23,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:38:23,355 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2021-12-27 23:38:23,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-27 23:38:23,355 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 [2021-12-27 23:38:23,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:38:23,356 INFO L225 Difference]: With dead ends: 41 [2021-12-27 23:38:23,356 INFO L226 Difference]: Without dead ends: 34 [2021-12-27 23:38:23,356 INFO L932 BasicCegarLoop]: 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 [2021-12-27 23:38:23,356 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 7 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 23:38:23,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 124 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 22 Unchecked, 0.0s Time] [2021-12-27 23:38:23,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-27 23:38:23,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2021-12-27 23:38:23,359 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) [2021-12-27 23:38:23,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2021-12-27 23:38:23,359 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 25 [2021-12-27 23:38:23,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:38:23,359 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2021-12-27 23:38:23,360 INFO L471 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) [2021-12-27 23:38:23,360 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2021-12-27 23:38:23,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-27 23:38:23,360 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:38:23,360 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:38:23,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-27 23:38:23,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 23:38:23,571 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:38:23,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:38:23,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1961064157, now seen corresponding path program 1 times [2021-12-27 23:38:23,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:38:23,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1295471520] [2021-12-27 23:38:23,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:38:23,572 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:38:23,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:38:23,573 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 23:38:23,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-27 23:38:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:38:23,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-27 23:38:23,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:38:23,886 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-27 23:38:23,887 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:38:23,887 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:38:23,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1295471520] [2021-12-27 23:38:23,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1295471520] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:38:23,887 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:38:23,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-27 23:38:23,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259857123] [2021-12-27 23:38:23,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:38:23,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-27 23:38:23,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:38:23,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-27 23:38:23,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-27 23:38:23,888 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) [2021-12-27 23:38:23,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:38:23,913 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2021-12-27 23:38:23,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-27 23:38:23,913 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 [2021-12-27 23:38:23,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:38:23,913 INFO L225 Difference]: With dead ends: 43 [2021-12-27 23:38:23,913 INFO L226 Difference]: Without dead ends: 36 [2021-12-27 23:38:23,914 INFO L932 BasicCegarLoop]: 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 [2021-12-27 23:38:23,914 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 7 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 23:38:23,914 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 124 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 26 Unchecked, 0.0s Time] [2021-12-27 23:38:23,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-12-27 23:38:23,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2021-12-27 23:38:23,918 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) [2021-12-27 23:38:23,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2021-12-27 23:38:23,918 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 26 [2021-12-27 23:38:23,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:38:23,918 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2021-12-27 23:38:23,918 INFO L471 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) [2021-12-27 23:38:23,919 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2021-12-27 23:38:23,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-27 23:38:23,919 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:38:23,919 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:38:23,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-27 23:38:24,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 23:38:24,120 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:38:24,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:38:24,121 INFO L85 PathProgramCache]: Analyzing trace with hash -688209493, now seen corresponding path program 1 times [2021-12-27 23:38:24,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:38:24,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1674186637] [2021-12-27 23:38:24,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:38:24,121 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:38:24,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:38:24,125 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 23:38:24,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-27 23:38:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:38:24,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-27 23:38:24,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:38:24,221 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-27 23:38:24,223 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:38:24,223 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:38:24,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1674186637] [2021-12-27 23:38:24,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1674186637] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:38:24,223 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:38:24,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-27 23:38:24,223 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122660009] [2021-12-27 23:38:24,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:38:24,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 23:38:24,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:38:24,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 23:38:24,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-27 23:38:24,225 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) [2021-12-27 23:38:24,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:38:24,240 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2021-12-27 23:38:24,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-27 23:38:24,240 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 [2021-12-27 23:38:24,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:38:24,241 INFO L225 Difference]: With dead ends: 35 [2021-12-27 23:38:24,241 INFO L226 Difference]: Without dead ends: 31 [2021-12-27 23:38:24,241 INFO L932 BasicCegarLoop]: 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 [2021-12-27 23:38:24,241 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 23:38:24,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 23:38:24,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-27 23:38:24,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2021-12-27 23:38:24,243 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) [2021-12-27 23:38:24,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2021-12-27 23:38:24,244 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 26 [2021-12-27 23:38:24,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:38:24,244 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2021-12-27 23:38:24,244 INFO L471 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) [2021-12-27 23:38:24,244 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2021-12-27 23:38:24,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-27 23:38:24,244 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:38:24,244 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:38:24,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-27 23:38:24,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 23:38:24,458 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:38:24,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:38:24,458 INFO L85 PathProgramCache]: Analyzing trace with hash 199294188, now seen corresponding path program 1 times [2021-12-27 23:38:24,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:38:24,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1936551671] [2021-12-27 23:38:24,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:38:24,459 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:38:24,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:38:24,460 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) [2021-12-27 23:38:24,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-27 23:38:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:38:24,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-27 23:38:24,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:38:24,975 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-27 23:38:24,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 23:38:25,319 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:38:25,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1936551671] [2021-12-27 23:38:25,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1936551671] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 23:38:25,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [360580279] [2021-12-27 23:38:25,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:38:25,320 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-27 23:38:25,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-27 23:38:25,322 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) [2021-12-27 23:38:25,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2021-12-27 23:38:25,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:38:25,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-27 23:38:25,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:38:25,880 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-27 23:38:25,880 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:38:25,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [360580279] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:38:25,880 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-27 23:38:25,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2021-12-27 23:38:25,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581692622] [2021-12-27 23:38:25,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:38:25,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-27 23:38:25,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:38:25,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-27 23:38:25,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2021-12-27 23:38:25,882 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) [2021-12-27 23:38:26,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:38:26,074 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2021-12-27 23:38:26,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-27 23:38:26,076 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 [2021-12-27 23:38:26,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:38:26,076 INFO L225 Difference]: With dead ends: 32 [2021-12-27 23:38:26,076 INFO L226 Difference]: Without dead ends: 28 [2021-12-27 23:38:26,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2021-12-27 23:38:26,077 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 17 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 23:38:26,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 110 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 23:38:26,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-12-27 23:38:26,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2021-12-27 23:38:26,080 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) [2021-12-27 23:38:26,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-12-27 23:38:26,081 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 26 [2021-12-27 23:38:26,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:38:26,081 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-12-27 23:38:26,081 INFO L471 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) [2021-12-27 23:38:26,081 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2021-12-27 23:38:26,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-27 23:38:26,081 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:38:26,081 INFO L514 BasicCegarLoop]: 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] [2021-12-27 23:38:26,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Ended with exit code 0 [2021-12-27 23:38:26,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-27 23:38:26,482 WARN L452 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 [2021-12-27 23:38:26,482 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:38:26,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:38:26,483 INFO L85 PathProgramCache]: Analyzing trace with hash -865134783, now seen corresponding path program 1 times [2021-12-27 23:38:26,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:38:26,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1660449342] [2021-12-27 23:38:26,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:38:26,484 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:38:26,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:38:26,485 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 23:38:26,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-27 23:38:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:38:26,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-27 23:38:26,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:38:26,807 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-27 23:38:26,808 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:38:26,808 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:38:26,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1660449342] [2021-12-27 23:38:26,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1660449342] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:38:26,808 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:38:26,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-27 23:38:26,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505895329] [2021-12-27 23:38:26,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:38:26,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-27 23:38:26,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:38:26,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-27 23:38:26,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-27 23:38:26,809 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) [2021-12-27 23:38:26,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:38:26,840 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2021-12-27 23:38:26,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-27 23:38:26,840 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 [2021-12-27 23:38:26,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:38:26,841 INFO L225 Difference]: With dead ends: 36 [2021-12-27 23:38:26,841 INFO L226 Difference]: Without dead ends: 29 [2021-12-27 23:38:26,841 INFO L932 BasicCegarLoop]: 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 [2021-12-27 23:38:26,841 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 3 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 23:38:26,841 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 94 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 26 Unchecked, 0.0s Time] [2021-12-27 23:38:26,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-27 23:38:26,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2021-12-27 23:38:26,843 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) [2021-12-27 23:38:26,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-12-27 23:38:26,844 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 27 [2021-12-27 23:38:26,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:38:26,844 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-12-27 23:38:26,844 INFO L471 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) [2021-12-27 23:38:26,844 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2021-12-27 23:38:26,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-27 23:38:26,844 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:38:26,844 INFO L514 BasicCegarLoop]: 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] [2021-12-27 23:38:26,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-27 23:38:27,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 23:38:27,058 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:38:27,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:38:27,058 INFO L85 PathProgramCache]: Analyzing trace with hash 109054183, now seen corresponding path program 1 times [2021-12-27 23:38:27,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:38:27,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1402806431] [2021-12-27 23:38:27,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:38:27,059 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:38:27,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:38:27,060 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 23:38:27,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-27 23:38:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:38:27,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-27 23:38:27,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:38:27,198 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2021-12-27 23:38:27,326 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-27 23:38:27,326 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:38:27,326 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:38:27,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1402806431] [2021-12-27 23:38:27,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1402806431] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:38:27,327 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:38:27,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-27 23:38:27,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183658254] [2021-12-27 23:38:27,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:38:27,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-27 23:38:27,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:38:27,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-27 23:38:27,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-27 23:38:27,328 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) [2021-12-27 23:38:27,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:38:27,353 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2021-12-27 23:38:27,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-27 23:38:27,353 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 [2021-12-27 23:38:27,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:38:27,353 INFO L225 Difference]: With dead ends: 34 [2021-12-27 23:38:27,353 INFO L226 Difference]: Without dead ends: 27 [2021-12-27 23:38:27,353 INFO L932 BasicCegarLoop]: 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 [2021-12-27 23:38:27,354 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 3 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 23:38:27,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 84 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 26 Unchecked, 0.0s Time] [2021-12-27 23:38:27,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-27 23:38:27,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2021-12-27 23:38:27,355 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) [2021-12-27 23:38:27,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2021-12-27 23:38:27,356 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 28 [2021-12-27 23:38:27,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:38:27,356 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2021-12-27 23:38:27,356 INFO L471 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) [2021-12-27 23:38:27,356 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2021-12-27 23:38:27,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-27 23:38:27,356 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:38:27,356 INFO L514 BasicCegarLoop]: 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] [2021-12-27 23:38:27,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-27 23:38:27,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 23:38:27,582 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:38:27,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:38:27,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1698400280, now seen corresponding path program 1 times [2021-12-27 23:38:27,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:38:27,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2049256860] [2021-12-27 23:38:27,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:38:27,584 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:38:27,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:38:27,585 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 23:38:27,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-27 23:38:27,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:38:27,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-27 23:38:27,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:38:27,705 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-27 23:38:27,705 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:38:27,706 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:38:27,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2049256860] [2021-12-27 23:38:27,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2049256860] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:38:27,706 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:38:27,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-27 23:38:27,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546601780] [2021-12-27 23:38:27,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:38:27,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 23:38:27,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:38:27,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 23:38:27,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-27 23:38:27,707 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) [2021-12-27 23:38:27,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:38:27,720 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2021-12-27 23:38:27,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-27 23:38:27,721 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 [2021-12-27 23:38:27,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:38:27,721 INFO L225 Difference]: With dead ends: 25 [2021-12-27 23:38:27,721 INFO L226 Difference]: Without dead ends: 0 [2021-12-27 23:38:27,721 INFO L932 BasicCegarLoop]: 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 [2021-12-27 23:38:27,722 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 23:38:27,722 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 23:38:27,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-27 23:38:27,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-27 23:38:27,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:38:27,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-27 23:38:27,723 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2021-12-27 23:38:27,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:38:27,724 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-27 23:38:27,724 INFO L471 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) [2021-12-27 23:38:27,724 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-27 23:38:27,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-27 23:38:27,726 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-27 23:38:27,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-12-27 23:38:27,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 23:38:27,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-27 23:38:28,348 INFO L858 garLoopResultBuilder]: For program point L31-1(lines 31 36) no Hoare annotation was computed. [2021-12-27 23:38:28,348 INFO L854 garLoopResultBuilder]: At program point L31-2(lines 31 36) the Hoare annotation is: (= |__fpclassify_double_#in~x| __fpclassify_double_~x) [2021-12-27 23:38:28,349 INFO L858 garLoopResultBuilder]: For program point L31-3(lines 28 53) no Hoare annotation was computed. [2021-12-27 23:38:28,349 INFO L858 garLoopResultBuilder]: For program point __fpclassify_doubleFINAL(lines 28 53) no Hoare annotation was computed. [2021-12-27 23:38:28,349 INFO L858 garLoopResultBuilder]: For program point L48(lines 48 52) no Hoare annotation was computed. [2021-12-27 23:38:28,349 INFO L858 garLoopResultBuilder]: For program point L44(lines 44 52) no Hoare annotation was computed. [2021-12-27 23:38:28,349 INFO L861 garLoopResultBuilder]: At program point __fpclassify_doubleENTRY(lines 28 53) the Hoare annotation is: true [2021-12-27 23:38:28,349 INFO L858 garLoopResultBuilder]: For program point __fpclassify_doubleEXIT(lines 28 53) no Hoare annotation was computed. [2021-12-27 23:38:28,349 INFO L858 garLoopResultBuilder]: For program point L41(lines 41 52) no Hoare annotation was computed. [2021-12-27 23:38:28,349 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-27 23:38:28,349 INFO L858 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2021-12-27 23:38:28,349 INFO L858 garLoopResultBuilder]: For program point L62-2(line 62) no Hoare annotation was computed. [2021-12-27 23:38:28,349 INFO L854 garLoopResultBuilder]: At program point L62-3(lines 55 63) the Hoare annotation is: (and (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res#1|) (= |ULTIMATE.start_fmax_double_~x#1| |ULTIMATE.start_main_~x~0#1|) (fp.eq |ULTIMATE.start_fmax_double_~x#1| |ULTIMATE.start_fmax_double_~x#1|) (= |ULTIMATE.start_fmax_double_#res#1| |ULTIMATE.start_main_~x~0#1|)) [2021-12-27 23:38:28,349 INFO L861 garLoopResultBuilder]: At program point L85(lines 65 86) the Hoare annotation is: true [2021-12-27 23:38:28,349 INFO L858 garLoopResultBuilder]: For program point L79(lines 79 82) no Hoare annotation was computed. [2021-12-27 23:38:28,349 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-27 23:38:28,349 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-27 23:38:28,349 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-27 23:38:28,349 INFO L854 garLoopResultBuilder]: At program point L59(line 59) the Hoare annotation is: (and (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res#1|) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~y#1|)) (= |ULTIMATE.start_fmax_double_~x#1| |ULTIMATE.start_main_~x~0#1|) (fp.eq |ULTIMATE.start_fmax_double_~x#1| |ULTIMATE.start_fmax_double_~x#1|)) [2021-12-27 23:38:28,349 INFO L858 garLoopResultBuilder]: For program point L59-1(lines 59 60) no Hoare annotation was computed. [2021-12-27 23:38:28,349 INFO L854 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (and (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res#1|) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~y#1|)) (= |ULTIMATE.start_fmax_double_~x#1| |ULTIMATE.start_main_~x~0#1|) (fp.eq |ULTIMATE.start_fmax_double_~x#1| |ULTIMATE.start_fmax_double_~x#1|)) [2021-12-27 23:38:28,349 INFO L858 garLoopResultBuilder]: For program point L57-1(lines 57 58) no Hoare annotation was computed. [2021-12-27 23:38:28,350 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2021-12-27 23:38:28,350 INFO L854 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))))) [2021-12-27 23:38:28,350 INFO L858 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2021-12-27 23:38:28,350 INFO L858 garLoopResultBuilder]: For program point L74(lines 74 83) no Hoare annotation was computed. [2021-12-27 23:38:28,350 INFO L858 garLoopResultBuilder]: For program point L74-2(lines 74 83) no Hoare annotation was computed. [2021-12-27 23:38:28,352 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:38:28,353 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-27 23:38:28,358 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-12-27 23:38:28,364 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-12-27 23:38:28,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 11:38:28 BoogieIcfgContainer [2021-12-27 23:38:28,366 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-27 23:38:28,367 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-27 23:38:28,367 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-27 23:38:28,370 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-27 23:38:28,370 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:38:17" (3/4) ... [2021-12-27 23:38:28,372 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-27 23:38:28,377 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_double [2021-12-27 23:38:28,379 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2021-12-27 23:38:28,380 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-12-27 23:38:28,380 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-27 23:38:28,380 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-27 23:38:28,393 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))) [2021-12-27 23:38:28,394 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2021-12-27 23:38:28,394 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0bv32 == \result && x == x) && ~fp.eq~DOUBLE(x, x)) && \result == x [2021-12-27 23:38:28,405 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-27 23:38:28,406 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-27 23:38:28,406 INFO L158 Benchmark]: Toolchain (without parser) took 11022.97ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 45.9MB in the beginning and 26.2MB in the end (delta: 19.7MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. [2021-12-27 23:38:28,407 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 65.0MB. Free memory was 46.1MB in the beginning and 46.1MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-27 23:38:28,407 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.08ms. Allocated memory is still 65.0MB. Free memory was 45.7MB in the beginning and 46.9MB in the end (delta: -1.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-27 23:38:28,407 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.10ms. Allocated memory is still 65.0MB. Free memory was 46.9MB in the beginning and 45.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-27 23:38:28,407 INFO L158 Benchmark]: Boogie Preprocessor took 39.25ms. Allocated memory is still 65.0MB. Free memory was 45.4MB in the beginning and 43.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-27 23:38:28,408 INFO L158 Benchmark]: RCFGBuilder took 270.22ms. Allocated memory is still 65.0MB. Free memory was 43.8MB in the beginning and 32.5MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-27 23:38:28,408 INFO L158 Benchmark]: TraceAbstraction took 10418.24ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 32.0MB in the beginning and 29.7MB in the end (delta: 2.3MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2021-12-27 23:38:28,408 INFO L158 Benchmark]: Witness Printer took 38.88ms. Allocated memory is still 79.7MB. Free memory was 29.7MB in the beginning and 26.2MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-27 23:38:28,413 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.15ms. Allocated memory is still 65.0MB. Free memory was 46.1MB in the beginning and 46.1MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.08ms. Allocated memory is still 65.0MB. Free memory was 45.7MB in the beginning and 46.9MB in the end (delta: -1.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.10ms. Allocated memory is still 65.0MB. Free memory was 46.9MB in the beginning and 45.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.25ms. Allocated memory is still 65.0MB. Free memory was 45.4MB in the beginning and 43.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 270.22ms. Allocated memory is still 65.0MB. Free memory was 43.8MB in the beginning and 32.5MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10418.24ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 32.0MB in the beginning and 29.7MB in the end (delta: 2.3MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. * Witness Printer took 38.88ms. Allocated memory is still 79.7MB. Free memory was 29.7MB in the beginning and 26.2MB in the end (delta: 3.5MB). 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: 80]: 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.3s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 66 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 62 mSDsluCounter, 1484 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 131 IncrementalHoareTripleChecker+Unchecked, 1023 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 148 IncrementalHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 461 mSDtfsCounter, 148 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.1s 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.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 407 NumberOfCodeBlocks, 407 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 389 ConstructedInterpolants, 65 QuantifiedInterpolants, 1566 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 [2021-12-27 23:38:28,425 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-12-27 23:38:28,425 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: 31]: Loop Invariant Derived loop invariant: \old(x) == x - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((0bv32 == \result && x == x) && ~fp.eq~DOUBLE(x, x)) && \result == x RESULT: Ultimate proved your program to be correct! [2021-12-27 23:38:28,468 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