./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 c3fed411 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-tmp.no-commuhash-c3fed41 [2021-12-15 23:42:15,112 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 23:42:15,140 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 23:42:15,173 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 23:42:15,173 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 23:42:15,175 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 23:42:15,177 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 23:42:15,179 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 23:42:15,181 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 23:42:15,185 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 23:42:15,185 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 23:42:15,186 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 23:42:15,187 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 23:42:15,188 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 23:42:15,190 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 23:42:15,195 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 23:42:15,196 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 23:42:15,197 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 23:42:15,198 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 23:42:15,203 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 23:42:15,204 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 23:42:15,205 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 23:42:15,206 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 23:42:15,207 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 23:42:15,212 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 23:42:15,212 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 23:42:15,212 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 23:42:15,213 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 23:42:15,214 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 23:42:15,214 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 23:42:15,214 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 23:42:15,215 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 23:42:15,216 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 23:42:15,217 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 23:42:15,218 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 23:42:15,218 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 23:42:15,218 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 23:42:15,219 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 23:42:15,220 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 23:42:15,220 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 23:42:15,220 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 23:42:15,221 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-15 23:42:15,242 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 23:42:15,242 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 23:42:15,242 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 23:42:15,242 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 23:42:15,243 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 23:42:15,243 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 23:42:15,244 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 23:42:15,244 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 23:42:15,244 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 23:42:15,244 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 23:42:15,245 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 23:42:15,245 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 23:42:15,245 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 23:42:15,245 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 23:42:15,245 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-15 23:42:15,246 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 23:42:15,246 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-15 23:42:15,246 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 23:42:15,246 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 23:42:15,246 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 23:42:15,246 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-15 23:42:15,246 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 23:42:15,247 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 23:42:15,247 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 23:42:15,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 23:42:15,247 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 23:42:15,247 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 23:42:15,248 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-15 23:42:15,248 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 23:42:15,248 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 23:42:15,248 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-15 23:42:15,249 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-15 23:42:15,249 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-15 23:42:15,249 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 23:42:15,249 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-15 23:42:15,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 23:42:15,467 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 23:42:15,471 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 23:42:15,472 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 23:42:15,481 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 23:42:15,482 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-15 23:42:15,526 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/818841c08/32c57aab740947dcb03124a91519735e/FLAGdfbc8e754 [2021-12-15 23:42:15,831 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 23:42:15,832 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1251b.c [2021-12-15 23:42:15,838 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/818841c08/32c57aab740947dcb03124a91519735e/FLAGdfbc8e754 [2021-12-15 23:42:16,275 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/818841c08/32c57aab740947dcb03124a91519735e [2021-12-15 23:42:16,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 23:42:16,279 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 23:42:16,280 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 23:42:16,280 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 23:42:16,297 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 23:42:16,297 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:42:16" (1/1) ... [2021-12-15 23:42:16,298 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e6bad8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:42:16, skipping insertion in model container [2021-12-15 23:42:16,298 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:42:16" (1/1) ... [2021-12-15 23:42:16,303 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 23:42:16,316 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 23:42:16,467 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-15 23:42:16,474 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 23:42:16,499 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 23:42:16,513 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-15 23:42:16,513 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 23:42:16,522 INFO L208 MainTranslator]: Completed translation [2021-12-15 23:42:16,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:42:16 WrapperNode [2021-12-15 23:42:16,522 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 23:42:16,523 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 23:42:16,523 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 23:42:16,523 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 23:42:16,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:42:16" (1/1) ... [2021-12-15 23:42:16,533 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:42:16" (1/1) ... [2021-12-15 23:42:16,555 INFO L137 Inliner]: procedures = 18, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 52 [2021-12-15 23:42:16,555 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 23:42:16,556 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 23:42:16,556 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 23:42:16,557 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 23:42:16,562 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:42:16" (1/1) ... [2021-12-15 23:42:16,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:42:16" (1/1) ... [2021-12-15 23:42:16,574 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:42:16" (1/1) ... [2021-12-15 23:42:16,575 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:42:16" (1/1) ... [2021-12-15 23:42:16,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:42:16" (1/1) ... [2021-12-15 23:42:16,582 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:42:16" (1/1) ... [2021-12-15 23:42:16,582 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:42:16" (1/1) ... [2021-12-15 23:42:16,584 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 23:42:16,585 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 23:42:16,585 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 23:42:16,585 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 23:42:16,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:42:16" (1/1) ... [2021-12-15 23:42:16,592 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 23:42:16,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:42:16,612 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-15 23:42:16,621 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-15 23:42:16,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 23:42:16,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 23:42:16,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 23:42:16,641 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2021-12-15 23:42:16,641 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2021-12-15 23:42:16,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2021-12-15 23:42:16,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 23:42:16,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 23:42:16,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 23:42:16,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 23:42:16,687 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 23:42:16,688 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 23:42:16,853 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 23:42:16,857 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 23:42:16,871 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-15 23:42:16,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:42:16 BoogieIcfgContainer [2021-12-15 23:42:16,873 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 23:42:16,874 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 23:42:16,874 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 23:42:16,877 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 23:42:16,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 11:42:16" (1/3) ... [2021-12-15 23:42:16,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74307a3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:42:16, skipping insertion in model container [2021-12-15 23:42:16,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:42:16" (2/3) ... [2021-12-15 23:42:16,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74307a3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:42:16, skipping insertion in model container [2021-12-15 23:42:16,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:42:16" (3/3) ... [2021-12-15 23:42:16,879 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1251b.c [2021-12-15 23:42:16,882 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 23:42:16,882 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-15 23:42:16,939 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 23:42:16,959 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-15 23:42:16,960 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-15 23:42:16,973 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-15 23:42:16,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-15 23:42:16,978 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:42:16,978 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:42:16,979 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:42:16,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:42:16,985 INFO L85 PathProgramCache]: Analyzing trace with hash 87468236, now seen corresponding path program 1 times [2021-12-15 23:42:16,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:42:16,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944976958] [2021-12-15 23:42:16,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:42:16,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:42:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:42:17,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-15 23:42:17,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:42:17,165 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-15 23:42:17,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:42:17,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944976958] [2021-12-15 23:42:17,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944976958] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:42:17,167 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:42:17,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 23:42:17,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51643772] [2021-12-15 23:42:17,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:42:17,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 23:42:17,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:42:17,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 23:42:17,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 23:42:17,195 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-15 23:42:17,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:42:17,225 INFO L93 Difference]: Finished difference Result 53 states and 75 transitions. [2021-12-15 23:42:17,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 23:42:17,227 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-15 23:42:17,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:42:17,234 INFO L225 Difference]: With dead ends: 53 [2021-12-15 23:42:17,234 INFO L226 Difference]: Without dead ends: 25 [2021-12-15 23:42:17,237 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-15 23:42:17,242 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-15 23:42:17,243 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-15 23:42:17,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-15 23:42:17,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-12-15 23:42:17,266 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-15 23:42:17,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2021-12-15 23:42:17,267 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 15 [2021-12-15 23:42:17,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:42:17,268 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2021-12-15 23:42:17,268 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-15 23:42:17,268 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2021-12-15 23:42:17,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-15 23:42:17,269 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:42:17,269 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:42:17,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 23:42:17,270 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:42:17,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:42:17,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1072117413, now seen corresponding path program 1 times [2021-12-15 23:42:17,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:42:17,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334639828] [2021-12-15 23:42:17,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:42:17,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:42:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:42:17,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-15 23:42:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:42:17,408 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-15 23:42:17,409 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:42:17,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334639828] [2021-12-15 23:42:17,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334639828] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:42:17,410 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:42:17,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 23:42:17,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45641437] [2021-12-15 23:42:17,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:42:17,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 23:42:17,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:42:17,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 23:42:17,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 23:42:17,414 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-15 23:42:17,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:42:17,453 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2021-12-15 23:42:17,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 23:42:17,454 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-15 23:42:17,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:42:17,456 INFO L225 Difference]: With dead ends: 33 [2021-12-15 23:42:17,456 INFO L226 Difference]: Without dead ends: 29 [2021-12-15 23:42:17,457 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-15 23:42:17,457 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-15 23:42:17,458 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-15 23:42:17,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-15 23:42:17,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-12-15 23:42:17,464 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-15 23:42:17,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2021-12-15 23:42:17,465 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 16 [2021-12-15 23:42:17,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:42:17,465 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2021-12-15 23:42:17,466 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-15 23:42:17,466 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2021-12-15 23:42:17,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-15 23:42:17,466 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:42:17,466 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:42:17,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 23:42:17,471 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:42:17,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:42:17,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1361378825, now seen corresponding path program 1 times [2021-12-15 23:42:17,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:42:17,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387794546] [2021-12-15 23:42:17,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:42:17,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:42:17,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:42:17,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-15 23:42:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:42:17,547 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-15 23:42:17,547 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:42:17,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387794546] [2021-12-15 23:42:17,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387794546] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:42:17,548 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:42:17,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 23:42:17,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792311191] [2021-12-15 23:42:17,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:42:17,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 23:42:17,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:42:17,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 23:42:17,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 23:42:17,550 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-15 23:42:17,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:42:17,569 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2021-12-15 23:42:17,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 23:42:17,569 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-15 23:42:17,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:42:17,570 INFO L225 Difference]: With dead ends: 37 [2021-12-15 23:42:17,570 INFO L226 Difference]: Without dead ends: 33 [2021-12-15 23:42:17,571 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-15 23:42:17,571 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-15 23:42:17,572 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-15 23:42:17,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-12-15 23:42:17,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2021-12-15 23:42:17,576 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-15 23:42:17,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2021-12-15 23:42:17,577 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 17 [2021-12-15 23:42:17,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:42:17,577 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2021-12-15 23:42:17,577 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-15 23:42:17,577 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2021-12-15 23:42:17,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-15 23:42:17,578 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:42:17,578 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-15 23:42:17,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-15 23:42:17,579 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:42:17,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:42:17,579 INFO L85 PathProgramCache]: Analyzing trace with hash -2128342377, now seen corresponding path program 1 times [2021-12-15 23:42:17,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:42:17,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777833315] [2021-12-15 23:42:17,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:42:17,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:42:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:42:17,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-15 23:42:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:42:17,644 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-15 23:42:17,644 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:42:17,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777833315] [2021-12-15 23:42:17,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777833315] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:42:17,645 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:42:17,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 23:42:17,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579600854] [2021-12-15 23:42:17,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:42:17,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 23:42:17,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:42:17,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 23:42:17,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 23:42:17,647 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-15 23:42:17,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:42:17,666 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2021-12-15 23:42:17,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 23:42:17,666 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-15 23:42:17,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:42:17,667 INFO L225 Difference]: With dead ends: 37 [2021-12-15 23:42:17,667 INFO L226 Difference]: Without dead ends: 33 [2021-12-15 23:42:17,667 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-15 23:42:17,668 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-15 23:42:17,669 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-15 23:42:17,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-12-15 23:42:17,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2021-12-15 23:42:17,672 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-15 23:42:17,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2021-12-15 23:42:17,673 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 18 [2021-12-15 23:42:17,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:42:17,673 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2021-12-15 23:42:17,674 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-15 23:42:17,674 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2021-12-15 23:42:17,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-15 23:42:17,674 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:42:17,675 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-15 23:42:17,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-15 23:42:17,675 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:42:17,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:42:17,676 INFO L85 PathProgramCache]: Analyzing trace with hash -259243195, now seen corresponding path program 1 times [2021-12-15 23:42:17,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:42:17,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146493196] [2021-12-15 23:42:17,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:42:17,676 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:42:17,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:42:17,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-15 23:42:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:42:17,726 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-15 23:42:17,727 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:42:17,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146493196] [2021-12-15 23:42:17,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146493196] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:42:17,727 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:42:17,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 23:42:17,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697912100] [2021-12-15 23:42:17,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:42:17,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 23:42:17,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:42:17,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 23:42:17,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 23:42:17,735 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-15 23:42:17,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:42:17,753 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2021-12-15 23:42:17,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 23:42:17,754 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-15 23:42:17,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:42:17,754 INFO L225 Difference]: With dead ends: 37 [2021-12-15 23:42:17,755 INFO L226 Difference]: Without dead ends: 33 [2021-12-15 23:42:17,755 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-15 23:42:17,756 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-15 23:42:17,756 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-15 23:42:17,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-12-15 23:42:17,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2021-12-15 23:42:17,759 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-15 23:42:17,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2021-12-15 23:42:17,760 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 19 [2021-12-15 23:42:17,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:42:17,761 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2021-12-15 23:42:17,761 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-15 23:42:17,761 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2021-12-15 23:42:17,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-15 23:42:17,762 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:42:17,762 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-15 23:42:17,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-15 23:42:17,762 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:42:17,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:42:17,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1483567140, now seen corresponding path program 1 times [2021-12-15 23:42:17,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:42:17,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647839039] [2021-12-15 23:42:17,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:42:17,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:42:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 23:42:17,776 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 23:42:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 23:42:17,804 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 23:42:17,805 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-15 23:42:17,806 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-15 23:42:17,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-15 23:42:17,810 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2021-12-15 23:42:17,812 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-15 23:42:17,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 11:42:17 BoogieIcfgContainer [2021-12-15 23:42:17,838 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-15 23:42:17,839 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-15 23:42:17,839 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-15 23:42:17,839 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-15 23:42:17,840 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:42:16" (3/4) ... [2021-12-15 23:42:17,842 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-15 23:42:17,842 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-15 23:42:17,843 INFO L158 Benchmark]: Toolchain (without parser) took 1563.53ms. Allocated memory was 113.2MB in the beginning and 153.1MB in the end (delta: 39.8MB). Free memory was 86.2MB in the beginning and 119.8MB in the end (delta: -33.6MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2021-12-15 23:42:17,843 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 92.3MB. Free memory is still 49.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 23:42:17,843 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.39ms. Allocated memory is still 113.2MB. Free memory was 85.9MB in the beginning and 88.8MB in the end (delta: -2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 23:42:17,845 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.42ms. Allocated memory is still 113.2MB. Free memory was 88.8MB in the beginning and 87.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 23:42:17,846 INFO L158 Benchmark]: Boogie Preprocessor took 27.65ms. Allocated memory is still 113.2MB. Free memory was 87.3MB in the beginning and 85.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 23:42:17,846 INFO L158 Benchmark]: RCFGBuilder took 288.66ms. Allocated memory is still 113.2MB. Free memory was 85.8MB in the beginning and 74.7MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-15 23:42:17,846 INFO L158 Benchmark]: TraceAbstraction took 963.96ms. Allocated memory was 113.2MB in the beginning and 153.1MB in the end (delta: 39.8MB). Free memory was 74.2MB in the beginning and 120.2MB in the end (delta: -46.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 23:42:17,846 INFO L158 Benchmark]: Witness Printer took 3.42ms. Allocated memory is still 153.1MB. Free memory was 120.2MB in the beginning and 119.8MB in the end (delta: 455.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 23:42:17,849 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 92.3MB. Free memory is still 49.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 242.39ms. Allocated memory is still 113.2MB. Free memory was 85.9MB in the beginning and 88.8MB in the end (delta: -2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.42ms. Allocated memory is still 113.2MB. Free memory was 88.8MB in the beginning and 87.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.65ms. Allocated memory is still 113.2MB. Free memory was 87.3MB in the beginning and 85.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 288.66ms. Allocated memory is still 113.2MB. Free memory was 85.8MB in the beginning and 74.7MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 963.96ms. Allocated memory was 113.2MB in the beginning and 153.1MB in the end (delta: 39.8MB). Free memory was 74.2MB in the beginning and 120.2MB in the end (delta: -46.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.42ms. Allocated memory is still 153.1MB. Free memory was 120.2MB in the beginning and 119.8MB in the end (delta: 455.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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)=4294967298, \result=0, x=4294967298] [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)=4294967298] [L29] __uint32_t msw, lsw; VAL [\old(x)=4294967298, x=4294967298] [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)=4294967298, lsw=4294967297, msw=2146435073, x=4294967298] [L41-L42] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=4294967298, lsw=4294967297, msw=2146435073, x=4294967298] [L44-L45] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=4294967298, lsw=4294967297, msw=2146435073, x=4294967298] [L48-L49] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L52] return 0; VAL [\old(x)=4294967298, \result=0, lsw=4294967297, msw=2146435073, x=4294967298] [L57] RET, EXPR __fpclassify_double(x) VAL [\old(x)=4294967298, \old(y)=4294967299, __fpclassify_double(x)=0, x=4294967298, y=4294967299] [L57] COND TRUE __fpclassify_double(x) == 0 [L58] return y; VAL [\old(x)=4294967298, \old(y)=4294967299, \result=4294967299, x=4294967298, y=4294967299] [L76] RET, EXPR fmax_double(x, y) [L76] double res = fmax_double(x, y); [L79] COND TRUE res != x VAL [res=4294967299, x=4294967298, y=4294967299] [L80] reach_error() VAL [res=4294967299, x=4294967298, y=4294967299] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, 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, 196 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-15 23:42:17,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_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-tmp.no-commuhash-c3fed41 [2021-12-15 23:42:19,711 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 23:42:19,713 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 23:42:19,744 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 23:42:19,744 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 23:42:19,747 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 23:42:19,748 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 23:42:19,751 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 23:42:19,753 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 23:42:19,756 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 23:42:19,757 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 23:42:19,760 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 23:42:19,760 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 23:42:19,762 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 23:42:19,763 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 23:42:19,765 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 23:42:19,766 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 23:42:19,766 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 23:42:19,768 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 23:42:19,772 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 23:42:19,774 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 23:42:19,774 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 23:42:19,775 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 23:42:19,777 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 23:42:19,781 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 23:42:19,782 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 23:42:19,782 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 23:42:19,783 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 23:42:19,783 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 23:42:19,791 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 23:42:19,792 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 23:42:19,792 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 23:42:19,800 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 23:42:19,801 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 23:42:19,802 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 23:42:19,802 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 23:42:19,802 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 23:42:19,803 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 23:42:19,803 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 23:42:19,804 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 23:42:19,806 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 23:42:19,807 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-15 23:42:19,836 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 23:42:19,836 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 23:42:19,837 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 23:42:19,837 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 23:42:19,838 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 23:42:19,838 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 23:42:19,839 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 23:42:19,839 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 23:42:19,839 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 23:42:19,840 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 23:42:19,840 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 23:42:19,840 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 23:42:19,841 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 23:42:19,841 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-15 23:42:19,841 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 23:42:19,841 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-15 23:42:19,841 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-15 23:42:19,841 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-15 23:42:19,841 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-15 23:42:19,842 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 23:42:19,842 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 23:42:19,842 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 23:42:19,842 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-15 23:42:19,842 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 23:42:19,842 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 23:42:19,842 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 23:42:19,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 23:42:19,843 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 23:42:19,843 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 23:42:19,843 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-15 23:42:19,843 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-15 23:42:19,843 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-15 23:42:19,844 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-15 23:42:19,844 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-15 23:42:19,844 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-15 23:42:19,844 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 23:42:19,844 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-15 23:42:19,844 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-15 23:42:20,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 23:42:20,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 23:42:20,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 23:42:20,230 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 23:42:20,233 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 23:42:20,233 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-15 23:42:20,294 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af62a0d53/b56f4f4bfad544569bda6d6034c65f0a/FLAG31c4ceb7a [2021-12-15 23:42:20,691 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 23:42:20,692 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1251b.c [2021-12-15 23:42:20,697 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af62a0d53/b56f4f4bfad544569bda6d6034c65f0a/FLAG31c4ceb7a [2021-12-15 23:42:20,707 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af62a0d53/b56f4f4bfad544569bda6d6034c65f0a [2021-12-15 23:42:20,708 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 23:42:20,709 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 23:42:20,710 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 23:42:20,711 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 23:42:20,713 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 23:42:20,716 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:42:20" (1/1) ... [2021-12-15 23:42:20,717 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70eee2bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:42:20, skipping insertion in model container [2021-12-15 23:42:20,717 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:42:20" (1/1) ... [2021-12-15 23:42:20,722 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 23:42:20,732 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 23:42:20,862 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-15 23:42:20,872 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 23:42:20,883 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 23:42:20,914 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-15 23:42:20,919 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 23:42:20,935 INFO L208 MainTranslator]: Completed translation [2021-12-15 23:42:20,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:42:20 WrapperNode [2021-12-15 23:42:20,940 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 23:42:20,941 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 23:42:20,941 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 23:42:20,941 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 23:42:20,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:42:20" (1/1) ... [2021-12-15 23:42:20,959 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:42:20" (1/1) ... [2021-12-15 23:42:20,973 INFO L137 Inliner]: procedures = 21, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 50 [2021-12-15 23:42:20,974 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 23:42:20,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 23:42:20,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 23:42:20,975 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 23:42:20,980 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:42:20" (1/1) ... [2021-12-15 23:42:20,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:42:20" (1/1) ... [2021-12-15 23:42:20,986 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:42:20" (1/1) ... [2021-12-15 23:42:20,987 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:42:20" (1/1) ... [2021-12-15 23:42:21,003 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:42:20" (1/1) ... [2021-12-15 23:42:21,008 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:42:20" (1/1) ... [2021-12-15 23:42:21,009 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:42:20" (1/1) ... [2021-12-15 23:42:21,014 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 23:42:21,015 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 23:42:21,016 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 23:42:21,016 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 23:42:21,017 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:42:20" (1/1) ... [2021-12-15 23:42:21,022 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 23:42:21,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:42:21,069 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-15 23:42:21,091 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-15 23:42:21,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 23:42:21,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2021-12-15 23:42:21,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-15 23:42:21,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 23:42:21,098 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2021-12-15 23:42:21,098 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2021-12-15 23:42:21,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-15 23:42:21,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 23:42:21,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 23:42:21,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 23:42:21,164 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 23:42:21,165 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 23:42:21,352 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 23:42:21,356 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 23:42:21,356 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-15 23:42:21,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:42:21 BoogieIcfgContainer [2021-12-15 23:42:21,357 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 23:42:21,358 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 23:42:21,359 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 23:42:21,361 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 23:42:21,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 11:42:20" (1/3) ... [2021-12-15 23:42:21,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d38ac47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:42:21, skipping insertion in model container [2021-12-15 23:42:21,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:42:20" (2/3) ... [2021-12-15 23:42:21,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d38ac47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:42:21, skipping insertion in model container [2021-12-15 23:42:21,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:42:21" (3/3) ... [2021-12-15 23:42:21,373 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1251b.c [2021-12-15 23:42:21,377 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 23:42:21,377 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-15 23:42:21,428 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 23:42:21,437 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-15 23:42:21,438 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-15 23:42:21,464 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-15 23:42:21,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-15 23:42:21,472 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:42:21,472 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:42:21,473 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:42:21,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:42:21,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1684133472, now seen corresponding path program 1 times [2021-12-15 23:42:21,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 23:42:21,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1443385338] [2021-12-15 23:42:21,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:42:21,490 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 23:42:21,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 23:42:21,497 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-15 23:42:21,526 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-15 23:42:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:42:21,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-15 23:42:21,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:42:21,645 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-15 23:42:21,645 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 23:42:21,645 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 23:42:21,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1443385338] [2021-12-15 23:42:21,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1443385338] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:42:21,647 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:42:21,647 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 23:42:21,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087427167] [2021-12-15 23:42:21,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:42:21,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-15 23:42:21,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 23:42:21,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-15 23:42:21,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 23:42:21,674 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-15 23:42:21,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:42:21,691 INFO L93 Difference]: Finished difference Result 49 states and 71 transitions. [2021-12-15 23:42:21,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 23:42:21,693 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-15 23:42:21,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:42:21,704 INFO L225 Difference]: With dead ends: 49 [2021-12-15 23:42:21,704 INFO L226 Difference]: Without dead ends: 23 [2021-12-15 23:42:21,706 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-15 23:42:21,709 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-15 23:42:21,711 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-15 23:42:21,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-12-15 23:42:21,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-12-15 23:42:21,742 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-15 23:42:21,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2021-12-15 23:42:21,745 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 14 [2021-12-15 23:42:21,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:42:21,746 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2021-12-15 23:42:21,746 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-15 23:42:21,746 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2021-12-15 23:42:21,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-15 23:42:21,748 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:42:21,748 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:42:21,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-15 23:42:21,956 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-15 23:42:21,957 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:42:21,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:42:21,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1014515731, now seen corresponding path program 1 times [2021-12-15 23:42:21,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 23:42:21,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1308559425] [2021-12-15 23:42:21,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:42:21,958 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 23:42:21,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 23:42:21,960 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-15 23:42:21,961 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-15 23:42:22,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:42:22,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-15 23:42:22,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:42:22,133 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-15 23:42:22,134 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 23:42:22,134 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 23:42:22,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1308559425] [2021-12-15 23:42:22,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1308559425] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:42:22,135 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:42:22,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 23:42:22,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106633226] [2021-12-15 23:42:22,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:42:22,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 23:42:22,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 23:42:22,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 23:42:22,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 23:42:22,137 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-15 23:42:22,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:42:22,200 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2021-12-15 23:42:22,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 23:42:22,201 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-15 23:42:22,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:42:22,203 INFO L225 Difference]: With dead ends: 30 [2021-12-15 23:42:22,203 INFO L226 Difference]: Without dead ends: 26 [2021-12-15 23:42:22,203 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-15 23:42:22,204 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2021-12-15 23:42:22,204 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.1s Time] [2021-12-15 23:42:22,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-12-15 23:42:22,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-12-15 23:42:22,209 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-15 23:42:22,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2021-12-15 23:42:22,209 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 15 [2021-12-15 23:42:22,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:42:22,210 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2021-12-15 23:42:22,210 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-15 23:42:22,210 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2021-12-15 23:42:22,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-15 23:42:22,211 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:42:22,211 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:42:22,221 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-15 23:42:22,419 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-15 23:42:22,420 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:42:22,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:42:22,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1185853373, now seen corresponding path program 1 times [2021-12-15 23:42:22,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 23:42:22,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1474115151] [2021-12-15 23:42:22,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:42:22,422 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 23:42:22,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 23:42:22,424 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-15 23:42:22,425 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-15 23:42:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:42:22,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-15 23:42:22,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:42:22,555 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-15 23:42:22,556 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 23:42:22,556 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 23:42:22,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1474115151] [2021-12-15 23:42:22,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1474115151] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:42:22,556 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:42:22,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 23:42:22,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816099817] [2021-12-15 23:42:22,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:42:22,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 23:42:22,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 23:42:22,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 23:42:22,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 23:42:22,558 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-15 23:42:22,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:42:22,579 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2021-12-15 23:42:22,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 23:42:22,580 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-15 23:42:22,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:42:22,581 INFO L225 Difference]: With dead ends: 33 [2021-12-15 23:42:22,581 INFO L226 Difference]: Without dead ends: 29 [2021-12-15 23:42:22,581 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-15 23:42:22,582 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-15 23:42:22,582 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-15 23:42:22,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-15 23:42:22,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2021-12-15 23:42:22,586 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-15 23:42:22,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2021-12-15 23:42:22,587 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 16 [2021-12-15 23:42:22,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:42:22,587 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2021-12-15 23:42:22,587 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-15 23:42:22,587 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2021-12-15 23:42:22,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-15 23:42:22,595 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:42:22,595 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:42:22,606 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-15 23:42:22,804 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-15 23:42:22,804 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:42:22,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:42:22,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1347661745, now seen corresponding path program 1 times [2021-12-15 23:42:22,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 23:42:22,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [393880196] [2021-12-15 23:42:22,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:42:22,806 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 23:42:22,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 23:42:22,807 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-15 23:42:22,809 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-15 23:42:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:42:22,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-15 23:42:22,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:42:22,921 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-15 23:42:22,921 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 23:42:22,921 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 23:42:22,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [393880196] [2021-12-15 23:42:22,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [393880196] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:42:22,923 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:42:22,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 23:42:22,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291516183] [2021-12-15 23:42:22,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:42:22,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 23:42:22,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 23:42:22,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 23:42:22,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 23:42:22,925 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-15 23:42:22,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:42:22,944 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2021-12-15 23:42:22,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 23:42:22,944 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-15 23:42:22,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:42:22,945 INFO L225 Difference]: With dead ends: 33 [2021-12-15 23:42:22,945 INFO L226 Difference]: Without dead ends: 29 [2021-12-15 23:42:22,946 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-15 23:42:22,947 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-15 23:42:22,947 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-15 23:42:22,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-15 23:42:22,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2021-12-15 23:42:22,951 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-15 23:42:22,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2021-12-15 23:42:22,953 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 17 [2021-12-15 23:42:22,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:42:22,953 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2021-12-15 23:42:22,954 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-15 23:42:22,954 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2021-12-15 23:42:22,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-15 23:42:22,954 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:42:22,955 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-15 23:42:22,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-12-15 23:42:23,163 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-15 23:42:23,163 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:42:23,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:42:23,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1832266503, now seen corresponding path program 1 times [2021-12-15 23:42:23,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 23:42:23,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1294968685] [2021-12-15 23:42:23,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:42:23,165 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 23:42:23,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 23:42:23,167 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-15 23:42:23,168 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-15 23:42:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:42:23,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-15 23:42:23,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:42:23,263 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-15 23:42:23,264 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 23:42:23,264 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 23:42:23,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1294968685] [2021-12-15 23:42:23,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1294968685] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:42:23,268 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:42:23,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 23:42:23,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296143178] [2021-12-15 23:42:23,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:42:23,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 23:42:23,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 23:42:23,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 23:42:23,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 23:42:23,271 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-15 23:42:23,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:42:23,295 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2021-12-15 23:42:23,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 23:42:23,309 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-15 23:42:23,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:42:23,309 INFO L225 Difference]: With dead ends: 33 [2021-12-15 23:42:23,309 INFO L226 Difference]: Without dead ends: 29 [2021-12-15 23:42:23,310 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-15 23:42:23,310 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-15 23:42:23,311 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-15 23:42:23,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-15 23:42:23,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2021-12-15 23:42:23,314 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-15 23:42:23,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2021-12-15 23:42:23,315 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 18 [2021-12-15 23:42:23,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:42:23,315 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2021-12-15 23:42:23,315 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-15 23:42:23,315 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2021-12-15 23:42:23,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-15 23:42:23,316 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:42:23,316 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-15 23:42:23,324 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-15 23:42:23,524 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-15 23:42:23,525 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:42:23,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:42:23,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1575197112, now seen corresponding path program 1 times [2021-12-15 23:42:23,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 23:42:23,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1391625132] [2021-12-15 23:42:23,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:42:23,526 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 23:42:23,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 23:42:23,527 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-15 23:42:23,529 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-15 23:42:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:42:23,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-15 23:42:23,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:42:23,719 INFO L388 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-15 23:42:24,453 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-15 23:42:24,453 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 23:42:24,453 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 23:42:24,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1391625132] [2021-12-15 23:42:24,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1391625132] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:42:24,454 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:42:24,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-15 23:42:24,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166804633] [2021-12-15 23:42:24,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:42:24,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-15 23:42:24,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 23:42:24,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-15 23:42:24,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-12-15 23:42:24,455 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-15 23:42:24,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:42:24,574 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2021-12-15 23:42:24,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 23:42:24,575 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-15 23:42:24,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:42:24,576 INFO L225 Difference]: With dead ends: 45 [2021-12-15 23:42:24,576 INFO L226 Difference]: Without dead ends: 25 [2021-12-15 23:42:24,576 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-15 23:42:24,577 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-15 23:42:24,577 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-15 23:42:24,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-15 23:42:24,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-12-15 23:42:24,580 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-15 23:42:24,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2021-12-15 23:42:24,581 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 18 [2021-12-15 23:42:24,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:42:24,581 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2021-12-15 23:42:24,581 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-15 23:42:24,581 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2021-12-15 23:42:24,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-15 23:42:24,582 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:42:24,582 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-15 23:42:24,590 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-15 23:42:24,790 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-15 23:42:24,790 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:42:24,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:42:24,790 INFO L85 PathProgramCache]: Analyzing trace with hash 789982401, now seen corresponding path program 1 times [2021-12-15 23:42:24,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 23:42:24,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [691350883] [2021-12-15 23:42:24,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:42:24,791 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 23:42:24,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 23:42:24,792 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-15 23:42:24,794 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-15 23:42:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:42:24,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-15 23:42:24,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:42:24,889 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-15 23:42:24,889 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 23:42:24,890 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 23:42:24,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [691350883] [2021-12-15 23:42:24,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [691350883] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:42:24,890 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:42:24,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 23:42:24,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737916794] [2021-12-15 23:42:24,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:42:24,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 23:42:24,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 23:42:24,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 23:42:24,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 23:42:24,891 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-15 23:42:24,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:42:24,941 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2021-12-15 23:42:24,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 23:42:24,941 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-15 23:42:24,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:42:24,942 INFO L225 Difference]: With dead ends: 32 [2021-12-15 23:42:24,942 INFO L226 Difference]: Without dead ends: 28 [2021-12-15 23:42:24,942 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-15 23:42:24,943 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-15 23:42:24,943 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-15 23:42:24,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-12-15 23:42:24,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-12-15 23:42:24,946 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-15 23:42:24,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2021-12-15 23:42:24,947 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 23 [2021-12-15 23:42:24,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:42:24,947 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2021-12-15 23:42:24,947 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-15 23:42:24,947 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2021-12-15 23:42:24,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-15 23:42:24,948 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:42:24,948 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-15 23:42:24,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-15 23:42:25,174 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-15 23:42:25,174 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:42:25,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:42:25,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1141759769, now seen corresponding path program 1 times [2021-12-15 23:42:25,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 23:42:25,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [580012094] [2021-12-15 23:42:25,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:42:25,175 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 23:42:25,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 23:42:25,176 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-15 23:42:25,178 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-15 23:42:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:42:25,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-15 23:42:25,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:42:25,271 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-15 23:42:25,271 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 23:42:25,271 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 23:42:25,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [580012094] [2021-12-15 23:42:25,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [580012094] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:42:25,271 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:42:25,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 23:42:25,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570960027] [2021-12-15 23:42:25,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:42:25,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 23:42:25,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 23:42:25,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 23:42:25,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 23:42:25,273 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-15 23:42:25,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:42:25,303 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2021-12-15 23:42:25,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 23:42:25,304 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-15 23:42:25,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:42:25,305 INFO L225 Difference]: With dead ends: 35 [2021-12-15 23:42:25,305 INFO L226 Difference]: Without dead ends: 31 [2021-12-15 23:42:25,305 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-15 23:42:25,306 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-15 23:42:25,306 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-15 23:42:25,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-15 23:42:25,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2021-12-15 23:42:25,309 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-15 23:42:25,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2021-12-15 23:42:25,309 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 24 [2021-12-15 23:42:25,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:42:25,309 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2021-12-15 23:42:25,309 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-15 23:42:25,309 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2021-12-15 23:42:25,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-15 23:42:25,310 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:42:25,310 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-15 23:42:25,321 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-15 23:42:25,510 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-15 23:42:25,511 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:42:25,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:42:25,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1641177467, now seen corresponding path program 1 times [2021-12-15 23:42:25,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 23:42:25,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1672780564] [2021-12-15 23:42:25,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:42:25,512 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 23:42:25,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 23:42:25,513 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-15 23:42:25,515 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-15 23:42:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:42:25,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-15 23:42:25,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:42:25,629 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-15 23:42:25,629 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 23:42:25,629 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 23:42:25,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1672780564] [2021-12-15 23:42:25,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1672780564] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:42:25,629 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:42:25,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 23:42:25,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599070416] [2021-12-15 23:42:25,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:42:25,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 23:42:25,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 23:42:25,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 23:42:25,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 23:42:25,630 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-15 23:42:25,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:42:25,677 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2021-12-15 23:42:25,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 23:42:25,677 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-15 23:42:25,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:42:25,678 INFO L225 Difference]: With dead ends: 35 [2021-12-15 23:42:25,678 INFO L226 Difference]: Without dead ends: 31 [2021-12-15 23:42:25,678 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-15 23:42:25,678 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-15 23:42:25,678 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-15 23:42:25,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-15 23:42:25,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2021-12-15 23:42:25,681 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-15 23:42:25,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2021-12-15 23:42:25,681 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 25 [2021-12-15 23:42:25,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:42:25,682 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2021-12-15 23:42:25,682 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-15 23:42:25,682 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2021-12-15 23:42:25,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-15 23:42:25,682 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:42:25,682 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-15 23:42:25,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-15 23:42:25,885 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-15 23:42:25,886 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:42:25,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:42:25,886 INFO L85 PathProgramCache]: Analyzing trace with hash -984557701, now seen corresponding path program 1 times [2021-12-15 23:42:25,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 23:42:25,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1154005787] [2021-12-15 23:42:25,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:42:25,887 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 23:42:25,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 23:42:25,888 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-15 23:42:25,890 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-15 23:42:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:42:25,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 23:42:25,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:42:26,070 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-15 23:42:26,070 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 23:42:26,070 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 23:42:26,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1154005787] [2021-12-15 23:42:26,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1154005787] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:42:26,070 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:42:26,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 23:42:26,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649084955] [2021-12-15 23:42:26,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:42:26,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 23:42:26,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 23:42:26,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 23:42:26,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 23:42:26,071 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-15 23:42:26,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:42:26,073 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2021-12-15 23:42:26,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 23:42:26,074 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-15 23:42:26,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:42:26,074 INFO L225 Difference]: With dead ends: 37 [2021-12-15 23:42:26,074 INFO L226 Difference]: Without dead ends: 32 [2021-12-15 23:42:26,074 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-15 23:42:26,075 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-15 23:42:26,075 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-15 23:42:26,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-12-15 23:42:26,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2021-12-15 23:42:26,077 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-15 23:42:26,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2021-12-15 23:42:26,078 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 25 [2021-12-15 23:42:26,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:42:26,078 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2021-12-15 23:42:26,078 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-15 23:42:26,078 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2021-12-15 23:42:26,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-15 23:42:26,078 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:42:26,079 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-15 23:42:26,101 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-15 23:42:26,287 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-15 23:42:26,287 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:42:26,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:42:26,288 INFO L85 PathProgramCache]: Analyzing trace with hash -982710659, now seen corresponding path program 1 times [2021-12-15 23:42:26,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 23:42:26,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1647664874] [2021-12-15 23:42:26,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:42:26,289 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 23:42:26,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 23:42:26,289 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-15 23:42:26,291 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-15 23:42:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:42:26,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 23:42:26,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:42:26,608 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-15 23:42:26,609 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 23:42:26,609 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 23:42:26,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1647664874] [2021-12-15 23:42:26,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1647664874] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:42:26,609 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:42:26,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 23:42:26,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468047147] [2021-12-15 23:42:26,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:42:26,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 23:42:26,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 23:42:26,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 23:42:26,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-15 23:42:26,611 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-15 23:42:26,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:42:26,659 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2021-12-15 23:42:26,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 23:42:26,659 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-15 23:42:26,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:42:26,660 INFO L225 Difference]: With dead ends: 41 [2021-12-15 23:42:26,660 INFO L226 Difference]: Without dead ends: 34 [2021-12-15 23:42:26,660 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-15 23:42:26,661 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-15 23:42:26,661 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-15 23:42:26,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-15 23:42:26,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2021-12-15 23:42:26,667 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-15 23:42:26,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2021-12-15 23:42:26,668 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 25 [2021-12-15 23:42:26,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:42:26,670 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2021-12-15 23:42:26,670 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-15 23:42:26,670 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2021-12-15 23:42:26,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-15 23:42:26,674 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:42:26,674 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-15 23:42:26,699 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-15 23:42:26,883 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-15 23:42:26,883 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:42:26,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:42:26,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1961064157, now seen corresponding path program 1 times [2021-12-15 23:42:26,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 23:42:26,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [332870261] [2021-12-15 23:42:26,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:42:26,885 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 23:42:26,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 23:42:26,885 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-15 23:42:26,887 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-15 23:42:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:42:26,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 23:42:26,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:42:27,204 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-15 23:42:27,204 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 23:42:27,204 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 23:42:27,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [332870261] [2021-12-15 23:42:27,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [332870261] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:42:27,205 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:42:27,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 23:42:27,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355306119] [2021-12-15 23:42:27,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:42:27,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 23:42:27,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 23:42:27,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 23:42:27,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-15 23:42:27,206 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-15 23:42:27,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:42:27,229 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2021-12-15 23:42:27,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 23:42:27,229 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-15 23:42:27,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:42:27,230 INFO L225 Difference]: With dead ends: 43 [2021-12-15 23:42:27,230 INFO L226 Difference]: Without dead ends: 36 [2021-12-15 23:42:27,230 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-15 23:42:27,230 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-15 23:42:27,231 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-15 23:42:27,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-12-15 23:42:27,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2021-12-15 23:42:27,234 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-15 23:42:27,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2021-12-15 23:42:27,234 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 26 [2021-12-15 23:42:27,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:42:27,234 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2021-12-15 23:42:27,234 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-15 23:42:27,234 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2021-12-15 23:42:27,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-15 23:42:27,235 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:42:27,235 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-15 23:42:27,246 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-15 23:42:27,444 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-15 23:42:27,444 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:42:27,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:42:27,444 INFO L85 PathProgramCache]: Analyzing trace with hash -688209493, now seen corresponding path program 1 times [2021-12-15 23:42:27,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 23:42:27,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997544356] [2021-12-15 23:42:27,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:42:27,445 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 23:42:27,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 23:42:27,449 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-15 23:42:27,451 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-15 23:42:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:42:27,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-15 23:42:27,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:42:27,558 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-15 23:42:27,558 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 23:42:27,558 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 23:42:27,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997544356] [2021-12-15 23:42:27,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [997544356] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:42:27,558 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:42:27,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 23:42:27,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823767168] [2021-12-15 23:42:27,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:42:27,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 23:42:27,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 23:42:27,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 23:42:27,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 23:42:27,559 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-15 23:42:27,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:42:27,682 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2021-12-15 23:42:27,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 23:42:27,682 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-15 23:42:27,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:42:27,682 INFO L225 Difference]: With dead ends: 35 [2021-12-15 23:42:27,683 INFO L226 Difference]: Without dead ends: 31 [2021-12-15 23:42:27,683 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-15 23:42:27,683 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2021-12-15 23:42:27,683 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.1s Time] [2021-12-15 23:42:27,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-15 23:42:27,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2021-12-15 23:42:27,685 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-15 23:42:27,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2021-12-15 23:42:27,686 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 26 [2021-12-15 23:42:27,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:42:27,686 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2021-12-15 23:42:27,686 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-15 23:42:27,686 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2021-12-15 23:42:27,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-15 23:42:27,687 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:42:27,687 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-15 23:42:27,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2021-12-15 23:42:27,887 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-15 23:42:27,887 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:42:27,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:42:27,888 INFO L85 PathProgramCache]: Analyzing trace with hash 199294188, now seen corresponding path program 1 times [2021-12-15 23:42:27,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 23:42:27,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [898408301] [2021-12-15 23:42:27,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:42:27,888 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 23:42:27,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 23:42:27,889 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-15 23:42:27,891 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-15 23:42:27,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:42:27,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-15 23:42:27,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:42:28,400 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-15 23:42:28,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:42:28,665 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 23:42:28,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [898408301] [2021-12-15 23:42:28,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [898408301] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:42:28,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [200504329] [2021-12-15 23:42:28,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:42:28,665 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-15 23:42:28,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-15 23:42:28,667 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-15 23:42:28,668 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-15 23:42:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:42:28,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-15 23:42:28,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:42:29,446 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-15 23:42:29,446 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 23:42:29,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [200504329] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:42:29,447 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-15 23:42:29,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2021-12-15 23:42:29,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036085241] [2021-12-15 23:42:29,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:42:29,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 23:42:29,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 23:42:29,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 23:42:29,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2021-12-15 23:42:29,448 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-15 23:42:29,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:42:29,774 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2021-12-15 23:42:29,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 23:42:29,774 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-15 23:42:29,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:42:29,775 INFO L225 Difference]: With dead ends: 32 [2021-12-15 23:42:29,775 INFO L226 Difference]: Without dead ends: 28 [2021-12-15 23:42:29,775 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2021-12-15 23:42:29,775 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 17 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2021-12-15 23:42:29,775 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.1s Time] [2021-12-15 23:42:29,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-12-15 23:42:29,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2021-12-15 23:42:29,778 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-15 23:42:29,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-12-15 23:42:29,778 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 26 [2021-12-15 23:42:29,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:42:29,779 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-12-15 23:42:29,779 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-15 23:42:29,779 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2021-12-15 23:42:29,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-15 23:42:29,779 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:42:29,779 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-15 23:42:29,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2021-12-15 23:42:29,988 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-15 23:42:30,180 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-15 23:42:30,180 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:42:30,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:42:30,180 INFO L85 PathProgramCache]: Analyzing trace with hash -865134783, now seen corresponding path program 1 times [2021-12-15 23:42:30,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 23:42:30,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [356741056] [2021-12-15 23:42:30,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:42:30,181 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 23:42:30,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 23:42:30,182 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-15 23:42:30,183 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-15 23:42:30,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:42:30,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 23:42:30,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:42:30,510 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-15 23:42:30,511 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 23:42:30,511 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 23:42:30,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [356741056] [2021-12-15 23:42:30,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [356741056] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:42:30,511 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:42:30,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 23:42:30,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22924116] [2021-12-15 23:42:30,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:42:30,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 23:42:30,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 23:42:30,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 23:42:30,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-15 23:42:30,512 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-15 23:42:30,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:42:30,531 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2021-12-15 23:42:30,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 23:42:30,531 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-15 23:42:30,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:42:30,531 INFO L225 Difference]: With dead ends: 36 [2021-12-15 23:42:30,531 INFO L226 Difference]: Without dead ends: 29 [2021-12-15 23:42:30,531 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-15 23:42:30,532 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-15 23:42:30,532 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-15 23:42:30,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-15 23:42:30,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2021-12-15 23:42:30,534 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-15 23:42:30,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-12-15 23:42:30,534 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 27 [2021-12-15 23:42:30,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:42:30,534 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-12-15 23:42:30,534 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-15 23:42:30,534 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2021-12-15 23:42:30,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-15 23:42:30,535 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:42:30,535 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-15 23:42:30,552 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-15 23:42:30,735 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-15 23:42:30,735 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:42:30,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:42:30,736 INFO L85 PathProgramCache]: Analyzing trace with hash 109054183, now seen corresponding path program 1 times [2021-12-15 23:42:30,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 23:42:30,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1989387156] [2021-12-15 23:42:30,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:42:30,737 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 23:42:30,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 23:42:30,752 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-15 23:42:30,753 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-15 23:42:30,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:42:30,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-15 23:42:30,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:42:30,906 INFO L388 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-15 23:42:31,046 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-15 23:42:31,046 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 23:42:31,046 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 23:42:31,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1989387156] [2021-12-15 23:42:31,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1989387156] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:42:31,047 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:42:31,047 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 23:42:31,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185836271] [2021-12-15 23:42:31,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:42:31,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 23:42:31,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 23:42:31,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 23:42:31,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-15 23:42:31,048 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-15 23:42:31,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:42:31,066 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2021-12-15 23:42:31,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 23:42:31,066 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-15 23:42:31,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:42:31,066 INFO L225 Difference]: With dead ends: 34 [2021-12-15 23:42:31,066 INFO L226 Difference]: Without dead ends: 27 [2021-12-15 23:42:31,067 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-15 23:42:31,067 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-15 23:42:31,067 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-15 23:42:31,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-15 23:42:31,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2021-12-15 23:42:31,069 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-15 23:42:31,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2021-12-15 23:42:31,069 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 28 [2021-12-15 23:42:31,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:42:31,069 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2021-12-15 23:42:31,069 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-15 23:42:31,069 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2021-12-15 23:42:31,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-15 23:42:31,069 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:42:31,070 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-15 23:42:31,091 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-15 23:42:31,270 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-15 23:42:31,270 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:42:31,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:42:31,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1698400280, now seen corresponding path program 1 times [2021-12-15 23:42:31,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 23:42:31,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1747719846] [2021-12-15 23:42:31,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:42:31,271 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 23:42:31,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 23:42:31,272 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-15 23:42:31,273 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-15 23:42:31,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:42:31,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-15 23:42:31,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:42:31,392 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-15 23:42:31,392 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 23:42:31,392 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 23:42:31,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1747719846] [2021-12-15 23:42:31,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1747719846] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:42:31,393 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:42:31,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 23:42:31,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733963922] [2021-12-15 23:42:31,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:42:31,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 23:42:31,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 23:42:31,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 23:42:31,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 23:42:31,393 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-15 23:42:31,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:42:31,410 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2021-12-15 23:42:31,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 23:42:31,410 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-15 23:42:31,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:42:31,410 INFO L225 Difference]: With dead ends: 25 [2021-12-15 23:42:31,410 INFO L226 Difference]: Without dead ends: 0 [2021-12-15 23:42:31,411 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-15 23:42:31,411 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-15 23:42:31,411 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-15 23:42:31,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-15 23:42:31,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-15 23:42:31,411 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-15 23:42:31,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-15 23:42:31,412 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2021-12-15 23:42:31,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:42:31,412 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-15 23:42:31,412 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-15 23:42:31,412 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-15 23:42:31,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-15 23:42:31,413 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-15 23:42:31,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2021-12-15 23:42:31,614 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-15 23:42:31,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-15 23:42:31,992 INFO L858 garLoopResultBuilder]: For program point L31-1(lines 31 36) no Hoare annotation was computed. [2021-12-15 23:42:31,993 INFO L854 garLoopResultBuilder]: At program point L31-2(lines 31 36) the Hoare annotation is: (= __fpclassify_double_~x |__fpclassify_double_#in~x|) [2021-12-15 23:42:31,993 INFO L858 garLoopResultBuilder]: For program point L31-3(lines 28 53) no Hoare annotation was computed. [2021-12-15 23:42:31,993 INFO L858 garLoopResultBuilder]: For program point __fpclassify_doubleFINAL(lines 28 53) no Hoare annotation was computed. [2021-12-15 23:42:31,993 INFO L858 garLoopResultBuilder]: For program point L48(lines 48 52) no Hoare annotation was computed. [2021-12-15 23:42:31,993 INFO L858 garLoopResultBuilder]: For program point L44(lines 44 52) no Hoare annotation was computed. [2021-12-15 23:42:31,993 INFO L861 garLoopResultBuilder]: At program point __fpclassify_doubleENTRY(lines 28 53) the Hoare annotation is: true [2021-12-15 23:42:31,993 INFO L858 garLoopResultBuilder]: For program point __fpclassify_doubleEXIT(lines 28 53) no Hoare annotation was computed. [2021-12-15 23:42:31,993 INFO L858 garLoopResultBuilder]: For program point L41(lines 41 52) no Hoare annotation was computed. [2021-12-15 23:42:31,993 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-15 23:42:31,993 INFO L858 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2021-12-15 23:42:31,993 INFO L858 garLoopResultBuilder]: For program point L62-2(line 62) no Hoare annotation was computed. [2021-12-15 23:42:31,993 INFO L854 garLoopResultBuilder]: At program point L62-3(lines 55 63) the Hoare annotation is: (and (= |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_isnan_double_#res#1| (_ bv0 32)) (= |ULTIMATE.start_fmax_double_#res#1| |ULTIMATE.start_main_~x~0#1|)) [2021-12-15 23:42:31,993 INFO L861 garLoopResultBuilder]: At program point L85(lines 65 86) the Hoare annotation is: true [2021-12-15 23:42:31,993 INFO L858 garLoopResultBuilder]: For program point L79(lines 79 82) no Hoare annotation was computed. [2021-12-15 23:42:31,993 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-15 23:42:31,993 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-15 23:42:31,993 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-15 23:42:31,994 INFO L854 garLoopResultBuilder]: At program point L59(line 59) the Hoare annotation is: (and (= |ULTIMATE.start_fmax_double_~x#1| |ULTIMATE.start_main_~x~0#1|) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_double_~y#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)))) (fp.eq |ULTIMATE.start_fmax_double_~x#1| |ULTIMATE.start_fmax_double_~x#1|) (= |ULTIMATE.start_isnan_double_#res#1| (_ bv0 32))) [2021-12-15 23:42:31,994 INFO L858 garLoopResultBuilder]: For program point L59-1(lines 59 60) no Hoare annotation was computed. [2021-12-15 23:42:31,994 INFO L854 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (and (= |ULTIMATE.start_fmax_double_~x#1| |ULTIMATE.start_main_~x~0#1|) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmax_double_~y#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)))) (fp.eq |ULTIMATE.start_fmax_double_~x#1| |ULTIMATE.start_fmax_double_~x#1|) (= |ULTIMATE.start_isnan_double_#res#1| (_ bv0 32))) [2021-12-15 23:42:31,994 INFO L858 garLoopResultBuilder]: For program point L57-1(lines 57 58) no Hoare annotation was computed. [2021-12-15 23:42:31,994 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2021-12-15 23:42:31,994 INFO L854 garLoopResultBuilder]: At program point L18(line 18) the Hoare annotation is: (and (let ((.cse0 (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|))) (or (and .cse0 (= |ULTIMATE.start_isnan_double_#res#1| (_ bv0 32))) (and (not .cse0) (= |ULTIMATE.start_isnan_double_#res#1| (_ bv1 32))))) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_main_~y~0#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))) [2021-12-15 23:42:31,994 INFO L858 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2021-12-15 23:42:31,995 INFO L858 garLoopResultBuilder]: For program point L74(lines 74 83) no Hoare annotation was computed. [2021-12-15 23:42:31,995 INFO L858 garLoopResultBuilder]: For program point L74-2(lines 74 83) no Hoare annotation was computed. [2021-12-15 23:42:31,997 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-15 23:42:31,998 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-15 23:42:32,003 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-12-15 23:42:32,009 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-12-15 23:42:32,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 11:42:32 BoogieIcfgContainer [2021-12-15 23:42:32,012 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-15 23:42:32,014 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-15 23:42:32,014 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-15 23:42:32,014 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-15 23:42:32,015 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:42:21" (3/4) ... [2021-12-15 23:42:32,017 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-15 23:42:32,021 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_double [2021-12-15 23:42:32,025 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2021-12-15 23:42:32,025 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-12-15 23:42:32,031 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-15 23:42:32,031 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-15 23:42:32,047 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((~fp.eq~DOUBLE(x, x) && \result == 0bv32) || (!~fp.eq~DOUBLE(x, x) && \result == 1bv32)) && (\exists currentRoundingMode : FloatRoundingMode :: y == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) [2021-12-15 23:42:32,048 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: x == \old(x) [2021-12-15 23:42:32,048 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((x == x && ~fp.eq~DOUBLE(x, x)) && \result == 0bv32) && \result == x [2021-12-15 23:42:32,059 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-15 23:42:32,059 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-15 23:42:32,060 INFO L158 Benchmark]: Toolchain (without parser) took 11350.17ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 37.3MB in the beginning and 50.7MB in the end (delta: -13.4MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. [2021-12-15 23:42:32,060 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 58.7MB. Free memory was 40.7MB in the beginning and 40.6MB in the end (delta: 44.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 23:42:32,060 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.13ms. Allocated memory is still 58.7MB. Free memory was 37.0MB in the beginning and 40.5MB in the end (delta: -3.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-15 23:42:32,061 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.70ms. Allocated memory is still 58.7MB. Free memory was 40.5MB in the beginning and 39.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 23:42:32,061 INFO L158 Benchmark]: Boogie Preprocessor took 40.14ms. Allocated memory is still 58.7MB. Free memory was 39.0MB in the beginning and 37.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 23:42:32,061 INFO L158 Benchmark]: RCFGBuilder took 342.21ms. Allocated memory is still 58.7MB. Free memory was 37.5MB in the beginning and 41.4MB in the end (delta: -3.8MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2021-12-15 23:42:32,062 INFO L158 Benchmark]: TraceAbstraction took 10653.84ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 40.9MB in the beginning and 22.6MB in the end (delta: 18.3MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. [2021-12-15 23:42:32,062 INFO L158 Benchmark]: Witness Printer took 45.27ms. Allocated memory is still 71.3MB. Free memory was 22.6MB in the beginning and 50.7MB in the end (delta: -28.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 23:42:32,066 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.11ms. Allocated memory is still 58.7MB. Free memory was 40.7MB in the beginning and 40.6MB in the end (delta: 44.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 230.13ms. Allocated memory is still 58.7MB. Free memory was 37.0MB in the beginning and 40.5MB in the end (delta: -3.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.70ms. Allocated memory is still 58.7MB. Free memory was 40.5MB in the beginning and 39.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.14ms. Allocated memory is still 58.7MB. Free memory was 39.0MB in the beginning and 37.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 342.21ms. Allocated memory is still 58.7MB. Free memory was 37.5MB in the beginning and 41.4MB in the end (delta: -3.8MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * TraceAbstraction took 10653.84ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 40.9MB in the beginning and 22.6MB in the end (delta: 18.3MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. * Witness Printer took 45.27ms. Allocated memory is still 71.3MB. Free memory was 22.6MB in the beginning and 50.7MB in the end (delta: -28.1MB). Peak memory consumption was 2.1MB. 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.6s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 66 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 62 mSDsluCounter, 1484 SdHoareTripleChecker+Invalid, 0.5s 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.2s 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, 1592 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-15 23:42:32,077 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-12-15 23:42:32,077 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: ((~fp.eq~DOUBLE(x, x) && \result == 0bv32) || (!~fp.eq~DOUBLE(x, x) && \result == 1bv32)) && (\exists currentRoundingMode : FloatRoundingMode :: y == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: x == \old(x) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((x == x && ~fp.eq~DOUBLE(x, x)) && \result == 0bv32) && \result == x RESULT: Ultimate proved your program to be correct! [2021-12-15 23:42:32,135 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